( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Approximately Coloring Graphs Without Long Induced Paths.

, , , , и . WG, том 10520 из Lecture Notes in Computer Science, стр. 193-205. Springer, (2017)

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.

Oliver Schaudt

Oliver Schaudt

Ursula Schaudt

Marco Schaudt

Heidrun Schaudt

 

Другие публикации лиц с тем же именем

b-Coloring is NP-hard on Co-bipartite Graphs and Polytime Solvable on Tree-Cographs., , , и . Algorithmica, 73 (2): 289-305 (2015)On the Complexity of Stackelberg Matroid Pricing Problems., и . IWOCA, том 12126 из Lecture Notes in Computer Science, стр. 83-96. Springer, (2020)On Bounding the Difference of the Maximum Degree and the Clique Number., и . Graphs Comb., 31 (5): 1689-1702 (2015)b-Coloring is NP-Hard on Co-Bipartite Graphs and Polytime Solvable on Tree-Cographs., , , и . ISCO, том 8596 из Lecture Notes in Computer Science, стр. 100-111. Springer, (2014)On graphs for which the connected domination number is at most the total domination number.. Discret. Appl. Math., 160 (7-8): 1281-1284 (2012)Connected dominating set in graphs without long paths and cycles., и . CTW, том WP 13-01 из CTIT Workshop Proceedings, стр. 39-42. (2013)Stackelberg packing games., , и . Theor. Comput. Sci., (2023)Obstructions for three-coloring graphs with one forbidden induced subgraph., , , и . SODA, стр. 1774-1783. SIAM, (2016)Stackelberg Packing Games., , и . WADS, том 11646 из Lecture Notes in Computer Science, стр. 239-253. Springer, (2019)A Note on Connected Dominating Set in Graphs Without Long Paths And Cycles, и . CoRR, (2013)