( en | de | ru )

 

Disambiguation of "Schaudt, Oliver"

Author of the publication

copydeleteadd this publication to your clipboard
Better 3-coloring algorithms: Excluding a triangle and a seven vertex path.

, , , , , , and . Theor. Comput. Sci., (2021)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Oliver Schaudt

Oliver Schaudt

Ursula Schaudt

Marco Schaudt

Heidrun Schaudt

 

Other publications of authors with the same name

On disjoint maximal independent sets in graphs.. Inf. Process. Lett., 115 (1): 23-27 (2015)The union-closed sets conjecture almost holds for almost all random bipartite graphs., and . Eur. J. Comb., (2017)Approximately Coloring Graphs Without Long Induced Paths., , , , and . Algorithmica, 81 (8): 3186-3199 (2019)On bounding the difference between the maximum degree and the chromatic number by a constant., and . CoRR, (2015)A New Characterization of Pk-free Graphs., and . WG, volume 8747 of Lecture Notes in Computer Science, page 129-138. Springer, (2014)Fault-Tolerant Edge-Disjoint s-t Paths - Beyond Uniform Faults., , , and . SWAT, volume 227 of LIPIcs, page 5:1-5:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Obstructions for three-coloring graphs with one forbidden induced subgraph., , , and . SODA, page 1774-1783. SIAM, (2016)On the Complexity of Stackelberg Matroid Pricing Problems., and . IWOCA, volume 12126 of Lecture Notes in Computer Science, page 83-96. Springer, (2020)b-Coloring is NP-Hard on Co-Bipartite Graphs and Polytime Solvable on Tree-Cographs., , , and . ISCO, volume 8596 of Lecture Notes in Computer Science, page 100-111. Springer, (2014)Connected dominating set in graphs without long paths and cycles., and . CTW, volume WP 13-01 of CTIT Workshop Proceedings, page 39-42. (2013)