Prof. Dr. Oliver Schaudt

Postanschrift

RWTH Aachen University

Lehrstuhl für Mathematik der Informationsverarbeitung

z.H. Prof. Dr. Oliver Schaudt

Pontdriesch 10

52062 Aachen

E-Mail: schaudt@mathc.rwth-aachen.de

Preprints:

with F. Wolfertstetter, F. Terhag, S. Wilbert and T. Hirsch, Optimization of Cleaning Strategies Based on ANN Algorithms Assessing the Benefit of Soiling Rate Forecasts, preprint (2018)
with H. Bruhn and F. Joos, Erdös-Posa property for labelled minors: 2-connected minors, preprint (2018)
with V. Bindewald, F. Hommelsheim and M. Mühlenthaler, How to secure matchings against edge failures, preprint (2018)
with T. Böhnlein and J. Schauer, Make or Buy: Revenue maximization in Stackelberg Scheduling Games, preprint (2018)
with H. Bruhn, Fast Algorithms for Delta-Separated Sparsity Projection, preprint (2017)
with M. Chudnovsky, C.H. Liu, S. Spirkl, N. Trotignon and K. Vuskovic, Triangle-free graphs that do not contain an induced subdivision of K₄ are 3-colorable, preprint (2017)
with M. Chudnovsky, J. Goedgebeur and M. Zhong, Obstructions for three-coloring and list three-coloring graphs with one forbidden induced subgraph, preprint (2017)

Aktuelle Artikel in Konferenzbänden:

Aktuelle Artikel in Zeitschriften:

with M. Stein, Partitioning two-coloured complete multipartite graphs into monochromatic paths and cycles, to appear in J. Graph Theory
with J. Goedgebeur, Exhaustive generation of k-critical H-free graphs, J. Graph Theory 87 (2018), 188-207
with H. Bruhn and F. Joos, Long cycles through prescribed vertices have the Erdös-Posa property, J. Graph Theory 87 (2018), 275-284
with F. Bonomo, M. Chudnovsky, P. Maceli, M. Stein and M. Zhong, Three-coloring and list three-coloring graphs without induced paths on seven vertices, to appear in Combinatorica
with R. Lang and M. Stein, Partitioning edge-coloured bipartite graphs into monochromatic cycles, SIAM J. Discrete Math. 31 (2017), 1374-1402
with V.B. Le and A. Oversberg, A unified approach for recognizing squares of split graphs, Theor. Comput. Sci. 648 (2017), 26-33
with H. Bruhn, The union-closed sets conjecture almost holds for almost all random bipartite graphs, Eur. J. Comb. 59 (2017), 129-149
with H. Bruhn, Claw-free t-perfect graphs can be recognised in polynomial time, SIAM J. Discrete Math. 30 (2016), 832-855