Oliver Schaudt

ORCID

Publication Activity (10 Years)

Years Active: 2010-2024
Publications (10 Years): 45

Top Venues

CoRR

SIAM J. Discret. Math.

J. Graph Theory

University of Cologne (PHD)

Education History

University of Cologne

PHD

Publications

Jan Goedgebeur, Jorik Jooken, Karolina Okrasa, Pawel Rzazewski, Oliver Schaudt
Minimal Obstructions to C₅-Coloring in Hereditary Graph Classes. MFCS (2024)
Toni Böhnlein, Oliver Schaudt, Joachim Schauer
Stackelberg packing games. Theor. Comput. Sci. 943 (2023)
Maria Chudnovsky, Neeldhara Misra, Daniël Paulusma, Oliver Schaudt, Akanksha Agrawal
Vertex Partitioning in Graphs: From Structure to Algorithms (Dagstuhl Seminar 22481). Dagstuhl Reports 12 (11) (2022)
David Adjiashvili, Felix Hommelsheim, Moritz Mühlenthaler, Oliver Schaudt
Fault-Tolerant Edge-Disjoint s-t Paths - Beyond Uniform Faults. SWAT (2022)
Henning Bruhn, Felix Joos, Oliver Schaudt
Erdös-Pósa Property for Labeled Minors: 2-Connected Minors. SIAM J. Discret. Math. 35 (2) (2021)
Flavia Bonomo-Braberman, Maria Chudnovsky, Jan Goedgebeur, Peter Maceli, Oliver Schaudt, Maya Stein, Mingxian Zhong
Better 3-coloring algorithms: Excluding a triangle and a seven vertex path. Theor. Comput. Sci. 850 (2021)
Bubacarr Bah, Jannis Kurtz, Oliver Schaudt
Discrete optimization methods for group model selection in compressed sensing. Math. Program. 190 (1) (2021)
Toni Böhnlein, Stefan Kratsch, Oliver Schaudt
Revenue maximization in Stackelberg Pricing Games: beyond the combinatorial setting. Math. Program. 187 (1) (2021)
Felix Hommelsheim, Moritz Mühlenthaler, Oliver Schaudt
How to Secure Matchings against Edge Failures. SIAM J. Discret. Math. 35 (3) (2021)
Britta Peis, Oliver Schaudt, Heiko Röglin, Bert Randerath, Rainer Schrader, Frank Vallentin
Preface: 15th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW 2017). Discret. Appl. Math. 272 (2020)
David Adjiashvili, Felix Hommelsheim, Moritz Mühlenthaler, Oliver Schaudt
Fault-Tolerant Edge-Disjoint Paths - Beyond Uniform Faults. CoRR (2020)
Samuel Fiorini, Gwenaël Joret, Oliver Schaudt
Improved approximation algorithms for hitting 3-vertex paths. Math. Program. 182 (1) (2020)
Toni Böhnlein, Oliver Schaudt
On the Complexity of Stackelberg Matroid Pricing Problems. IWOCA (2020)
Maria Chudnovsky, Jan Goedgebeur, Oliver Schaudt, Mingxian Zhong
Obstructions for three-coloring graphs without induced paths on six vertices. J. Comb. Theory, Ser. B 140 (2020)
Maria Chudnovsky, Jan Goedgebeur, Oliver Schaudt, Mingxian Zhong
Obstructions for Three-Coloring and List Three-Coloring H-Free Graphs. SIAM J. Discret. Math. 34 (1) (2020)
Maria Chudnovsky, Oliver Schaudt, Sophie Spirkl, Maya Stein, Mingxian Zhong
Approximately Coloring Graphs Without Long Induced Paths. Algorithmica 81 (8) (2019)
Felix Hommelsheim, Moritz Mühlenthaler, Oliver Schaudt
How to Secure Matchings Against Edge Failures. STACS (2019)
Maria Chudnovsky, Chun-Hung Liu, Oliver Schaudt, Sophie Spirkl, Nicolas Trotignon, Kristina Vuskovic
Triangle-free graphs that do not contain an induced subdivision of K4 are 3-colorable. J. Graph Theory 92 (2) (2019)
Toni Böhnlein, Oliver Schaudt, Joachim Schauer
Stackelberg Packing Games. WADS (2019)
Maria Chudnovsky, Daniël Paulusma, Oliver Schaudt
Graph Colouring: from Structure to Algorithms (Dagstuhl Seminar 19271). Dagstuhl Reports 9 (6) (2019)
Oliver Schaudt, Maya Stein
Partitioning two?coloured complete multipartite graphs into monochromatic paths and cycles. J. Graph Theory 91 (2) (2019)
Bubacarr Bah, Jannis Kurtz, Oliver Schaudt
Discrete Optimization Methods for Group Model Selection in Compressed Sensing. CoRR (2019)
Jan Goedgebeur, Oliver Schaudt
-critical H-free graphs. J. Graph Theory 87 (2) (2018)
Flavia Bonomo, Maria Chudnovsky, Peter Maceli, Oliver Schaudt, Maya Stein, Mingxian Zhong
Three-Coloring and List Three-Coloring of Graphs Without Induced Paths on Seven Vertices. Comb. 38 (4) (2018)
Henning Bruhn, Felix Joos, Oliver Schaudt
Long cycles through prescribed vertices have the Erdős-Pósa property. J. Graph Theory 87 (3) (2018)
Samuel Fiorini, Gwenaël Joret, Oliver Schaudt
Improved approximation algorithms for hitting 3-vertex paths. CoRR (2018)
Viktor Bindewald, Felix Hommelsheim, Moritz Mühlenthaler, Oliver Schaudt
How to Secure Matchings Against Edge Failures. CoRR (2018)
Oliver Schaudt, Fabian Senger
The Parameterized Complexity of the Equidomination Problem. CoRR (2017)
Maria Chudnovsky, Oliver Schaudt, Sophie Spirkl, Maya Stein, Mingxian Zhong
Approximately Coloring Graphs Without Long Induced Paths. WG (2017)
Toni Böhnlein, Stefan Kratsch, Oliver Schaudt
Revenue Maximization in Stackelberg Pricing Games: Beyond the Combinatorial Setting. ICALP (2017)
Maria Chudnovsky, Jan Goedgebeur, Oliver Schaudt, Mingxian Zhong
Obstructions for three-coloring and list three-coloring H-free graphs. CoRR (2017)
Henning Bruhn, Oliver Schaudt
Fast Algorithms for Delta-Separated Sparsity Projection. CoRR (2017)
Vera Weil, Oliver Schaudt
On bounding the difference between the maximum degree and the chromatic number by a constant. Discret. Appl. Math. 231 (2017)
Henning Bruhn, Oliver Schaudt
The union-closed sets conjecture almost holds for almost all random bipartite graphs. Eur. J. Comb. 59 (2017)
Richard Lang, Oliver Schaudt, Maya Stein
into Five Monochromatic Cycles. SIAM J. Discret. Math. 31 (2) (2017)
Oliver Schaudt, Fabian Senger
The Parameterized Complexity of the Equidomination Problem. WG (2017)
Henning Bruhn, Morgan Chopin, Felix Joos, Oliver Schaudt
Structural Parameterizations for Boxicity. Algorithmica 74 (4) (2016)
Van Bang Le, Andrea Oversberg, Oliver Schaudt
A unified approach to recognize squares of split graphs. Theor. Comput. Sci. 648 (2016)
Maria Chudnovsky, Oliver Schaudt, Sophie Spirkl, Maya Stein, Mingxian Zhong
Approximately coloring graphs without long induced paths. CoRR (2016)
Jan Goedgebeur, Oliver Schaudt
Exhaustive Generation of k-Critical ℋ-Free Graphs. WG (2016)
Samuel Fiorini, Gwenaël Joret, Oliver Schaudt
Improved Approximation Algorithms for Hitting 3-Vertex Paths. IPCO (2016)
Eglantine Camby, Oliver Schaudt
-Free Graphs. Algorithmica 75 (1) (2016)
Henning Bruhn, Oliver Schaudt
Claw-Free t-Perfect Graphs Can Be Recognized in Polynomial Time. SIAM J. Discret. Math. 30 (2) (2016)
Maria Chudnovsky, Jan Goedgebeur, Oliver Schaudt, Mingxian Zhong
Obstructions for three-coloring graphs with one forbidden induced subgraph. SODA (2016)
Dorothea Baumeister, Toni Böhnlein, Lisa Rey, Oliver Schaudt, Ann-Kathrin Selker
Minisum and Minimax Committee Election Rules for General Preference Types. ECAI (2016)
Oliver Schaudt
On disjoint maximal independent sets in graphs. Inf. Process. Lett. 115 (1) (2015)
Henning Bruhn, Oliver Schaudt
The Journey of the Union-Closed Sets Conjecture. Graphs Comb. 31 (6) (2015)
Maria Chudnovsky, Jan Goedgebeur, Oliver Schaudt, Mingxian Zhong
Obstructions for three-coloring graphs without induced paths on six vertices. CoRR (2015)
Eun Jung Kim, Martin Milanic, Oliver Schaudt
Recognizing k-equistable Graphs in FPT Time. WG (2015)
Oliver Schaudt, Vera Weil
On Bounding the Difference of the Maximum Degree and the Clique Number. Graphs Comb. 31 (5) (2015)
Jan Goedgebeur, Oliver Schaudt
Exhaustive generation of $k$-critical $\mathcal H$-free graphs. CoRR (2015)
Van Bang Le, Andrea Oversberg, Oliver Schaudt
Polynomial time recognition of squares of Ptolemaic graphs and 3-sun-free split graphs. Theor. Comput. Sci. 602 (2015)
Richard Lang, Oliver Schaudt, Maya Stein
Partitioning 3-edge-coloured complete bipartite graphs into monochromatic cycles. Electron. Notes Discret. Math. 49 (2015)
Eun Jung Kim, Martin Milanic, Oliver Schaudt
Recognizing k-equistable graphs in FPT time. CoRR (2015)
Oliver Schaudt, Maya Stein
Partitioning two-coloured complete multipartite graphs into monochromatic paths and cycles. Electron. Notes Discret. Math. 50 (2015)
Flavia Bonomo, Oliver Schaudt, Maya Stein, Mario Valencia-Pabon
b-Coloring is NP-hard on Co-bipartite Graphs and Polytime Solvable on Tree-Cographs. Algorithmica 73 (2) (2015)
Henning Bruhn, Pierre Charbit, Oliver Schaudt, Jan Arne Telle
The graph formulation of the union-closed sets conjecture. Eur. J. Comb. 43 (2015)
Oliver Schaudt, Vera Weil
On bounding the difference between the maximum degree and the chromatic number by a constant. CoRR (2015)
Van Bang Le, Andrea Oversberg, Oliver Schaudt
Polynomial time recognition of squares of ptolemaic graphs and 3-sun-free split graphs. CoRR (2014)
Van Bang Le, Andrea Oversberg, Oliver Schaudt
Squares of $3$-sun-free split graphs. CoRR (2014)
Henning Bruhn, Morgan Chopin, Felix Joos, Oliver Schaudt
Structural Parameterizations for Boxicity. WG (2014)
Flavia Bonomo, Oliver Schaudt, Maya Jakobine Stein
3-Colouring graphs without triangles or induced paths on seven vertices. CoRR (2014)
Van Bang Le, Andrea Oversberg, Oliver Schaudt
Polynomial Time Recognition of Squares of Ptolemaic Graphs and 3-sun-free Split Graphs. WG (2014)
Eglantine Camby, Oliver Schaudt
The price of connectivity for dominating set: Upper bounds and complexity. Discret. Appl. Math. 177 (2014)
Oliver Schaudt, Maya Stein
Partitioning two-coloured complete multipartite graphs into monochromatic paths. CoRR (2014)
Henning Bruhn, Oliver Schaudt
Claw-Free t-Perfect Graphs Can Be Recognised in Polynomial Time. IPCO (2014)
Flavia Bonomo, Oliver Schaudt, Maya Stein, Mario Valencia-Pabon
b-Coloring is NP-Hard on Co-Bipartite Graphs and Polytime Solvable on Tree-Cographs. ISCO (2014)
Eglantine Camby, Oliver Schaudt
A new characterization of $P_k$-free graphs. CoRR (2014)
Martin Milanic, Andrea Oversberg, Oliver Schaudt
A characterization of line graphs that are squares of graphs. Discret. Appl. Math. 173 (2014)
Eglantine Camby, Oliver Schaudt
-free Graphs. WG (2014)
Eglantine Camby, Jean Cardinal, Samuel Fiorini, Oliver Schaudt
The Price of Connectivity for Vertex Cover. Discret. Math. Theor. Comput. Sci. 16 (1) (2014)
Henning Bruhn, Oliver Schaudt
Claw-free t-perfect graphs can be recognised in polynomial time. CoRR (2013)
Martin Milanic, Oliver Schaudt
Computing square roots of trivially perfect and threshold graphs. Discret. Appl. Math. 161 (10-11) (2013)
Eglantine Camby, Jean Cardinal, Samuel Fiorini, Oliver Schaudt
The Price of Connectivity for Vertex Cover CoRR (2013)
Eglantine Camby, Oliver Schaudt
Connected dominating set in graphs without long paths and cycles. CTW (2013)
Eglantine Camby, Oliver Schaudt
A Note on Connected Dominating Set in Graphs Without Long Paths And Cycles CoRR (2013)
Henning Bruhn, Oliver Schaudt
The journey of the union-closed sets conjecture. CoRR (2013)
Oliver Schaudt
On dominating sets whose induced subgraphs have a bounded diameter. Discret. Appl. Math. 161 (16-17) (2013)
Flavia Bonomo, Oliver Schaudt, Maya Stein, Mario Valencia-Pabon
b-coloring is NP-hard on co-bipartite graphs and polytime solvable on tree-cographs. CoRR (2013)
Oliver Schaudt, Rainer Schrader, Vera Weil
On the separability of graphs. Discret. Math. 313 (6) (2013)
Oliver Schaudt
On graphs for which the connected domination number is at most the total domination number. Discret. Appl. Math. 160 (7-8) (2012)
Oliver Schaudt, Rainer Schrader
The complexity of connected dominating sets and total dominating sets with specified induced subgraphs. Inf. Process. Lett. 112 (24) (2012)
Oliver Schaudt
Efficient total domination in digraphs. J. Discrete Algorithms 15 (2012)
Eglantine Camby, Jean Cardinal, Samuel Fiorini, Oliver Schaudt
The Price of Connectivity for Vertex Cover: Perfect, Near-Perfect and Critical Graphs. CTW (2012)
Oliver Schaudt
A note on connected dominating sets of distance-hereditary graphs. Discret. Appl. Math. 160 (9) (2012)
Oliver Schaudt, Vera Weil
Graphs in Which the Difference of the Maximum Clique Number and the Maximum Degree Is Bounded by a Constant. CTW (2012)
Oliver Schaudt, Rainer Schrader, Vera Weil
On the Separability of Graphs. CTW (2012)
Oliver Schaudt
)-free graphs. Discuss. Math. Graph Theory 32 (3) (2012)
Oliver Schaudt
Total domination versus paired domination. Discuss. Math. Graph Theory 32 (3) (2012)
Oliver Schaudt
On weighted efficient total domination. J. Discrete Algorithms 10 (2012)
Oliver Schaudt
Die Struktur dominierender Mengen in Graphen. Ausgezeichnete Informatikdissertationen (2011)
Oliver Schaudt
On the existence of total dominating subgraphs with a prescribed additive hereditary property. Discret. Math. 311 (18-19) (2011)
Oliver Schaudt
Efficient Total Domination. CTW (2010)

Oliver Schaudt.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Oliver Schaudt