From post

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.

 

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

Subquadratic Kernels for Implicit 3-Hitting Set and 3-Set Packing Problems., , , , и . SODA, стр. 331-342. SIAM, (2018)Twin-width III: Max Independent Set, Min Dominating Set, and Coloring., , , , и . ICALP, том 198 из LIPIcs, стр. 35:1-35:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)A Brief Tour in Twin-Width (Invited Talk).. ICALP, том 229 из LIPIcs, стр. 6:1-6:5. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Three Min-Max Theorems Concerning Cyclic Orders of Strong Digraphs., и . IPCO, том 3064 из Lecture Notes in Computer Science, стр. 132-138. Springer, (2004)A Linear Vertex Kernel for Maximum Internal Spanning Tree., , , и . ISAAC, том 5878 из Lecture Notes in Computer Science, стр. 275-282. Springer, (2009)Parameterized Complexity of Independent Set in H-Free Graphs., , , , и . Algorithmica, 82 (8): 2360-2394 (2020)Generalized Pigeonhole Properties of Graphs and Oriented Graphs*1., , , и . Eur. J. Comb., 23 (3): 257-274 (2002)The categorical product of two 5-chromatic digraphs can be 3-chromatic., и . Discret. Math., 305 (1-3): 344-346 (2005)VC-dimension and Erdős-Pósa property., и . Discret. Math., 338 (12): 2302-2317 (2015)The Independent Set Problem Is FPT for Even-Hole-Free Graphs., , и . IPEC, том 148 из LIPIcs, стр. 21:1-21:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)