Author of the publication

Maximum Matchings in Geometric Intersection Graphs.

, , and . STACS, volume 154 of LIPIcs, page 31:1-31:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)

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

Optimality Program in Segment and String Graphs., and . Algorithmica, 81 (7): 3047-3073 (2019)Fine-Grained Complexity of k-OPT in Bounded-Degree Graphs for Solving TSP., , , and . ESA, volume 144 of LIPIcs, page 23:1-23:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Maximum Matchings in Geometric Intersection Graphs., , and . STACS, volume 154 of LIPIcs, page 31:1-31:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Neighbourhood complexity of graphs of bounded twin-width., , , and . Eur. J. Comb., (January 2024)The Inverse Voronoi Problem in Graphs I: Hardness., , , and . Algorithmica, 82 (10): 3018-3040 (2020)Twin-width V: linear minors, modular counting, and matrix multiplication., , , and . CoRR, (2022)Treewidth is Polynomial in Maximum Degree on Graphs Excluding a Planar Induced Minor., , , and . CoRR, (2023)Small But Unwieldy., , , , and . CoRR, (2023)Twin-width III: Max Independent Set and Coloring., , , , and . CoRR, (2020)Sparse graphs with bounded induced cycle packing number have logarithmic treewidth., , , , , , , and . CoRR, (2022)