REFERENCES 485
[Epp04b] D. Eppstein. Testing bipartiteness of geometr i c intersection graphs.
In Proc. 1 5t h Annual ACM-SIAM Symp. on Discrete Algorithms
(SODA’04), pages 860–868, 2004. Also i n ACM Transactions on Al-
gorithms, 5(2), Article No. 15, 2009.
[Erd51] P. Erd¨os. Appendix . In K. F. Roth, On a p r oble m of Heilbronn. J.
London Math. Soc., 26:198–204, 1951.
[ESW96] P. Eades, C. Stirk, and S. Whitesides. The techniques of Kolmogorov
and Barzdin for three dime ns ional orthogonal graph drawings. Inform.
Proc. Lett., 60(2):97–103, 1996.
[ESW00] P. Eades, A. Symvonis, and S. Whitesides. Three dimensional orthogonal
graph drawing algorithms. Discrete Applied Math., 103:55–87, 2000.
[FLW01] S. Felsner, G. Liotta, and S. Wismath. Straight-line ...