ETH Tight Algorithms for Geometric Intersection Graphs: Now in Polynomial Space - researchr publication related

researchr

You are not signed in
Sign in
Sign up

Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar 0002, Saket Saurabh 0001. ETH Tight Algorithms for Geometric Intersection Graphs: Now in Polynomial Space. In Mikolaj Bojanczyk, Chandra Chekuri, editors, 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2021, December 15-17, 2021, Virtual Conference. Volume 213 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021. [doi]

The following publications are possibly variants of this publication:

ETH-Tight Algorithms for Long Path and Cycle on Unit Disk GraphsFedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh 0001, Meirav Zehavi. compgeom 2020: [doi]

ETH-Tight Algorithms for Long Path and Cycle on Unit Disk GraphsMeirav Zehavi, Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh 0001. jocg, 12(2):126-148, 2021. [doi]

runs on WebDSL