Integer representations of convex polygon intersection graphs

No abstract is available for this paper.

• Publication year

  2011

• Venue

  International Symposium on Computational Geometry

• Publication date

  2011-06-13

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1145/1998196.1998248
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• The recognition of triangle graphs

  2012cited by this paper
• I and J

  2012cited by this paper
• Sphere and Dot Product Representations of Graphs

  2011cited by this paper
• Vertex splitting and the recognition of trapezoid graphs

  2011cited by this paper
• Convex Polygon Intersection Graphs

  2010cited by this paper
• Computational Complexity: A Modern Approach

  2009cited by this paper
• Complexity of Some Geometric and Topological Problems

  2009cited by this paper
• UvA-DARE ( Digital Academic Repository ) Optimization and approximation on systems of geometric objects

  2009influential reference
• State of the Union (of geometric objects)

  2008cited by this paper
• Intersection graphs of homothetic polygons

  2008cited by this paper
• Special Graph Classes and Algorithms on Them

  2008influential reference
• Max-tolerance graphs as intersection graphs: cliques, cycles, and recognition

  2006cited by this paper
• I Computational Complexity

  2005cited by this paper
• Planar Graph Drawing

  2004cited by this paper
• Efficient graph representations

  2003cited by this paper
• LECTURES ON DISCRETE GEOMETRY (Graduate Texts in Mathematics 212)

  2003cited by this paper
• Lectures on discrete geometry

  2002cited by this paper
• On Intersection Graphs of Segments with Prescribed Slopes

  2001cited by this paper
• Representing graphs by disks and balls (a survey of recognition-complexity results)

  2001cited by this paper
• Unit disk graph recognition is NP-hard

  1998cited by this paper
• Discrete Realizations of Contact and Intersection Graphs

  1997cited by this paper
• Algorithmic aspects of constrained unit disk graphs

  1996cited by this paper
• Simple Linear Time Recognition of Unit Interval Graphs

  1995cited by this paper
• Intersection Graphs of Segments

  1994cited by this paper
• Unit disk graphs

  1991cited by this paper
• String graphs. II. recognizing string graphs is NP-hard

  1991cited by this paper
• String graphs requiring exponential representations

  1991cited by this paper
• How to draw a planar graph on a grid

  1990cited by this paper
• Embedding planar graphs on the grid

  1990influential reference
• Some provably hard crossing number problems

  1990influential reference
• THEORY OF LINEAR AND INTEGER PROGRAMMING (Wiley-Interscience Series in Discrete Mathematics and Optimization)

  1989cited by this paper
• Topics in Intersection Graph Theory

  1987cited by this paper
• Theory of linear and integer programming

  1986cited by this paper
• Tolerance graphs

  1984cited by this paper
• Algorithmic graph theory and perfect graphs

  1980cited by this paper
• Algorithmic graph theory and perfect graphs

  1980cited by this paper
• Intersection graphs of curves in the plane

  1976cited by this paper

• Recognition of Unit Segment and Polyline Graphs is ∃R-Complete

  2024cites this paper
• A Finite Algorithm for the Realizabilty of a Delaunay Triangulation

  2022cites this paper
• Classifying Convex Bodies by their Contact and Intersection Graphs

  2019cites this paper
• Homothetic triangle representations of planar graphs

  2019cites this paper
• Homothetic polygons and beyond: Maximal cliques in intersection graphs

  2018cites this paper
• Approximation and Parameterized Algorithms for Geometric Independent Set with Shrinking

  2016cites this paper
• On Intersection Graphs of Convex Polygons

  2014cites this paper
• Homothetic Polygons and Beyond: Intersection Graphs, Recognition, and Maximum Clique

  2014influential citation
• Beyond Homothetic Polygons: Recognition and Maximum Clique

  2012cites this paper
• Integer realizations of disk and segment graphs

  2011cites this paper
• Convex Polygon Intersection Graphs

  2010cites this paper