Parameterized complexity of independence and domination on geometric graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4169 LNCS, Issue , 2006, Pages 154-165

  Marx, Dániel ^a  

^a HUMBOLDT UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL GEOMETRY; PARAMETER ESTIMATION;

GEOMETRIC GRAPHS; LINE SEGMENTS;

GRAPH THEORY;

EID: 33750239078     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11847250_14     Document Type: Conference Paper

References (5)

1. P. K. Agarwal, M. van Kreveld, and S. Suri. Label placement by maximum independent set in rectangles. Comput. Geom., 11(3-4):209-218, 1998.
2. J. Kára and J. Kratochvíl. Fixed parameter tractability of Independent Set in segment intersection graphs. Accepted to IWPEC 2006.
3. E. Malesińska. Graph-Theoretical Models for Frequency Assignment Problems. PhD thesis, Technical University of Berlin, 1997.
4. D. Marx. Efficient approximation schemes for geometric problems? In Proceedings of ESA 2005, pages 448-459, 2005.
5. D. W. Wang and Y.-S. Kuo. A study on two geometric location problems. Inform. Process. Lett., 28(6):281-286, 1988.