Unit Disk Graph Recognition is NP-Hard (1993)

Cached

Download Links

by Heinz Breu , David G. Kirkpatrick
Venue:Computational Geometry. Theory and Applications
Citations:78 - 1 self

Active Bibliography

Interval Graphs with Side Constraints – Itsik Pe'er - 1995
8 Algorithmic Aspects of the Consecutive-Ones Property – Michael Dom - 2009
36 On Coloring Unit Disk Graphs – Albert Gräf, Martin Stumpf, Gerhard Weißenfels - 1994
3 The on-line first-fit algorithm for radio frequency assignment problems – Yin-Te Tsai , Yaw-Ling Lin , F.R. Hsu - 2002
5 Satisfiability Problems on Intervals and Unit Intervals – Itsik Pe'er, Ron Shamir - 1997
A simple dynamic graph algorithm for recognizing proper interval graphs – Louis Ibarra - 2008
13 Finding Minimum Height Elimination Trees For Interval Graphs In Polynomial Time – Bengt Aspvall, Pinar Heggernes - 1994
4 Consecutive Retrieval Property - Revisited – Jitender S. Deogun, K. Gopalakrishnan - 1999
Constraint Satisfaction Problems: Convexity Makes AllDifferent Constraints Tractable ✩ – Michael Fellows A, Tobias Friedrich B, Danny Hermelin C, Nina Narodytska D, Frances Rosamond A
3 Constraint Satisfaction Problems: Convexity Makes AllDifferent Constraints Tractable – Michael Fellows, Tobias Friedrich, Danny Hermelin, Nina Narodytska, Frances Rosamond - 2011
30 Frequency Assignment Problems – Robert A. Murphey, Panos M. Pardalos, Mauricio G.C. Resende - 1999
5 Graph domination, coloring and cliques in telecommunications – Balabhaskar Balasundaram, Sergiy Butenko - 2006
93 NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs – Harry B. Hunt, III, Madhav V. Marathe, VENKATESH RADHAKRISHNAN, S. S. Ravi, Daniel J. Rosenkrantz, Richard E. Stearns - 1997
126 Simple heuristics for unit disk graphs – M. V. Marathe, H. Breu, H. B. Hunt III, S. S. Ravi, D. J. Rosenkrantz - 1995
SYNONYMS: Hitting Set PROBLEM DEFINITION – Mecke Wagner
3 On computing the distinguishing and distinguishing chromatic . . . – Christine T. Cheng - 2009
10 Approximation and Fixed-Parameter Algorithms for Consecutive Ones Submatrix Problems – Michael Dom, Jiong Guo, Rolf Niedermeier
11 Max-tolerance graphs as intersection graphs: cliques, cycles, and recognition – Michael Kaufmann, Jan Kratochvíl, Katharina A. Lehmann, Amarendran R. Subramanian - 2006
1 Approximation Algorithms for the Consecutive Ones Submatrix Problem on Sparse Matrices – Jinsong Tan, Louxin Zhang