Vol. 22 No. 2 (2018)

Published: 2018-01-01

Computing NodeTrix Representations of Clustered Graphs

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

139-176
- article (PDF)
On Algorithms Employing Treewidth for $L$-bounded Cut Problems

Petr Kolman

177-191
- article (PDF)
Edge $k$-$q$-Colorability of Graphs

Selma Djelloul, Odile Favaron, Mekkia Kouider

193-206
- article (PDF)
Data Structures and their Planar Graph Layouts

Christopher Auer, Christian Bachmaier, Franz Brandenburg, Wolfgang Brunner, Andreas Gleißner

207-237
- article (PDF)
Recognizing IC-Planar and NIC-Planar Graphs

Franz Brandenburg

239-271
- article (PDF)
Intersection Graphs of Rays and Grounded Segments

Jean Cardinal, Stefan Felsner, Tillmann Miltzow, Casey Tompkins, Birgit Vogtenhuber

273-295
- article (PDF)
An I/O-Efficient Algorithm for Computing Vertex Separators on Multi-Dimensional Grid Graphs and Its Applications

Junhao Gan, Yufei Tao

297-327
- article (PDF)
The SNPR neighbourhood of tree-child networks

Jonathan Klawitter

329-355
- article (PDF)
Drawing Planar Graphs with Few Geometric Primitives

Gregor Hültenschmidt, Philipp Kindermann, Wouter Meulemans, André Schulz

357-387
- article (PDF)
A Faster Algorithm for Maximum Induced Matchings on Circle Graphs

Max Ward, Andrew Gozzard, Michael Wise, Amitava Datta

389-396
- article (PDF)