Universität zu Köln

2013

Schaudt, Oliver, Schrader, Rainer and Weil, Vera (2013). On the separability of graphs. Discrete Mathematics, 313 (6). pp. 809-820. Elsevier.

2012

Schaudt, Oliver (2012). On weighted efficient total domination. Journal of Discrete Algorithms, 10 (1). pp. 61-69. Elsevier.

2011

Schaudt, Oliver (2011). Efficient total domination in digraphs. Working Paper.

Schaudt, Oliver (2011). On the existence of total dominating subgraphs with a prescribed additive hereditary property. Discrete Mathematics, 311 (18-19). pp. 2095-2101. Elsevier Science.

Schaudt, Oliver (2011). Paired and induced-paired domination in (E,net)-free graphs. Working Paper.

Schaudt, Oliver (2011). The Structure of Dominating Subgraphs. Thesis Abstract, Universität zu Köln.

Schaudt, Oliver (2011). Total domination versus paired domination. Working Paper.

Schaudt, Oliver (2011). When the connected domination number is at most the total domination number. Working Paper.

Schaudt, Oliver (2011). A note on connected dominating sets of distance-hereditary graphs. Working Paper.

2010

Schaudt, Oliver (2010). A Graph Class related to the Structural Domination Problem. Working Paper.

Schaudt, Oliver (2010). On efficient total domination. Working Paper.

Schaudt, Oliver and Schrader, Rainer (2010). The complexity of connected domination and total domination by restricted induced graphs. Working Paper.