Can they cross? and how?: (the hitchhiker's guide to the universe of geometric intersection graphs)

Authors:
Jan Kratochvil
Affiliations:
Charles University, Praha, Czech Rep
Venue:
Proceedings of the twenty-seventh annual symposium on Computational geometry
Year:
2011

Citing 8
Cited 0

String graphs. II.: Recognizing string graphs is NP-hard

Journal of Combinatorial Theory Series B
String graphs requiring exponential representations

Journal of Combinatorial Theory Series B
Decidability of string graphs

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Recognizing string graphs in NP

STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Recognizing String Graphs Is Decidable

GD '01 Revised Papers from the 9th International Symposium on Graph Drawing
Planar graphs are in 1-STRING

SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Every planar graph is the intersection graph of segments in the plane: extended abstract

Proceedings of the forty-first annual ACM symposium on Theory of computing
Why are string graphs so beautiful?

GD'09 Proceedings of the 17th international conference on Graph Drawing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Geometric representations of graphs are intensively studied for their practical motivations and applications, as well as interesting structural and theoretical properties. We will survey recent results, persistent open problems, and prospective directions of further research in this exciting area lying on the border of graph theory and computational geometry.