Author of the publication

Computing Complexity Measures of Degenerate Graphs.

, , , and . IPEC, volume 285 of LIPIcs, page 14:1-14:21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)

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.

 

Other publications of authors with the same name

Half-Integral Linkages in Highly Connected Directed Graphs., , and . ESA, volume 87 of LIPIcs, page 36:1-36:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Optimal Discretization is Fixed-parameter Tractable., , , , and . CoRR, (2020)Algorithmic Properties of Sparse Digraphs., , , , and . STACS, volume 126 of LIPIcs, page 46:1-46:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Packing Directed Circuits Quarter-Integrally., , , , and . ESA, volume 144 of LIPIcs, page 72:1-72:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Kernelization and hardness of harmless sets in sparse classes., , and . CoRR, (2021)Degree-Doubling Graph Families., and . SIAM J. Discret. Math., 27 (3): 1575-1583 (2013)Computing Complexity Measures of Degenerate Graphs., , , and . IPEC, volume 285 of LIPIcs, page 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., and . J. Comb. Theory, Ser. B, 158 (Part): 210-251 (2023)Optimal Discretization is Fixed-parameter Tractable., , , , and . SODA, page 1702-1719. SIAM, (2021)Harmless Sets in Sparse Classes., , and . IWOCA, volume 13270 of Lecture Notes in Computer Science, page 299-312. Springer, (2022)