Author of the publication

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

Fully dynamic approximation schemes on planar and apex-minor-free graphs., , , and . CoRR, (2023)Detecting Points in Integer Cones of Polytopes is Double-Exponentially Hard., , , , and . SOSA, page 279-285. SIAM, (2024)Max Weight Independent Set in Graphs with No Long Claws: An Analog of the Gyárfás' Path Argument., , , , , , and . ICALP, volume 229 of LIPIcs, page 93:1-93:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Almost-Linear Time Parameterized Algorithm for Rankwidth via Dynamic Rankwidth., and . STOC, page 1538-1549. ACM, (2024)Determining 4-Edge-Connected Components in Linear Time., , , and . ESA, volume 204 of LIPIcs, page 71:1-71:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Flipper Games for Monadically Stable Graph Classes., , , , , , , , and . ICALP, volume 261 of LIPIcs, page 128:1-128:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Exact Shortest Paths with Rational Weights on the Word RAM., , and . SODA, page 2597-2608. SIAM, (2024)Dynamic treewidth., , , , and . FOCS, page 1734-1744. IEEE, (2023)Fully dynamic approximation schemes on planar and apex-minor-free graphs., , , and . SODA, page 296-313. SIAM, (2024)Sparse Graphs of Twin-Width 2 Have Bounded Tree-Width., , , , , and . ISAAC, volume 283 of LIPIcs, page 11:1-11:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)