Independent set of intersection graphs of convex objects in 2D
- 31 May 2006
- journal article
- Published by Elsevier BV in Computational Geometry
- Vol. 34 (2), 83-95
- https://doi.org/10.1016/j.comgeo.2005.12.001
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- A note on maximum independent sets in rectangle intersection graphsInformation Processing Letters, 2004
- Polynomial-time approximation schemes for packing and piercing fat objectsJournal of Algorithms, 2003
- Efficient Approximation Algorithms for Tiling and Packing Problems with RectanglesJournal of Algorithms, 2001
- Label placement by maximum independent set in rectanglesComputational Geometry, 1998
- On approximation properties of the Independent set problem for degree 3 graphsLecture Notes in Computer Science, 1995
- Approximation algorithms for NP-complete problems on planar graphsJournal of the ACM, 1994
- Approximating maximum independent sets by excluding subgraphsLecture Notes in Computer Science, 1990
- Decomposable searching problems I. Static-to-dynamic transformationJournal of Algorithms, 1980
- On computing the length of longest increasing subsequencesDiscrete Mathematics, 1975
- A Decomposition Theorem for Partially Ordered SetsAnnals of Mathematics, 1950