Fetching the paper…
Reading the bibliography…
A disk graph is the intersection graph of disks in the plane, a unit disk graph is the intersection graph of same radius disks in the plane, and a segment graph is an intersection graph of line segments in the plane.
Kontaktprobleme der konformen abbildung
P. Koebe · 1936
Earlier work this paper cites.
Bemerkungen zum Vierfarbenproblem
K. Wagner · 1936
Earlier work this paper cites.
On straight line representation of planar graphs
I. Fáry · 1948
Earlier work this paper cites.
Convex maps
S. K. Stein · 1951
Earlier work this paper cites.
Theory of linear and integer programming
A. Schrijver · 1986
Earlier work this paper cites.
Solving systems of polynomial inequalities in subexponential time
D. Y. Grigor’ev and N. N. Vorobjov · 1988
Earlier work this paper cites.
Intersection graphs of segments
J. Kratochvíl and J. Matoušek · 1988
Earlier work this paper cites.
Coordinate representation of order types requires exponential storage
J. E. Goodman, R. Pollack, and B. Sturmfels · 1989
Earlier work this paper cites.
Uniform oriented matroids without the isotopy property
B. Jaggi, P. Mani-Levitska, B. Sturmfels, and N. White · 1989
Cited alongside, same era.
The intrinsic spread of a configuration in 𝐑 d {\bf R}^{d}
J. E. Goodman, R. Pollack, and B. Sturmfels · 1990
Cited alongside, same era.
Stretchability of pseudolines is NP-hard
P. W. Shor · 1991
Cited alongside, same era.
Intersection graphs of segments
J. Kratochvíl and J. Matoušek · 1994
Cited alongside, same era.
Algorithmic aspects of constrained unit disk graphs
H. Breu · 1996
Cited alongside, same era.
Graph-Theoretical Models for Frequency Assignment Problems
E. Malesińska · 1997
Cited alongside, same era.
Unit disk graph recognition is NP-hard
Representing graphs by disks and balls (a survey of recognition-complexity results)
P. Hliněný and J. Kratochvíl · 2001
Later among the works it cites.
Lectures on discrete geometry
J. Matoušek · 2002
Later among the works it cites.
Efficient graph representations
J. P. Spinrad · 2003
Later among the works it cites.
Geometric graphs and arrangements
S. Felsner · 2004
Later among the works it cites.
On the representation of disk graphs
E. J. van Leeuwen and J. van Leeuwen · 2006
Later among the works it cites.
Optimization and approximation on systems of geometric objects
E. J. van Leeuwen · 2009
Later among the works it cites.
The number of bits needed to represent a unit disk graph
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
H. Breu and D. G. Kirkpatrick · 1998
Cited alongside, same era.
Oriented matroids
A. Björner, M. Las Vergnas, B. Sturmfels, N. White, and G. M. Ziegler · 1999
Cited alongside, same era.
Geometrie der Lage
K. G. C. Von Staudt
Cited in the paper.
C.J.H. McDiarmid and T. Müller · 2010
Later among the works it cites.