Universität zu Köln

Journal Article

Boehnlein, Toni, Kratsch, Stefan and Schaudt, Oliver . Revenue maximization in Stackelberg Pricing Games: beyond the combinatorial setting. Math. Program.. HEIDELBERG: SPRINGER HEIDELBERG. ISSN 1436-4646

Bohnlein, Toni, Schaudt, Oliver and Schauer, Joachim (2023). Stackelberg packing games. Theor. Comput. Sci., 943. S. 16 - 36. AMSTERDAM: ELSEVIER. ISSN 1879-2294

Bonomo, Flavia, Chudnovsky, Maria, Maceli, Peter, Schaudt, Oliver, Steinz, Maya and Zhong, Mingxian (2018). Three-Coloring and List Three-Coloring of Graphs Without Induced Paths on Seven Vertices. Combinatorica, 38 (4). S. 779 - 802. HEIDELBERG: SPRINGER HEIDELBERG. ISSN 1439-6912

Bonomo-Braberman, Flavia, Chudnovsky, Maria, Goedgebeur, Jan ORCID: 0000-0001-8984-2463, Maceli, Peter, Schaudt, Oliver, Stein, Maya and Zhong, Mingxian ORCID: 0000-0001-5924-1296 (2021). Better 3-coloring algorithms: Excluding a triangle and a seven vertex path. Theor. Comput. Sci., 850. S. 98 - 116. AMSTERDAM: ELSEVIER. ISSN 1879-2294

Bruhn, Henning, Charbit, Pierre, Schaudt, Oliver and Telle, Jan Arne (2015). The graph formulation of the union-closed sets conjecture. Eur. J. Comb., 43. S. 210 - 220. LONDON: ACADEMIC PRESS LTD- ELSEVIER SCIENCE LTD. ISSN 1095-9971

Bruhn, Henning, Chopin, Morgan, Joos, Felix and Schaudt, Oliver (2016). Structural Parameterizations for Boxicity. Algorithmica, 74 (4). S. 1453 - 1473. NEW YORK: SPRINGER. ISSN 1432-0541

Bruhn, Henning, Joos, Felix and Schaudt, Oliver (2018). Long cycles through prescribed vertices have the Erdos-Posa property. J. Graph Theory, 87 (3). S. 275 - 285. HOBOKEN: WILEY. ISSN 1097-0118

Bruhn, Henning and Schaudt, Oliver (2016). CLAW-FREE t-PERFECT GRAPHS CAN BE RECOGNIZED IN POLYNOMIAL TIME. SIAM Discret. Math., 30 (2). S. 832 - 856. PHILADELPHIA: SIAM PUBLICATIONS. ISSN 1095-7146

Bruhn, Henning and Schaudt, Oliver (2015). The Journey of the Union-Closed Sets Conjecture. Graphs Comb., 31 (6). S. 2043 - 2075. TOKYO: SPRINGER JAPAN KK. ISSN 1435-5914

Camby, Eglantine ORCID: 0000-0002-7290-9286 and Schaudt, Oliver (2016). A New Characterization of P-k-Free Graphs. Algorithmica, 75 (1). S. 205 - 218. NEW YORK: SPRINGER. ISSN 1432-0541

Chudnovsky, Maria, Goedgebeur, Jan ORCID: 0000-0001-8984-2463, Schaudt, Oliver and Zhong, Mingxian ORCID: 0000-0001-5924-1296 (2020). Obstructions for three-coloring graphs without induced paths on six vertices. J. Comb. Theory Ser. B, 140. S. 45 - 84. SAN DIEGO: ACADEMIC PRESS INC ELSEVIER SCIENCE. ISSN 1096-0902

Chudnovsky, Maria, Liu, Chun-Hung, Schaudt, Oliver, Spirkl, Sophie, Trotignon, Nicolas and Vuskovic, Kristina (2019). Triangle-free graphs that do not contain an induced subdivision of K-4 are 3-colorable. J. Graph Theory, 92 (2). S. 67 - 96. HOBOKEN: WILEY. ISSN 1097-0118

Chudnovsky, Maria, Schaudt, Oliver, Spirkl, Sophie, Stein, Maya and Zhong, Mingxian (2019). Approximately Coloring Graphs Without Long Induced Paths. Algorithmica, 81 (8). S. 3186 - 3200. NEW YORK: SPRINGER. ISSN 1432-0541

Fiorini, Samuel, Joret, Gwenael ORCID: 0000-0002-7157-6694 and Schaudt, Oliver (2020). Improved approximation algorithms for hitting 3-vertex paths. Math. Program., 182 (1-2). S. 355 - 368. HEIDELBERG: SPRINGER HEIDELBERG. ISSN 1436-4646

Goedgebeur, Jan ORCID: 0000-0001-8984-2463 and Schaudt, Oliver (2018). Exhaustive generation of k-critical H-free graphs. J. Graph Theory, 87 (2). S. 188 - 208. HOBOKEN: WILEY. ISSN 1097-0118

Lang, Richard, Schaudt, Oliver and Stein, Maya (2017). ALMOST PARTITIONING A 3-EDGE-COLORED Kn,n INTO FIVE MONOCHROMATIC CYCLES. SIAM Discret. Math., 31 (2). S. 1374 - 1403. PHILADELPHIA: SIAM PUBLICATIONS. ISSN 1095-7146

Le, Van Bang, Oversberg, Andrea and Schaudt, Oliver (2015). Polynomial time recognition of squares of Ptolemaic graphs and 3-sun-free split graphs. Theor. Comput. Sci., 602. S. 39 - 50. AMSTERDAM: ELSEVIER. ISSN 1879-2294

Milanic, Martin ORCID: 0000-0002-8222-8097, Oversberg, Andrea and Schaudt, Oliver (2014). A characterization of line graphs that are squares of graphs. Discret Appl. Math., 173. S. 83 - 92. AMSTERDAM: ELSEVIER SCIENCE BV. ISSN 1872-6771

Oversberg, Andrea and Schaudt, Oliver (2016). A unified approach to recognize squares of split graphs. Theor. Comput. Sci., 648. S. 26 - 34. AMSTERDAM: ELSEVIER SCIENCE BV. ISSN 1879-2294

Peis, Britta, Schaudt, Oliver, Roeglin, Heiko, Randerath, Bert, Schrader, Rainer and Vallentin, Frank ORCID: 0000-0002-3205-4607 (2020). Preface: 15th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW 2017). Discret Appl. Math., 272. S. 1 - 2. AMSTERDAM: ELSEVIER. ISSN 1872-6771

Schaudt, Oliver (2015). On disjoint maximal independent sets in graphs. Inf. Process. Lett., 115 (1). S. 23 - 28. AMSTERDAM: ELSEVIER SCIENCE BV. ISSN 1872-6119

Schaudt, Oliver (2013). On dominating sets whose induced subgraphs have a bounded diameter. Discret Appl. Math., 161 (16-17). S. 2647 - 2653. AMSTERDAM: ELSEVIER SCIENCE BV. ISSN 1872-6771

Schaudt, Oliver (2011). On the existence of total dominating subgraphs with a prescribed additive hereditary property. Discret. Math., 311 (18-19). S. 2095 - 2102. AMSTERDAM: ELSEVIER SCIENCE BV. ISSN 0012-365X

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 (2012). On weighted efficient total domination. Journal of Discrete Algorithms, 10 (1). pp. 61-69. Elsevier.

Schaudt, Oliver and Schrader, Rainer (2012). The complexity of connected dominating sets and total dominating sets with specified induced subgraphs. Inf. Process. Lett., 112 (24). S. 953 - 958. AMSTERDAM: ELSEVIER. ISSN 1872-6119

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

Schaudt, Oliver and Stein, Maya (2019). Partitioning two-coloured complete multipartite graphs into monochromatic paths and cycles. J. Graph Theory, 91 (2). S. 122 - 148. HOBOKEN: WILEY. ISSN 1097-0118

Schaudt, Oliver and Weil, Vera (2015). On Bounding the Difference of the Maximum Degree and the Clique Number. Graphs Comb., 31 (5). S. 1689 - 1703. TOKYO: SPRINGER JAPAN KK. ISSN 1435-5914

Weil, Vera and Schaudt, Oliver (2017). On bounding the difference between the maximum degree and the chromatic number by a constant. Discret Appl. Math., 231. S. 228 - 235. AMSTERDAM: ELSEVIER SCIENCE BV. ISSN 1872-6771

Preprints, Working Papers or Reports

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

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 (2011). Paired and induced-paired domination in (E,net)-free graphs. Working Paper.

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.

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

Thesis Abstract

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