Geodesic

Volume 25 (2021) no. 1

Sommaire

Drawing Subcubic 1-Planar Graphs with Few Bends, Few Slopes, and Large Angles
p. 1-28
Complexity of Geometric k-Planarity for Fixed k
p. 29-41
Two Results on Layered Pathwidth and Linear Layouts
p. 43-57
Minimal Embedding Dimensions of Rectangle k-Visibility Graphs
p. 59-96
Equilateral Spherical Drawings of Planar Cayley Graphs
p. 97-119
Circumference of essentially 4-connected planar triangulations
p. 121-132
On the Balance of Unrooted Trees
p. 133-150
Multilevel Planarity
p. 151-170
On Area-Universal Quadrangulations
p. 171-193
On the Complexity of Some Geometric Problems With Fixed Parameters
p. 195-218
Fast Generation of Unlabelled Free Trees using Weight Sequences
p. 219-240
Algebraic Algorithms for Betweenness and Percolation Centrality
p. 241-261
Heading in the right direction? Using head moves to traverse phylogenetic network space
p. 263-310
Schematic Representation of Large Biconnected Graphs
p. 311-352
Radial Level Planarity with Fixed Embedding
p. 353-366
An algorithm for embedding Turán graphs into incomplete hypercubes with minimum wirelength
p. 367-381
The number of crossings in multigraphs with no empty lens
p. 383-396
Least resolved trees for two-colored best match graphs
p. 397-416
Tree Containment With Soft Polytomies
p. 417-436
Synchronized Traveling Salesman Problem
p. 437-459
Decycling bipartite graphs
p. 461-480
On Strict (Outer-)Confluent Graphs
p. 481-512
Revising the Fellows-Kaschube K3,3 Search
p. 513-520
On 2-Clubs in Graph-Based Data Clustering: Theory and Algorithm Engineering
p. 521-547
Bipartite and Series-Parallel Graphs Without Planar Lombardi Drawings
p. 549-562
A family of tree-based generators for bubbles in directed graphs
p. 563-580
Extending Partial Orthogonal Drawings
p. 581-602