Lower bounds for the number of edge-crossings over the spine in a topological book embedding of a graph

Curve-constrained drawings of planar graphs

Computational Geometry: Theory and Applications

Approximating the fixed linear crossing number

Discrete Applied Mathematics

Crossing-Optimal Acyclic Hamiltonian Path Completion and Its Application to Upward Topological Book Embeddings

WALCOM '09 Proceedings of the 3rd International Workshop on Algorithms and Computation

Computing upward topological book embeddings of upward planar digraphs

ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation

Characterisations and examples of graph classes with bounded expansion

European Journal of Combinatorics

Layouts of graph subdivisions

GD'04 Proceedings of the 12th international conference on Graph Drawing