Oliver Schaudt

According to our database1, Oliver Schaudt authored at least 65 papers between 2010 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2020
Obstructions for Three-Coloring and List Three-Coloring H-Free Graphs.
SIAM J. Discret. Math., 2020

Improved approximation algorithms for hitting 3-vertex paths.
Math. Program., 2020

Obstructions for three-coloring graphs without induced paths on six vertices.
J. Comb. Theory, Ser. B, 2020

Preface: 15th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW 2017).
Discret. Appl. Math., 2020

Fault-Tolerant Edge-Disjoint Paths - Beyond Uniform Faults.
CoRR, 2020

On the Complexity of Stackelberg Matroid Pricing Problems.
Proceedings of the Combinatorial Algorithms - 31st International Workshop, 2020

2019
Triangle-free graphs that do not contain an induced subdivision of K4 are 3-colorable.
J. Graph Theory, 2019

Graph Colouring: from Structure to Algorithms (Dagstuhl Seminar 19271).
Dagstuhl Reports, 2019

Discrete Optimization Methods for Group Model Selection in Compressed Sensing.
CoRR, 2019

Approximately Coloring Graphs Without Long Induced Paths.
Algorithmica, 2019

Stackelberg Packing Games.
Proceedings of the Algorithms and Data Structures - 16th International Symposium, 2019

How to Secure Matchings Against Edge Failures.
Proceedings of the 36th International Symposium on Theoretical Aspects of Computer Science, 2019

2018
Exhaustive generation of <i>k</i>-critical H-free graphs.
J. Graph Theory, 2018

Long cycles through prescribed vertices have the Erdős-Pósa property.
J. Graph Theory, 2018

How to Secure Matchings Against Edge Failures.
CoRR, 2018

Three-Coloring and List Three-Coloring of Graphs Without Induced Paths on Seven Vertices.
Comb., 2018

2017
Almost Partitioning a 3-Edge-Colored K<sub>n, n</sub> into Five Monochromatic Cycles.
SIAM J. Discret. Math., 2017

The union-closed sets conjecture almost holds for almost all random bipartite graphs.
Eur. J. Comb., 2017

On bounding the difference between the maximum degree and the chromatic number by a constant.
Discret. Appl. Math., 2017

Fast Algorithms for Delta-Separated Sparsity Projection.
CoRR, 2017

The Parameterized Complexity of the Equidomination Problem.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2017

Revenue Maximization in Stackelberg Pricing Games: Beyond the Combinatorial Setting.
Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

2016
A unified approach to recognize squares of split graphs.
Theor. Comput. Sci., 2016

Claw-Free t-Perfect Graphs Can Be Recognized in Polynomial Time.
SIAM J. Discret. Math., 2016

A New Characterization of P<sub>k</sub>-Free Graphs.
Algorithmica, 2016

Structural Parameterizations for Boxicity.
Algorithmica, 2016

Exhaustive Generation of k-Critical ℋ-Free Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2016

Obstructions for three-coloring graphs with one forbidden induced subgraph.
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

Minisum and Minimax Committee Election Rules for General Preference Types.
Proceedings of the ECAI 2016 - 22nd European Conference on Artificial Intelligence, 29 August-2 September 2016, The Hague, The Netherlands, 2016

2015
Polynomial time recognition of squares of Ptolemaic graphs and 3-sun-free split graphs.
Theor. Comput. Sci., 2015

On disjoint maximal independent sets in graphs.
Inf. Process. Lett., 2015

On Bounding the Difference of the Maximum Degree and the Clique Number.
Graphs Comb., 2015

The Journey of the Union-Closed Sets Conjecture.
Graphs Comb., 2015

Partitioning two-coloured complete multipartite graphs into monochromatic paths and cycles.
Electron. Notes Discret. Math., 2015

Partitioning 3-edge-coloured complete bipartite graphs into monochromatic cycles.
Electron. Notes Discret. Math., 2015

The graph formulation of the union-closed sets conjecture.
Eur. J. Comb., 2015

Exhaustive generation of $k$-critical $\mathcal H$-free graphs.
CoRR, 2015

b-Coloring is NP-hard on Co-bipartite Graphs and Polytime Solvable on Tree-Cographs.
Algorithmica, 2015

Recognizing k-equistable Graphs in FPT Time.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2015

2014
The Price of Connectivity for Vertex Cover.
Discret. Math. Theor. Comput. Sci., 2014

A characterization of line graphs that are squares of graphs.
Discret. Appl. Math., 2014

The price of connectivity for dominating set: Upper bounds and complexity.
Discret. Appl. Math., 2014

Partitioning two-coloured complete multipartite graphs into monochromatic paths.
CoRR, 2014

Squares of $3$-sun-free split graphs.
CoRR, 2014

A new characterization of $P_k$-free graphs.
CoRR, 2014

3-Colouring graphs without triangles or induced paths on seven vertices.
CoRR, 2014

Claw-Free t-Perfect Graphs Can Be Recognised in Polynomial Time.
Proceedings of the Integer Programming and Combinatorial Optimization, 2014

2013
On the separability of graphs.
Discret. Math., 2013

On dominating sets whose induced subgraphs have a bounded diameter.
Discret. Appl. Math., 2013

Computing square roots of trivially perfect and threshold graphs.
Discret. Appl. Math., 2013

A Note on Connected Dominating Set in Graphs Without Long Paths And Cycles
CoRR, 2013

Connected dominating set in graphs without long paths and cycles.
Proceedings of the 12th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2013

2012
Efficient total domination in digraphs.
J. Discrete Algorithms, 2012

On weighted efficient total domination.
J. Discrete Algorithms, 2012

The complexity of connected dominating sets and total dominating sets with specified induced subgraphs.
Inf. Process. Lett., 2012

Paired- and induced paired-domination in (<i>E, net</i>)-free graphs.
Discuss. Math. Graph Theory, 2012

Total domination versus paired domination.
Discuss. Math. Graph Theory, 2012

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

On graphs for which the connected domination number is at most the total domination number.
Discret. Appl. Math., 2012

Graphs in Which the Difference of the Maximum Clique Number and the Maximum Degree Is Bounded by a Constant.
Proceedings of the 11th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2012

The Price of Connectivity for Vertex Cover: Perfect, Near-Perfect and Critical Graphs.
Proceedings of the 11th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2012

2011
The Structure of Dominating Subgraphs.
PhD thesis, 2011

On the existence of total dominating subgraphs with a prescribed additive hereditary property.
Discret. Math., 2011

Die Struktur dominierender Mengen in Graphen.
Proceedings of the Ausgezeichnete Informatikdissertationen 2011, 2011

2010
Efficient Total Domination.
Proceedings of the 9th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2010


  Loading...