Information Technology Reference
In-Depth Information
17. Fulek, R., Pelsmajer, M., Schaefer, M., Stefankovic, D.: Hanani-Tutte, monotone drawings
and level-planarity. In: Pach, J. (ed.) Thirty Essays in Geometric Graph Theory, pp. 263-288
(2012)
18. Gall, F.L.: Powers of tensors and fast matrix multiplication. CoRR abs/1401.7714 (2014)
19. Gutwenger, C., Junger, M., Leipert, S., Mutzel, P., Percan, M., Weiskircher, R.: Advances in
c-planarity testing of clustered graphs. In: Goodrich, M.T., Kobourov, S.G. (eds.) GD 2002.
LNCS, vol. 2528, pp. 220-236. Springer, Heidelberg (2002)
20. Gutwenger, C., Mutzel, P., Schaefer, M.: Practical experience with Hanani-Tutte for testing
c-planarity. In: 2014 Proceedings of the Sixteenth Workshop on Algorithm Engineering and
Experiments (ALENEX), pp. 86-97 (2014)
21. Hanani, H.: Uber wesentlich unplattbare Kurven im drei-dimensionalen Raume. Fundamenta
Mathematicae 23, 135-142 (1934)
22. Hong,S.,Nagamochi, H.: Two-page topic embedding and clustered graph planarity. Techni-
cal report, Dept. of Applied Mathematics and Physics, University of Kyoto (2009)
23. Hopcroft, J., Tarjan, R.: Efficient planarity testing. J. ACM 21(4), 549-568 (1974)
24. Ibarra, O.H., Moran, S., Hui, R.: A generalization of the fast LUP matrix decomposition
algorithm and applications. J. Algorithms 3(1), 45-56 (1982)
25. Katz, B., Rutter, I., Woeginger, G.: An algorithmic study of switch graphs. In: Paul, C., Habib,
M. (eds.) WG 2009. LNCS, vol. 5911, pp. 226-237. Springer, Heidelberg (2010)
26. Kuratowski, K.: Sur le probleme des courbes gauches en topologie. Fund. Math. 15, 271-283
(1930)
27. Lawler, E.L.: Matroid intersection algorithms. Mathematical Programming 9, 31-56 (1975)
28. Lengauer, T.: Hierarchical planarity testing algorithms. J. ACM 36(3), 474-509 (1989)
29. Oxley, J.: Matroid Theory. Oxford University Press (2011)
30. Pach, J., T oth, G.: Which crossing number is it anyway? J. Combin. Theory Ser. B 80(2),
225-246 (2000)
31. Pach, J., T oth, G.: Monotone drawingsofplanargraphs. J. Graph Theory 46(1), 39-47
(2004), updated version: arXiv:1101.0967
32. Pelsmajer, M.J., Schaefer, M., Stasi, D.: Strong Hanani-Tutte on the projective plane. SIAM
Journal on Discrete Mathematics 23(3), 1317-1323 (2009)
33. Pelsmajer, M.J., Schaefer, M., Stefankovic, D.: Removing even crossings. J. Combin. Theory
Ser. B 97(4), 489-500 (2007)
34. Pelsmajer, M.J., Schaefer, M., Stefankovic, D.: Removing even crossingsonsurfaces. Euro-
pean Journal of Combinatorics 30(7), 1704-1717 (2009)
35. Schaefer, M.: Hanani-Tutte and related results. To appear in Bolyai Memorial Volume
36. Schaefer, M.: Toward a theory of planarity: Hanani-tutte and planarity variants. J. Graph
Algorithms Appl. 17(4), 367-440 (2013)
37. Tutte, W.T.: Toward a theory of crossing numbers. J. Combin. Theory 8, 45-53 (1970)
38. Whitney, H.: Non-separable and planar graphs. Trans. Amer. Math. Soc. 34, 339-362 (1932)
39. Williams, V.V.: Multiplying matrices faster than Coppersmith-Winograd. In: Proceedingsof
the Forty-Fourth Annual ACM Symposium on Theory of Computing, STOC 2012, pp. 887-
898 (2012)
