Bidimensionality of geometric intersection graphs

Alexander Grigoriev, Athanassios Koutsonas, Dimitrios M. Thilikos

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Let be a finite collection of geometric (not necessarily convex) bodies in the plane. Clearly, this class of geometric objects naturally generalizes the class of disks, lines, ellipsoids, and even convex polygons. We consider geometric intersection graphs where each body of the collection is represented by a vertex, and two vertices of are adjacent if the intersection of the corresponding bodies is non-empty. For such graph classes and under natural restrictions on their maximum degree or subgraph exclusion, we prove that the relation between their treewidth and the maximum size of a grid minor is linear. These combinatorial results vastly extend the applicability of all the meta-algorithmic results of the bidimensionality theory to geometrically defined graph classes.

Original languageEnglish (US)
Title of host publicationSOFSEM 2014
Subtitle of host publicationTheory and Practice of Computer Science - 40th International Conference on Current Trends in Theory and Practice of Computer Science, Proceedings
PublisherSpringer Verlag
Pages293-305
Number of pages13
ISBN (Print)9783319042978
DOIs
StatePublished - 2014
Event40th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2014 - Novy Smokovec, Slovakia
Duration: Jan 26 2014Jan 29 2014

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume8327 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference40th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2014
Country/TerritorySlovakia
CityNovy Smokovec
Period1/26/141/29/14

Keywords

  • bidimensionality
  • geometric intersection graphs
  • grid exlusion theorem

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science

Fingerprint

Dive into the research topics of 'Bidimensionality of geometric intersection graphs'. Together they form a unique fingerprint.

Cite this