A Framework for Exponential-Time-Hypothesis-Tight Algorithms and Lower Bounds 
in Geometric Intersection Graphs

de Berg, Mark; Bodlaender, Hans L.; Kisfaludi-Bak, Sándor; Marx, Dániel; van der Zanden, Tom C.

doi:10.1137/20M1320870

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Journal Article

A Framework for Exponential-Time-Hypothesis-Tight Algorithms and Lower Bounds in Geometric Intersection Graphs

MPS-Authors

/persons/resource/persons252857

Kisfaludi-Bak, Sándor
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

No external resources are shared

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

20m1320870.pdf
(Publisher version), 2MB

Supplementary Material (public)

There is no public supplementary material available

Citation

de Berg, M., Bodlaender, H. L., Kisfaludi-Bak, S., Marx, D., & van der Zanden, T. C. (2020). A Framework for Exponential-Time-Hypothesis-Tight Algorithms and Lower Bounds in Geometric Intersection Graphs. SIAM Journal on Computing, 49(6), 1291-1331. doi:10.1137/20M1320870.

Cite as: https://hdl.handle.net/21.11116/0000-0007-A582-B

Abstract

There is no abstract available