Vol. 24 No. 3 (2020)

Published: 2020-03-01

Minimizing the Hamming distance between a graph and a line-graph to discover the topology of an electrical network

Wilfried Ehounou, Dominique Barth, Arnaud de Moissac, Dimitri Watel, Marc-Antoine Weisser

133-153
- article (PDF)
Maximum Cut Parameterized by Crossing Number

Markus Chimani, Christine Dahn, Martina Juhnke-Kubitzke, Nils Kriege, Petra Mutzel, Alexander Nover

155-170
- article (PDF)
On the Approximability of the Minimum Weight $t$-partite Clique Problem

Geoffrey Solano, Guillaume Blin, Mathieu Raffinot, Jhoirene Clemente, Jaime Caro

171-190
- article (PDF)
Bounds and algorithms for graph trusses

Paul Burkhardt, Vance Faber, David Harris

191-214
- article (PDF)
Parameterized Complexity of Safe Set

Rémy Belmonte, Tesshu Hanaka, Ioannis Katsikarelis, Michael Lampis, Hirotaka Ono, Yota Otachi

215-245
- article (PDF)
A Note on Universal Point Sets for Planar Graphs

Manfred Scheucher, Hendrik Schrezenmaier, Raphael Steiner

247-267
- article (PDF)
- additional material (4.53 MB) (provided by authors)
Graph Stories in Small Area

Manuel Borrazzo, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani

269-292
- article (PDF)
Not all planar graphs are in PURE-4-DIR

Daniel Gonçalves

293-301
- article (PDF)
On Polynomial-Time Combinatorial Algorithms for Maximum $L$-Bounded Flow

Kateřina Altmanová, Petr Kolman, Jan Voborník

303-322
- article (PDF)
Improved Bounds for Track Numbers of Planar Graphs

Sergey Pupyrev

323-341
- article (PDF)
On L-shaped point set embeddings of trees: first non-embeddable examples

Torsten Mütze, Manfred Scheucher

343-369
- article (PDF)
- additional material (provided by authors)
Graph Motif Problems Parameterized by Dual

Guillaume Fertin, Christian Komusiewicz

371-396
- article (PDF)
Smoothed Analysis of the Minimum-Mean Cycle Canceling Algorithm and the Network Simplex Algorithm

Kamiel Cornelissen, Bodo Manthey

397-421
- article (PDF)
An Ongoing Project to Improve the Rectilinear and the Pseudolinear Crossing Constants

Oswin Aichholzer, Frank Duque, Ruy Fabila-Monroy, Oscar García-Quintero, Carlos Hidalgo-Toscano

421-432
- article (PDF)
Enumerating Grid Layouts of Graphs

Peter Damaschke

433-460
- article (PDF)
Lower Bounds for Dynamic Programming on Planar Graphs of Bounded Cutwidth

Bas van Geffen, Bart Jansen, Arnoud de Kroon, Rolf Morel

461-482
- article (PDF)
An Adaptive Version of Brandes' Algorithm for Betweenness Centrality

Matthias Bentert, Alexander Dittmann, Leon Kellerhals, André Nichterlein, Rolf Niedermeier

483-522
- article (PDF)
Problems on One Way Road Networks

Jammigumpula Ajay, Avinandan Das, Binayak Dutta, Arindam Karmakar, Sasanka Roy, Navaneeta Saikia

523-546
- article (PDF)

Vol. 24 No. 3 (2020)

Minimizing the Hamming distance between a graph and a line-graph to discover the topology of an electrical network

Maximum Cut Parameterized by Crossing Number

On the Approximability of the Minimum Weight $t$-partite Clique Problem

Bounds and algorithms for graph trusses

Parameterized Complexity of Safe Set

A Note on Universal Point Sets for Planar Graphs

Graph Stories in Small Area

Not all planar graphs are in PURE-4-DIR

On Polynomial-Time Combinatorial Algorithms for Maximum $L$-Bounded Flow

Improved Bounds for Track Numbers of Planar Graphs

On L-shaped point set embeddings of trees: first non-embeddable examples

Graph Motif Problems Parameterized by Dual

Smoothed Analysis of the Minimum-Mean Cycle Canceling Algorithm and the Network Simplex Algorithm

An Ongoing Project to Improve the Rectilinear and the Pseudolinear Crossing Constants

Enumerating Grid Layouts of Graphs

Lower Bounds for Dynamic Programming on Planar Graphs of Bounded Cutwidth

An Adaptive Version of Brandes' Algorithm for Betweenness Centrality

Problems on One Way Road Networks

Make a Submission

Information

Browse

Current Issue

Journal publisher

Journal network

Journal Supporters