On the degenerate crossing number, Discrete Comput. Geom, vol.49, issue.3, pp.695-702, 2013. ,
The bundled crossing number, LNCS, vol.9801, pp.399-412, 2016. ,
Algebraic and geometric methods in enumerative combinatorics, Handbook of Enumerative Combinatorics, 2015. ,
Extending drawings of graphs to arrangements of pseudolines, p.2020 ,
URL : https://hal.archives-ouvertes.fr/hal-02471760
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. ,
Nonserial dynamic programming, Mathematics in Science & Engineering, vol.91, 1972. ,
A linear-time algorithm for finding tree-decompositions of small treewidth, SIAM J. Comput, vol.25, issue.6, pp.1305-1317, 1996. ,
Beyond outerplanarity, LNCS, vol.10692, pp.546-559, 2018. ,
Bundled crossings revisited, LNCS, vol.11904, pp.63-77, 2019. ,
URL : https://hal.archives-ouvertes.fr/hal-02972975
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
Graph Structure and Monadic Second-Order Logic: A Language-Theoretic Approach, 2012. ,
URL : https://hal.archives-ouvertes.fr/hal-00646514
Geometry-based edge clustering for graph visualization, IEEE Trans. Vis. Comput. Graph, vol.14, issue.6, pp.1277-1284, 2008. ,
Computational topology of graphs on surfaces, Handbook of Discrete and Computational Geometry, chapter 23, 2017. ,
On the number of arrangements of pseudolines, Discrete Comput. Geom, vol.18, pp.257-267, 1997. ,
Pseudoline arrangements, Handbook of Discrete and Computational Geometry, chapter 5, 2018. ,
Bundled crossings in embedded graphs, LNCS, vol.9644, pp.454-468, 2016. ,
Ordering metro lines by block crossings, J. Graph Algorithms Appl, vol.19, issue.1, pp.111-153, 2015. ,
Multilevel agglomerative edge bundling for visualizing large graphs ,
, PACIFICVIS, pp.187-194, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00696742
Hierarchical edge bundles: Visualization of adjacency relations in hierarchical data, IEEE Trans. Vis. Comput. Graphics, vol.12, issue.5, pp.741-748, 2006. ,
Bundled visualization of dynamicgraph and trail data, IEEE Trans. Vis. Comput. Graphics, vol.20, issue.8, pp.1141-1157, 2014. ,
Graph bundling by kernel density estimation, Comput. Graph. Forum, vol.31, pp.865-874, 2012. ,
URL : https://hal.archives-ouvertes.fr/hal-01022472
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. ,
Computing crossing number in linear time, STOC, pp.382-390, 2007. ,
Computing a canonical polygonal schema of an orientable triangulated surface, SoCG, pp.80-89, 2001. ,
URL : https://hal.archives-ouvertes.fr/hal-00804691
Optimal parameterized algorithms for planar facility location problems using Voronoi diagrams, LNCS, vol.9294, pp.865-877 ,
, , 2015.
Linear algorithms to recognize outerplanar and maximal outerplanar graphs, Inform. Process. Lett, vol.9, issue.5, pp.90075-90084, 1979. ,
A linear time algorithm for embedding graphs in an arbitrary surface, SIAM J. Discrete Math, vol.12, issue.1, pp.6-26, 1999. ,
The genus crossing number, ARS Mathematica Contemporanea, vol.2, issue.2, pp.157-162, 2009. ,
Degenerate crossing numbers, Discrete Comput. Geom, vol.41, issue.3, p.376, 2009. ,
Edge routing with ordered bundles, Comput. Geom. Theory Appl, vol.52, pp.18-33, 2016. ,
Graph minors. III. Planar tree-width, J. Combin. Theory Ser. B, vol.36, issue.1, pp.90013-90016, 1984. ,
The graph crossing number and its variants: A survey, Electr. J. Combin, 2017. ,
The degenerate crossing number and higher-genus embeddings, LNCS, vol.9411, pp.63-74, 2015. ,
The graph genus problem is NP-complete, J. Algorithms, vol.10, issue.4, pp.568-576, 1989. ,
Block crossings in storyline visualizations, J. Graph Algorithms Appl, vol.21, issue.5, pp.873-913, 2017. ,
Computing storylines with few block crossings, GD, volume 10692 of LNCS, pp.365-378, 2018. ,