Oliver Schaudt
According to our database^{1},
Oliver Schaudt
authored at least 65 papers
between 2010 and 2020.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
Online presence:

on orcid.org
On csauthors.net:
Bibliography
2020
SIAM J. Discret. Math., 2020
Math. Program., 2020
J. Comb. Theory, Ser. B, 2020
Preface: 15th CologneTwente Workshop on Graphs and Combinatorial Optimization (CTW 2017).
Discret. Appl. Math., 2020
CoRR, 2020
Proceedings of the Combinatorial Algorithms  31st International Workshop, 2020
2019
Trianglefree graphs that do not contain an induced subdivision of K4 are 3colorable.
J. Graph Theory, 2019
Dagstuhl Reports, 2019
CoRR, 2019
Algorithmica, 2019
Proceedings of the Algorithms and Data Structures  16th International Symposium, 2019
Proceedings of the 36th International Symposium on Theoretical Aspects of Computer Science, 2019
2018
J. Graph Theory, 2018
J. Graph Theory, 2018
CoRR, 2018
ThreeColoring and List ThreeColoring of Graphs Without Induced Paths on Seven Vertices.
Comb., 2018
2017
Almost Partitioning a 3EdgeColored K<sub>n, n</sub> into Five Monochromatic Cycles.
SIAM J. Discret. Math., 2017
The unionclosed 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
CoRR, 2017
Proceedings of the GraphTheoretic 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
Theor. Comput. Sci., 2016
SIAM J. Discret. Math., 2016
Algorithmica, 2016
Algorithmica, 2016
Proceedings of the GraphTheoretic Concepts in Computer Science, 2016
Proceedings of the TwentySeventh Annual ACMSIAM Symposium on Discrete Algorithms, 2016
Proceedings of the ECAI 2016  22nd European Conference on Artificial Intelligence, 29 August2 September 2016, The Hague, The Netherlands, 2016
2015
Polynomial time recognition of squares of Ptolemaic graphs and 3sunfree split graphs.
Theor. Comput. Sci., 2015
Inf. Process. Lett., 2015
Graphs Comb., 2015
Graphs Comb., 2015
Partitioning twocoloured complete multipartite graphs into monochromatic paths and cycles.
Electron. Notes Discret. Math., 2015
Electron. Notes Discret. Math., 2015
Eur. J. Comb., 2015
CoRR, 2015
bColoring is NPhard on Cobipartite Graphs and Polytime Solvable on TreeCographs.
Algorithmica, 2015
Proceedings of the GraphTheoretic Concepts in Computer Science, 2015
2014
Discret. Math. Theor. Comput. Sci., 2014
Discret. Appl. Math., 2014
Discret. Appl. Math., 2014
CoRR, 2014
CoRR, 2014
CoRR, 2014
CoRR, 2014
Proceedings of the Integer Programming and Combinatorial Optimization, 2014
2013
Discret. Math., 2013
Discret. Appl. Math., 2013
Discret. Appl. Math., 2013
CoRR, 2013
Connected dominating set in graphs without long paths and cycles.
Proceedings of the 12th CologneTwente Workshop on Graphs and Combinatorial Optimization, 2013
2012
J. Discrete Algorithms, 2012
J. Discrete Algorithms, 2012
The complexity of connected dominating sets and total dominating sets with specified induced subgraphs.
Inf. Process. Lett., 2012
Discuss. Math. Graph Theory, 2012
Discuss. Math. Graph Theory, 2012
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 CologneTwente Workshop on Graphs and Combinatorial Optimization, 2012
The Price of Connectivity for Vertex Cover: Perfect, NearPerfect and Critical Graphs.
Proceedings of the 11th CologneTwente Workshop on Graphs and Combinatorial Optimization, 2012
2011
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 CologneTwente Workshop on Graphs and Combinatorial Optimization, 2010