Geodesic

Volume 24 (2020) no. 3

Sommaire

Minimizing the Hamming distance between a graph and a line-graph to discover the topology of an electrical network
p. 133-153
Maximum Cut Parameterized by Crossing Number
p. 155-170
On the Approximability of the Minimum Weight t-partite Clique Problem
p. 171-190
Bounds and algorithms for graph trusses
p. 191-214
Parameterized Complexity of Safe Set
p. 215-245
A Note on Universal Point Sets for Planar Graphs
p. 247-267
Graph Stories in Small Area
p. 269-292
Not all planar graphs are in PURE-4-DIR
p. 293-301
On Polynomial-Time Combinatorial Algorithms for Maximum L-Bounded Flow
p. 303-322
Improved Bounds for Track Numbers of Planar Graphs
p. 323-341
On L-shaped point set embeddings of trees: first non-embeddable examples
p. 343-369
Graph Motif Problems Parameterized by Dual
p. 371-396
Smoothed Analysis of the Minimum-Mean Cycle Canceling Algorithm and the Network Simplex Algorithm
p. 397-421
An Ongoing Project to Improve the Rectilinear and the Pseudolinear Crossing Constants
p. 421-432
Enumerating Grid Layouts of Graphs
p. 433-460
Lower Bounds for Dynamic Programming on Planar Graphs of Bounded Cutwidth
p. 461-482
An Adaptive Version of Brandes' Algorithm for Betweenness Centrality
p. 483-522
Problems on One Way Road Networks
p. 523-546