( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Flexible List Colorings in Graphs with Special Degeneracy Conditions

, , и . (2020)cite arxiv:2006.15837Comment: 17 pages.

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.

Georg Tomaschewski

Rudolf Tomaschek

Jürgen Tomas

Renate Tomaschewski

Roman Tomaschitz

 

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

Flexible List Colorings in Graphs with Special Degeneracy Conditions, , и . (2020)cite arxiv:2006.15837Comment: 17 pages.Flexibility of triangle-free planar graphs., , , и . J. Graph Theory, 96 (4): 619-641 (2021)Max Weight Independent Set in Graphs with No Long Claws: An Analog of the Gyárfás' Path Argument., , , , , , и . ICALP, том 229 из LIPIcs, стр. 93:1-93:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)U-Bubble Model for Mixed Unit Interval Graphs and Its Applications: The MaxCut Problem Revisited., , и . MFCS, том 170 из LIPIcs, стр. 57:1-57:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)On 3-Coloring of (2P4, C5)-Free Graphs., , , , и . WG, том 12911 из Lecture Notes in Computer Science, стр. 388-401. Springer, (2021)Constant Congestion Brambles in Directed Graphs., , , и . SIAM J. Discret. Math., 36 (2): 922-938 (2022)Maximum Weight Independent Set in Graphs with no Long Claws in Quasi-Polynomial Time., , , , , и . CoRR, (2023)Diversity in Combinatorial Optimization., , , , , , и . CoRR, (2019)Optimal Discretization is Fixed-parameter Tractable., , , , и . CoRR, (2020)Simplified Algorithmic Metatheorems Beyond MSO: Treewidth and Neighborhood Diversity., , , и . Log. Methods Comput. Sci., (2019)