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.

 

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

Half-Integral Linkages in Highly Connected Directed Graphs., , и . ESA, том 87 из LIPIcs, стр. 36:1-36:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Optimal Discretization is Fixed-parameter Tractable., , , , и . CoRR, (2020)Algorithmic Properties of Sparse Digraphs., , , , и . STACS, том 126 из LIPIcs, стр. 46:1-46:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Packing Directed Circuits Quarter-Integrally., , , , и . ESA, том 144 из LIPIcs, стр. 72:1-72:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Degree-Doubling Graph Families., и . SIAM J. Discret. Math., 27 (3): 1575-1583 (2013)Kernelization and hardness of harmless sets in sparse classes., , и . CoRR, (2021)Computing Complexity Measures of Degenerate Graphs., , , и . IPEC, том 285 из LIPIcs, стр. 14:1-14:21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Well-quasi-ordering digraphs with no long alternating paths by the strong immersion relation., и . J. Comb. Theory, Ser. B, 158 (Part): 210-251 (2023)Optimal Discretization is Fixed-parameter Tractable., , , , и . SODA, стр. 1702-1719. SIAM, (2021)Harmless Sets in Sparse Classes., , и . IWOCA, том 13270 из Lecture Notes in Computer Science, стр. 299-312. Springer, (2022)