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)
Précédent
Suivant
Sommaire du
Fascicule no. 1
Guest Editors' Foreword and Overview
Michael Bekos
;
Michael Kaufmann
;
Fabrizio Montecchiani
p. 1-10
On the size of planarly connected crossing graphs
Eyal Ackerman
;
Balázs Keszegh
;
Mate Vizer
p. 11-22
Parameterized Complexity of 1-Planarity
Michael Bannister
;
Sergio Cabello
;
David Eppstein
p. 23-49
A First Order Logic Definition of Beyond-Planar Graphs
Franz Brandenburg
p. 51-66
On the Maximum Crossing Number
Markus Chimani
;
Stefan Felsner
;
Stephen Kobourov
;
Torsten Ueckerdt
;
Pavel Valtr
;
Alexander Wolff
p. 67-87
Stack and Queue Layouts via Layered Separators
Vida Dujmović
;
Fabrizio Frati
p. 89-99
On the NP-hardness of GRacSim drawing and k-SEFE Problems
Luca Grilli
p. 101-116
Saturated simple and 2-simple topological graphs with few edges
Péter Hajnal
;
Alexander Igamberdiev
;
Günter Rote
;
André Schulz
p. 117-138
Sommaire du
Fascicule no. 2
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
Sommaire du
Fascicule no. 3
Guest editors' foreword
Fabrizio Frati
;
Kwan-Liu Ma
p. 397-399
Aligned Drawings of Planar Graphs
Tamara Mchedlidze
;
Marcel Radermacher
;
Ignaz Rutter
p. 401-429
Reconstructing Generalized Staircase Polygons with Uniform Step Length
Nodari Sitchinava
;
Darren Strash
p. 431-459
The Effect of Planarization on Width
David Eppstein
p. 461-481
Edge Bounds and Degeneracy of Triangle-Free Penny Graphs and Squaregraphs
David Eppstein
p. 483-499
Experimental Analysis of the Accessibility of Drawings with Few Segments
Philipp Kindermann
;
Wouter Meulemans
;
André Schulz
p. 501-518
Visual Similarity Perception of Directed Acyclic Graphs: A Study on Influencing Factors and Similarity Judgment Strategies
Kathrin Ballweg
;
Margit Pohl
;
Günter Wallner
;
Tatiana von Landesberger
p. 519-553
Sommaire du
Fascicule no. 4
Approximation Algorithms for Not Necessarily Disjoint Clustered TSP
Nili Guttmann-Beck
;
Eyal Knaan
;
Michal Stern
p. 555-575
Crossing Minimization for 1-page and 2-page Drawings of Graphs with Bounded Treewidth
Michael Bannister
;
David Eppstein
p. 577-606
A note on block-and-bridge preserving maximum common subgraph algorithms for outerplanar graphs
Nils Kriege
;
Andre Droschinsky
;
Petra Mutzel
p. 607-616