Efficient Total Domination. - Oliver Schaudt (CTW, 2010)

Die Struktur dominierender Mengen in Graphen. - Oliver Schaudt (Ausgezeichnete Informatikdissertationen, 2011)

On the existence of total dominating subgraphs with a prescribed additive hereditary property. - Oliver Schaudt (Discret. Math., 2011)

The Structure of Dominating Subgraphs. - Oliver Schaudt (2011)

The Price of Connectivity for Vertex Cover: Perfect, Near-Perfect and Critical Graphs. - Eglantine Camby; Jean Cardinal; Samuel Fiorini; Oliver Schaudt (CTW, 2012)

Graphs in Which the Difference of the Maximum Clique Number and the Maximum Degree Is Bounded by a Constant. - Oliver Schaudt; Vera Weil (CTW, 2012)

On graphs for which the connected domination number is at most the total domination number. - Oliver Schaudt (Discret. Appl. Math., 2012)

A note on connected dominating sets of distance-hereditary graphs. - Oliver Schaudt (Discret. Appl. Math., 2012)

Total domination versus paired domination. - Oliver Schaudt (Discuss. Math. Graph Theory, 2012)

Paired- and induced paired-domination in (E, net)-free graphs. - Oliver Schaudt (Discuss. Math. Graph Theory, 2012)

The complexity of connected dominating sets and total dominating sets with specified induced subgraphs. - Oliver Schaudt; Rainer Schrader (Inf. Process. Lett., 2012)

On weighted efficient total domination. - Oliver Schaudt (J. Discrete Algorithms, 2012)

Efficient total domination in digraphs. - Oliver Schaudt (J. Discrete Algorithms, 2012)

Connected dominating set in graphs without long paths and cycles. - Eglantine Camby; Oliver Schaudt (CTW, 2013)

A Note on Connected Dominating Set in Graphs Without Long Paths And Cycles - Eglantine Camby; Oliver Schaudt (CoRR, 2013)

Computing square roots of trivially perfect and threshold graphs. - Martin Milanic; Oliver Schaudt (Discret. Appl. Math., 2013)

On dominating sets whose induced subgraphs have a bounded diameter. - Oliver Schaudt (Discret. Appl. Math., 2013)

On the separability of graphs. - Oliver Schaudt; Rainer Schrader; Vera Weil (Discret. Math., 2013)

Claw-Free t-Perfect Graphs Can Be Recognised in Polynomial Time. - Henning Bruhn; Oliver Schaudt (IPCO, 2014)

3-Colouring graphs without triangles or induced paths on seven vertices. - Flavia Bonomo; Oliver Schaudt; Maya Jakobine Stein (CoRR, 2014)

A new characterization of $P_k$-free graphs. - Eglantine Camby; Oliver Schaudt (CoRR, 2014)

Squares of $3$-sun-free split graphs. - Van Bang Le; Andrea Oversberg; Oliver Schaudt (CoRR, 2014)

Partitioning two-coloured complete multipartite graphs into monochromatic paths. - Oliver Schaudt; Maya Stein (CoRR, 2014)

The price of connectivity for dominating set: Upper bounds and complexity. - Eglantine Camby; Oliver Schaudt (Discret. Appl. Math., 2014)

A characterization of line graphs that are squares of graphs. - Martin Milanic; Andrea Oversberg; Oliver Schaudt (Discret. Appl. Math., 2014)

The Price of Connectivity for Vertex Cover. - Eglantine Camby; Jean Cardinal; Samuel Fiorini; Oliver Schaudt (Discret. Math. Theor. Comput. Sci., 2014)

Recognizing k-equistable Graphs in FPT Time. - Eun Jung Kim 002; Martin Milanic; Oliver Schaudt (WG, 2015)

b-Coloring is NP-hard on Co-bipartite Graphs and Polytime Solvable on Tree-Cographs. - Flavia Bonomo; Oliver Schaudt; Maya Stein; Mario Valencia-Pabon (Algorithmica, 2015)

Exhaustive generation of $k$-critical $ mathcal H$-free graphs. - Jan Goedgebeur; Oliver Schaudt (CoRR, 2015)

The graph formulation of the union-closed sets conjecture. - Henning Bruhn; Pierre Charbit; Oliver Schaudt; Jan Arne Telle (Eur. J. Comb., 2015)

Partitioning 3-edge-coloured complete bipartite graphs into monochromatic cycles. - Richard Lang; Oliver Schaudt; Maya Stein (Electron. Notes Discret. Math., 2015)

The Journey of the Union-Closed Sets Conjecture. - Henning Bruhn; Oliver Schaudt (Graphs Comb., 2015)

On Bounding the Difference of the Maximum Degree and the Clique Number. - Oliver Schaudt; Vera Weil (Graphs Comb., 2015)

On disjoint maximal independent sets in graphs. - Oliver Schaudt (Inf. Process. Lett., 2015)

Polynomial time recognition of squares of Ptolemaic graphs and 3-sun-free split graphs. - Van Bang Le; Andrea Oversberg; Oliver Schaudt (Theor. Comput. Sci., 2015)

Minisum and Minimax Committee Election Rules for General Preference Types. - Dorothea Baumeister; Toni Böhnlein; Lisa Rey; Oliver Schaudt; Ann-Kathrin Selker (ECAI, 2016)

Obstructions for three-coloring graphs with one forbidden induced subgraph. - Maria Chudnovsky; Jan Goedgebeur; Oliver Schaudt; Mingxian Zhong (SODA, 2016)

Exhaustive Generation of k-Critical ℋ-Free Graphs. - Jan Goedgebeur; Oliver Schaudt (WG, 2016)

Structural Parameterizations for Boxicity. - Henning Bruhn; Morgan Chopin; Felix Joos; Oliver Schaudt (Algorithmica, 2016)

A New Characterization of Pk-Free Graphs. - Eglantine Camby; Oliver Schaudt (Algorithmica, 2016)

Claw-Free t-Perfect Graphs Can Be Recognized in Polynomial Time. - Henning Bruhn; Oliver Schaudt (SIAM J. Discret. Math., 2016)

A unified approach to recognize squares of split graphs. - Van Bang Le; Andrea Oversberg; Oliver Schaudt (Theor. Comput. Sci., 2016)

The Parameterized Complexity of the Equidomination Problem. - Oliver Schaudt; Fabian Senger (WG, 2017)

Fast Algorithms for Delta-Separated Sparsity Projection. - Henning Bruhn; Oliver Schaudt (CoRR, 2017)

On bounding the difference between the maximum degree and the chromatic number by a constant. - Vera Weil; Oliver Schaudt (Discret. Appl. Math., 2017)

The union-closed sets conjecture almost holds for almost all random bipartite graphs. - Henning Bruhn; Oliver Schaudt (Eur. J. Comb., 2017)

Almost Partitioning a 3-Edge-Colored Kn, n into Five Monochromatic Cycles. - Richard Lang; Oliver Schaudt; Maya Stein (SIAM J. Discret. Math., 2017)

Three-Coloring and List Three-Coloring of Graphs Without Induced Paths on Seven Vertices. - Flavia Bonomo; Maria Chudnovsky; Peter Maceli; Oliver Schaudt; Maya Stein; Mingxian Zhong (Comb., 2018)

How to Secure Matchings Against Edge Failures. - Viktor Bindewald; Felix Hommelsheim; Moritz Mühlenthaler; Oliver Schaudt (CoRR, 2018)

Long cycles through prescribed vertices have the Erdős-Pósa property. - Henning Bruhn; Felix Joos; Oliver Schaudt (J. Graph Theory, 2018)

Exhaustive generation of k-critical H-free graphs. - Jan Goedgebeur; Oliver Schaudt (J. Graph Theory, 2018)

Approximately Coloring Graphs Without Long Induced Paths. - Maria Chudnovsky; Oliver Schaudt; Sophie Spirkl; Maya Stein; Mingxian Zhong (Algorithmica, 2019)

Graph Colouring: from Structure to Algorithms (Dagstuhl Seminar 19271). - Maria Chudnovsky; Daniël Paulusma; Oliver Schaudt (Dagstuhl Reports, 2019)

Triangle-free graphs that do not contain an induced subdivision of K4 are 3-colorable. - Maria Chudnovsky; Chun-Hung Liu; Oliver Schaudt; Sophie Spirkl; Nicolas Trotignon; Kristina Vuskovic (J. Graph Theory, 2019)

Partitioning two?coloured complete multipartite graphs into monochromatic paths and cycles. - Oliver Schaudt; Maya Stein (J. Graph Theory, 2019)

On the Complexity of Stackelberg Matroid Pricing Problems. - Toni Böhnlein; Oliver Schaudt (IWOCA, 2020)

Fault-Tolerant Edge-Disjoint Paths - Beyond Uniform Faults. - David Adjiashvili; Felix Hommelsheim; Moritz Mühlenthaler; Oliver Schaudt (CoRR, 2020)

Preface: 15th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW 2017). - Britta Peis; Oliver Schaudt; Heiko Röglin; Bert Randerath; Rainer Schrader; Frank Vallentin (Discret. Appl. Math., 2020)

Obstructions for three-coloring graphs without induced paths on six vertices. - Maria Chudnovsky; Jan Goedgebeur; Oliver Schaudt; Mingxian Zhong (J. Comb. Theory, Ser. B, 2020)

Improved approximation algorithms for hitting 3-vertex paths. - Samuel Fiorini; Gwenaël Joret; Oliver Schaudt (Math. Program., 2020)

Obstructions for Three-Coloring and List Three-Coloring H-Free Graphs. - Maria Chudnovsky; Jan Goedgebeur; Oliver Schaudt; Mingxian Zhong (SIAM J. Discret. Math., 2020)

Discrete optimization methods for group model selection in compressed sensing. - Bubacarr Bah; Jannis Kurtz; Oliver Schaudt (Math. Program., 2021)

Revenue maximization in Stackelberg Pricing Games: beyond the combinatorial setting. - Toni Böhnlein; Stefan Kratsch; Oliver Schaudt (Math. Program., 2021)

Erdös-Pósa Property for Labeled Minors: 2-Connected Minors. - Henning Bruhn; Felix Joos; Oliver Schaudt (SIAM J. Discret. Math., 2021)

How to Secure Matchings against Edge Failures. - Felix Hommelsheim; Moritz Mühlenthaler; Oliver Schaudt (SIAM J. Discret. Math., 2021)

Better 3-coloring algorithms: Excluding a triangle and a seven vertex path. - Flavia Bonomo-Braberman; Maria Chudnovsky; Jan Goedgebeur; Peter Maceli; Oliver Schaudt; Maya Stein; Mingxian Zhong (Theor. Comput. Sci., 2021)

Fault-Tolerant Edge-Disjoint s-t Paths - Beyond Uniform Faults. - David Adjiashvili; Felix Hommelsheim; Moritz Mühlenthaler; Oliver Schaudt (SWAT, 2022)

Vertex Partitioning in Graphs: From Structure to Algorithms (Dagstuhl Seminar 22481). - Maria Chudnovsky; Neeldhara Misra; Daniël Paulusma; Oliver Schaudt; Akanksha Agrawal 001 (Dagstuhl Reports, 2022)

Stackelberg packing games. - Toni Böhnlein; Oliver Schaudt; Joachim Schauer (Theor. Comput. Sci., 2023)

Minimal Obstructions to C₅-Coloring in Hereditary Graph Classes. - Jan Goedgebeur; Jorik Jooken; Karolina Okrasa; Pawel Rzazewski; Oliver Schaudt (MFCS, 2024)

Efficient Quantum Convolutional Neural Networks for Image Classification: Overcoming Hardware Constraints. - Peter Röseler; Oliver Schaudt; Helmut Berg; Christian Bauckhage; Matthias Koch (CoRR, 2025)