E. Ackerman and R. Pinchasi, On the degenerate crossing number, Discrete Comput. Geom, vol.49, issue.3, pp.695-702, 2013.

M. Alam, M. Fink, and S. Pupyrev, The bundled crossing number, LNCS, vol.9801, pp.399-412, 2016.

F. Ardila, Algebraic and geometric methods in enumerative combinatorics, Handbook of Enumerative Combinatorics, 2015.

A. Arroyo, J. Bensmail, and R. B. Richter, Extending drawings of graphs to arrangements of pseudolines, p.2020
URL : https://hal.archives-ouvertes.fr/hal-02471760

M. J. Bannister and D. Eppstein, Crossing minimization for 1-page and 2-page drawings of graphs with bounded treewidth, J. Graph Algorithms Appl, vol.22, issue.4, pp.577-606, 2018.

U. Bertelè and F. Brioschi, Nonserial dynamic programming, Mathematics in Science & Engineering, vol.91, 1972.

H. L. Bodlaender, A linear-time algorithm for finding tree-decompositions of small treewidth, SIAM J. Comput, vol.25, issue.6, pp.1305-1317, 1996.

S. Chaplick, M. Kryven, G. Liotta, A. Löffler, and A. Wolff, Beyond outerplanarity, LNCS, vol.10692, pp.546-559, 2018.

S. Chaplick, T. C. Van-dijk, M. Kryven, J. Park, A. Ravsky et al., Bundled crossings revisited, LNCS, vol.11904, pp.63-77, 2019.
URL : https://hal.archives-ouvertes.fr/hal-02972975

B. Courcelle, The monadic second-order logic of graphs. I. Recognizable sets of finite graphs, Inform. Comput, vol.85, issue.1, p.90043, 1990.
URL : https://hal.archives-ouvertes.fr/hal-00353765

B. Courcelle and J. Engelfriet, Graph Structure and Monadic Second-Order Logic: A Language-Theoretic Approach, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00646514

W. Cui, H. Zhou, H. Qu, P. C. Wong, and X. Li, Geometry-based edge clustering for graph visualization, IEEE Trans. Vis. Comput. Graph, vol.14, issue.6, pp.1277-1284, 2008.

É. C. De-verdière, Computational topology of graphs on surfaces, Handbook of Discrete and Computational Geometry, chapter 23, 2017.

S. Felsner, On the number of arrangements of pseudolines, Discrete Comput. Geom, vol.18, pp.257-267, 1997.

S. Felsner and J. Goodman, Pseudoline arrangements, Handbook of Discrete and Computational Geometry, chapter 5, 2018.

M. Fink, J. Hershberger, S. Suri, and K. Verbeek, Bundled crossings in embedded graphs, LNCS, vol.9644, pp.454-468, 2016.

M. Fink, S. Pupyrev, and A. Wolff, Ordering metro lines by block crossings, J. Graph Algorithms Appl, vol.19, issue.1, pp.111-153, 2015.

E. R. Gansner, Y. Hu, S. North, and C. Scheidegger, Multilevel agglomerative edge bundling for visualizing large graphs

H. Fekete and . Qu, PACIFICVIS, pp.187-194, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00696742

D. Holten, Hierarchical edge bundles: Visualization of adjacency relations in hierarchical data, IEEE Trans. Vis. Comput. Graphics, vol.12, issue.5, pp.741-748, 2006.

C. Hurter, O. Ersoy, S. I. Fabrikant, T. R. Klein, and A. C. Telea, Bundled visualization of dynamicgraph and trail data, IEEE Trans. Vis. Comput. Graphics, vol.20, issue.8, pp.1141-1157, 2014.

C. Hurter, O. Ersoy, and A. Telea, Graph bundling by kernel density estimation, Comput. Graph. Forum, vol.31, pp.865-874, 2012.
URL : https://hal.archives-ouvertes.fr/hal-01022472

K. Kawarabayashi, B. Mohar, and B. A. Reed, A simpler linear time algorithm for embedding graphs into an arbitrary surface and the genus of graphs of bounded tree-width, FOCS, pp.771-780, 2008.

K. Kawarabayashi and B. Reed, Computing crossing number in linear time, STOC, pp.382-390, 2007.

F. Lazarus, M. Pocchiola, G. Vegter, and A. Verroust, Computing a canonical polygonal schema of an orientable triangulated surface, SoCG, pp.80-89, 2001.
URL : https://hal.archives-ouvertes.fr/hal-00804691

D. Marx and M. Pilipczuk, Optimal parameterized algorithms for planar facility location problems using Voronoi diagrams, LNCS, vol.9294, pp.865-877

. Springer, , 2015.

S. L. Mitchell, Linear algorithms to recognize outerplanar and maximal outerplanar graphs, Inform. Process. Lett, vol.9, issue.5, pp.90075-90084, 1979.

B. Mohar, A linear time algorithm for embedding graphs in an arbitrary surface, SIAM J. Discrete Math, vol.12, issue.1, pp.6-26, 1999.

B. Mohar, The genus crossing number, ARS Mathematica Contemporanea, vol.2, issue.2, pp.157-162, 2009.

J. Pach and G. Tóth, Degenerate crossing numbers, Discrete Comput. Geom, vol.41, issue.3, p.376, 2009.

S. Pupyrev, L. Nachmanson, S. Bereg, and A. E. Holroyd, Edge routing with ordered bundles, Comput. Geom. Theory Appl, vol.52, pp.18-33, 2016.

N. Robertson and P. D. Seymour, Graph minors. III. Planar tree-width, J. Combin. Theory Ser. B, vol.36, issue.1, pp.90013-90016, 1984.

M. Schaefer, The graph crossing number and its variants: A survey, Electr. J. Combin, 2017.

M. Schaefer and D. ?tefankovi?, The degenerate crossing number and higher-genus embeddings, LNCS, vol.9411, pp.63-74, 2015.

C. Thomassen, The graph genus problem is NP-complete, J. Algorithms, vol.10, issue.4, pp.568-576, 1989.

T. C. Van-dijk, M. Fink, N. Fischer, F. Lipp, P. Markfelder et al., Block crossings in storyline visualizations, J. Graph Algorithms Appl, vol.21, issue.5, pp.873-913, 2017.

T. C. Van-dijk, F. Lipp, P. Markfelder, and A. Wolff, Computing storylines with few block crossings, GD, volume 10692 of LNCS, pp.365-378, 2018.