OpenAlex
A framework for ETH-tight algorithms and lower bounds in geometric intersection graphs
Work
Year: 2018
Type: article
Abstract: We give an algorithmic and lower-bound framework that facilitates the construction of subexponential algorithms and matching conditional complexity bounds. It can be applied to a wide range of geometr... more
Authors Mark de Berg, Hans L. Bodlaender, Sándor Kisfaludi-Bak, Dániel Marx, Tom C. van der Zanden
Institutions Eindhoven University of Technology, Utrecht University, Hungarian Academy of Sciences
Cites: 19
Cited by: 20
Related to: 10
FWCI: 2.863
Citation percentile (by year/subfield): 95.14
Topic: Advanced Graph Theory Research
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
Funders Nederlandse Organisatie voor Wetenschappelijk Onderzoek, H2020 European Research Council
Grant IDS 024.002.003, 725978