Beyond Homothetic Polygons: Recognition and Maximum Clique

No abstract is available for this paper.

• Publication year

  2012

• Venue

  International Symposium on Algorithms and Computation

• Publication date

  2012-12-19

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1007/978-3-642-35261-4_64
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Algorithms – ESA 2012

  2012cited by this paper
• The Clique Problem in Ray Intersection Graphs

  2011cited by this paper
• Integer representations of convex polygon intersection graphs

  2011cited by this paper
• Convex Polygon Intersection Graphs

  2010cited by this paper
• The LBFS Structure and Recognition of Interval Graphs

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

  2008cited by this paper
• Intersection graphs of homothetic polygons

  2008cited by this paper
• Homothetic Triangle Contact Representations of Planar Graphs

  2007cited by this paper
• Max-tolerance graphs as intersection graphs: cliques, cycles, and recognition

  2006cited by this paper
• On the Chromatic Number of Intersection Graphs of Convex Sets in the Plane

  2004cited by this paper
• Efficient graph representations

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

  2001cited by this paper
• On intersection representations of co-planar graphs

  1998cited by this paper
• Intersection Graphs of Noncrossing Arc-Connected Sets in the Plane

  1996cited by this paper
• A Special Planar Satisfiability Problem and a Consequence of Its NP-completeness

  1994cited by this paper
• Intersection Graphs of Segments

  1994cited by this paper
• On Generating All Maximal Independent Sets

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

  1980cited by this paper
• CHAPTER 3 – Perfect Graphs

  1980cited by this paper
• A Characterization of Comparability Graphs and of Interval Graphs

  1964cited by this paper

• Homothetic polygons and beyond: Maximal cliques in intersection graphs

  2018cites this paper
• Knapsack Intersection Graphs and Efficient Computation of Their Maximal Cliques

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

  2014cites this paper
• On Intersection Graphs of Convex Polygons

  2014cites this paper
• Computational Modeling of Objects Presented in Images. Fundamentals, Methods, and Applications

  2014cites this paper