Information Technology Reference
In-Depth Information
12. Hong, S.-H., Eades, P., Liotta, G., Poon, S.-H.: Fary's theorem for 1-planar graphs.
In: Gudmundsson, J., Mestre, J., Viglas, T. (eds.) COCOON 2012. LNCS, vol. 7434,
pp. 335-346. Springer, Heidelberg (2012)
13. Jelınek, V., Kratochvıl, J., Rutter, I.: A Kuratowski-type theorem for planarity of
partially embedded graphs. Comput. Geom. 46(4), 466-492 (2013)
14. Korzhik, V.P., Mohar, B.: Minimal obstructions for 1-immersions and hardness of
1-planarity testing. In: Tollis, I.G., Patrignani, M. (eds.) GD 2008. LNCS, vol. 5417,
pp. 302-312. Springer, Heidelberg (2009)
15. Kratochvıl, J.: String graphs. I. The number of critical nonstring graphs is infinite.
J. Combin. Theory Ser. B 52(1), 53-66 (1991)
16. Kratochvıl, J.: Crossing number of abstract topological graphs. In: Whitesides,
S.H. (ed.) GD 1998. LNCS, vol. 1547, pp. 238-245. Springer, Heidelberg (1999)
17. Makinen, E.: On circular layouts. International Journal of Computer Mathemat-
ics 24(1), 29-37 (1988)
18. Nagamochi, H.: Straight-line drawability of embedded graphs. Technical Report
2013-005, Kyoto University (2013)
19. Pelsmajer, M.J., Schaefer, M., Stefankovic, D.: Removing independently even cross-
ings. SIAM Journal on Discrete Mathematics 24(2), 379-393 (2010)
20. Schaefer, M.: Complexity of some geometric and topological problems. In: Epp-
stein, D., Gansner, E.R. (eds.) GD 2009. LNCS, vol. 5849, pp. 334-344. Springer,
Heidelberg (2010)
21. Schaefer, M.: Toward a theory of planarity: Hanani-Tutte and planarity variants.
Journal of Graph Algortihms and Applications 17(4), 367-440 (2013)
22. Schaefer, M.: Hanani-Tutte and related results. In: Barany, I., Boroczky, K.J., Fejes
Toth, G., Pach, J. (eds.) Geometry—Intuitive, Discrete, and Convex—A Tribute to
Laszlo Fejes Toth. Bolyai Society Mathematical Studies, vol. 24. Springer, Berlin
(2014)
23. Schaefer, M., Sedgwick, E., Stefankovic, D.: Recognizing string graphs in NP. In:
Proceedings of the 33th Annual ACM Symposium on Theory of Computing (STOC
2002) (2002)
24. Schaefer, M., Stefankovic, D.: Fixed points, Nash equilibria, and the existential
theory of the reals. Unpublished manuscript (2009)
25. Shor, P.W.: Stretchability of pseudolines is NP-hard. In: Applied Geometry and
Discrete Mathematics. DIMACS Ser. DiscreteMath.Theoret.Comput.Sci.,vol.4,
pp. 531-554. Amer. Math. Soc., Providence (1991)
26. Thomassen, C.: Rectilinear drawings of graphs. J. Graph Theory 12(3), 335-341
(1988)
27. Tutte, W.T.: Toward a theory of crossing numbers. J. Combinatorial Theory 8,
45-53 (1970)
28. Wikipedia. Existential theory of the reals (2012),
http://en.wikipedia.org/
wiki/Existential theory of the reals
(Online; accessed July 17, 2013)
