Oliver Schaudt
Orcid: 0000-0002-6817-0976Affiliations:
- University of Cologne, Germany
According to our database1,
Oliver Schaudt
authored at least 69 papers
between 2010 and 2023.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2023
2022
Vertex Partitioning in Graphs: From Structure to Algorithms (Dagstuhl Seminar 22481).
Dagstuhl Reports, November, 2022
Proceedings of the 18th Scandinavian Symposium and Workshops on Algorithm Theory, 2022
2021
Theor. Comput. Sci., 2021
SIAM J. Discret. Math., 2021
Math. Program., 2021
Math. Program., 2021
2020
SIAM J. Discret. Math., 2020
J. Comb. Theory, Ser. B, 2020
Preface: 15th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW 2017).
Discret. Appl. Math., 2020
Proceedings of the Combinatorial Algorithms - 31st International Workshop, 2020
2019
Partitioning two?coloured complete multipartite graphs into monochromatic paths and cycles.
J. Graph Theory, 2019
Triangle-free graphs that do not contain an induced subdivision of K4 are 3-colorable.
J. Graph Theory, 2019
Dagstuhl Reports, 2019
2018
J. Graph Theory, 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
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2017
2016
SIAM J. Discret. Math., 2016
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2016
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016
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
Graphs Comb., 2015
Electron. Notes Discret. Math., 2015
Algorithmica, 2015
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2015
2014
Discret. Appl. Math., 2014
Discret. Appl. Math., 2014
CoRR, 2014
Proceedings of the Integer Programming and Combinatorial Optimization, 2014
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 Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2013
2012
The complexity of connected dominating sets and total dominating sets with specified induced subgraphs.
Inf. Process. Lett., 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 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
On the existence of total dominating subgraphs with a prescribed additive hereditary property.
Discret. Math., 2011
Proceedings of the Ausgezeichnete Informatikdissertationen 2011, 2011
2010
Efficient Total Domination.
Proceedings of the 9th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2010