Clique-Based Separators for Geometric Intersection Graphs

de Berg, Mark; Kisfaludi-Bak, Sándor; Monemizadeh, Morteza; Theocharous, Leonidas

doi:10.4230/LIPIcs.ISAAC.2021.22

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Conference Paper

Clique-Based Separators for 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)

LIPIcs-ISAAC-2021-22.pdf
(Publisher version), 914KB

Supplementary Material (public)

There is no public supplementary material available

Citation

de Berg, M., Kisfaludi-Bak, S., Monemizadeh, M., & Theocharous, L. (2021). Clique-Based Separators for Geometric Intersection Graphs. In H.-K. Ahn, & K. Sadakane (Eds.), 32nd International Symposium on Algorithms and Computation (pp. 1-15). Wadern: Schloss Dagstuhl. doi:10.4230/LIPIcs.ISAAC.2021.22.

Cite as: https://hdl.handle.net/21.11116/0000-0009-B811-4

Abstract

There is no abstract available