Geodesic

Sommaire du Fascicule no. 1

On Critical Node Problems with Vulnerable Vertices
p. 1-26
Linear-algebraic implementation of Fibonacci heap
p. 27-50
The role of twins in computing planar supports of hypergraphs
p. 51-79
The Minimum Consistent Spanning Subset Problem on Trees
p. 81-93
Thrackles, Superthrackles and the Hanani-Tutte Theorem
p. 95-127
The maximum 2-edge-colorable subgraph problem and its fixed-parameter tractability
p. 129-147
Faster maximal clique enumeration in large real-world link streams
p. 149-178
Distance-Preserving Graph Compression Techniques
p. 179-224
On Dispersability of Some Circulant Graphs
p. 225-241
Computing Optimal Leaf Roots of Chordal Cographs in Linear Time
p. 243-274
On Upward-Planar L-Drawings of Graphs
p. 275-299
Nash Equilibria in Reverse Temporal Voronoi Games
p. 301-312
Experimental Analysis of Algorithms for the Dynamic Graph Coloring Problem
p. 313-349
The Complexity of the Fixed Clique Property
p. 351-363
A Greedy Probabilistic Heuristic for Graph Black-and-White Anticoloring
p. 365-383
A Linear-Time Optimal Broadcasting Algorithm in Stars of Cliques
p. 385-388
On 3-Coloring Circle Graphs
p. 389-402
Unit-length Rectangular Drawings of Graphs
p. 403-437
Finding Near-Optimal Weight Independent Sets at Scale
p. 439-473

Sommaire du Fascicule no. 2

Guest Editors' Foreword
p. i-iii
Min-$k$-planar Drawings of Graphs
p. 1-35
On RAC Drawings of Graphs with Two Bends per Edge
p. 37-45
Removing Popular Faces in Curve Arrangements
p. 47-82
On the Biplanarity of Blowups
p. 83-99
Computing Hive Plots: A Combinatorial Framework
p. 101-129
Fixed-Parameter Algorithms for Computing Bend-Restricted RAC Drawings of Graphs
p. 131-150

Sommaire du Fascicule no. 3

Special Issue on WALCOM 2023: Guest Editors' Foreword
p. 1-2
Piercing Diametral Disks Induced by Edges of Maximum Spanning Trees
p. 3-10
Graph Burning in Community-based Networks
p. 11-30
Splitting Plane Graphs to Outerplanarity
p. 31-48
Certifying Induced Subgraphs in Large Graphs
p. 49-68
Some Algorithmic Results for Eternal Vertex Cover Problem in Graphs
p. 69-85
Reconfiguration of vertex-disjoint shortest paths on graphs
p. 87-101