Parcourir par
Revues
Séminaires
Livres
Congrès
Sources
Geodesic
Parcourir par
Revues
Séminaires
Livres
Congrès
Sources
Journal of Graph Algorithms and Applications
Tome 22 (2018)
no. 2
Précédent
Suivant
Volume 22 (2018) no. 2
Sommaire
Computing NodeTrix Representations of Clustered Graphs
Giordano Da Lozzo
;
Giuseppe Di Battista
;
Fabrizio Frati
;
Maurizio Patrignani
p. 139-176
On Algorithms Employing Treewidth for
L
-bounded Cut Problems
Petr Kolman
p. 177-191
Edge
k
-
q
-Colorability of Graphs
Selma Djelloul
;
Odile Favaron
;
Mekkia Kouider
p. 193-206
Data Structures and their Planar Graph Layouts
Christopher Auer
;
Christian Bachmaier
;
Franz Brandenburg
;
Wolfgang Brunner
;
Andreas Gleißner
p. 207-237
Recognizing IC-Planar and NIC-Planar Graphs
Franz Brandenburg
p. 239-271
Intersection Graphs of Rays and Grounded Segments
Jean Cardinal
;
Stefan Felsner
;
Tillmann Miltzow
;
Casey Tompkins
;
Birgit Vogtenhuber
p. 273-295
An I/O-Efficient Algorithm for Computing Vertex Separators on Multi-Dimensional Grid Graphs and Its Applications
Junhao Gan
;
Yufei Tao
p. 297-327
The SNPR neighbourhood of tree-child networks
Jonathan Klawitter
p. 329-355
Drawing Planar Graphs with Few Geometric Primitives
Gregor Hültenschmidt
;
Philipp Kindermann
;
Wouter Meulemans
;
André Schulz
p. 357-387
A Faster Algorithm for Maximum Induced Matchings on Circle Graphs
Max Ward
;
Andrew Gozzard
;
Michael Wise
;
Amitava Datta
p. 389-396
