Vol. 28 No. 1 (2024)

Published: 2024-05-16

On Critical Node Problems with Vulnerable Vertices

Jannik Schestag, Niels Gruettemeier, Christian Komusiewicz, Frank Sommer

1-26
- PDF
Linear-algebraic implementation of Fibonacci heap

Danila Demin, Dmitry Sirotkin, Stanislav Moiseev

27-50
- PDF
The role of twins in computing planar supports of hypergraphs

René van Bevern, Iyad Kanj, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge

51-79
- PDF
The Minimum Consistent Spanning Subset Problem on Trees

Ahmad Biniaz, Parham Khamsepour

81-93
- PDF
Thrackles, Superthrackles and the Hanani-Tutte Theorem

Hooman Dehkordi, Graham Farr

95-127
- PDF
The maximum 2-edge-colorable subgraph problem and its fixed-parameter tractability

Vahan Mkrtchyan

129-147
- PDF
Faster maximal clique enumeration in large real-world link streams

Alexis Baudin, Clémence Magnien, Lionel Tabourier

149-178
- PDF
Distance-Preserving Graph Compression Techniques

Amirali Madani, Anil Maheshwari

179-224
- PDF
On Dispersability of Some Circulant Graphs

Paul C. Kainen, Samuel Joslin, Shannon Overbay

225-241
- PDF
Computing Optimal Leaf Roots of Chordal Cographs in Linear Time

Van Bang Le, Christian Rosenke

243-274
- PDF
On Upward-Planar L-Drawings of Graphs

Patrizio Angelini, Steven Chaplick, Sabine Cornelsen, Giordano Da Lozzo

275-299
- PDF
Nash Equilibria in Reverse Temporal Voronoi Games

Simeon Pawlowski, Vincent Froese

301-312
- PDF
Experimental Analysis of Algorithms for the Dynamic Graph Coloring Problem

Menno Theunis, Marcel Roeloffzen

313-349
- PDF
The Complexity of the Fixed Clique Property

Bernd Schröder

351-363
- PDF
A Greedy Probabilistic Heuristic for Graph Black-and-White Anticoloring

Daniel Berend, Shaked Mamana

365-383
- PDF
A Linear-Time Optimal Broadcasting Algorithm in Stars of Cliques

Peter Damaschke

385-388
- PDF
On 3-Coloring Circle Graphs

Patricia Bachmann, Ignaz Rutter, Peter Stumpf

389-402
- PDF
Unit-length Rectangular Drawings of Graphs

Carlos Alegría, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Fabrizio Grosso, Maurizio Patrignani

403-437
- PDF
Finding Near-Optimal Weight Independent Sets at Scale

Ernestine Großmann, Sebastian Lamm, Christian Schulz, Darren Strash

439-473
- PDF

Vol. 28 No. 1 (2024)

On Critical Node Problems with Vulnerable Vertices

Linear-algebraic implementation of Fibonacci heap

The role of twins in computing planar supports of hypergraphs

The Minimum Consistent Spanning Subset Problem on Trees

Thrackles, Superthrackles and the Hanani-Tutte Theorem

The maximum 2-edge-colorable subgraph problem and its fixed-parameter tractability

Faster maximal clique enumeration in large real-world link streams

Distance-Preserving Graph Compression Techniques

On Dispersability of Some Circulant Graphs

Computing Optimal Leaf Roots of Chordal Cographs in Linear Time

On Upward-Planar L-Drawings of Graphs

Nash Equilibria in Reverse Temporal Voronoi Games

Experimental Analysis of Algorithms for the Dynamic Graph Coloring Problem

The Complexity of the Fixed Clique Property

A Greedy Probabilistic Heuristic for Graph Black-and-White Anticoloring

A Linear-Time Optimal Broadcasting Algorithm in Stars of Cliques

On 3-Coloring Circle Graphs

Unit-length Rectangular Drawings of Graphs

Finding Near-Optimal Weight Independent Sets at Scale

Make a Submission

Information

Browse

Current Issue

Journal publisher

Journal network

Journal Supporters