Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Graph Algorithms and Applications, Volume 22
Volume 22, Number 1, 2018
- Michael A. Bekos, Michael Kaufmann, Fabrizio Montecchiani
:
Guest Editors' Foreword and Overview. 1-10 - Eyal Ackerman, Balázs Keszegh, Máté Vizer:
On the size of planarly connected crossing graphs. 11-22 - Michael J. Bannister, Sergio Cabello, David Eppstein:
Parameterized Complexity of 1-Planarity. 23-49 - Franz J. Brandenburg:
A First Order Logic Definition of Beyond-Planar Graphs. 51-66 - Markus Chimani, Stefan Felsner, Stephen G. Kobourov, Torsten Ueckerdt, Pavel Valtr, Alexander Wolff:
On the Maximum Crossing Number. 67-87 - Vida Dujmovic, Fabrizio Frati:
Stack and Queue Layouts via Layered Separators. 89-99 - Luca Grilli:
On the NP-hardness of GRacSim drawing and k-SEFE Problems. 101-116 - Péter Hajnal, Alexander Igamberdiev, Günter Rote, André Schulz:
Saturated simple and 2-simple topological graphs with few edges. 117-138
Volume 22, Number 2, 2018
- Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani:
Computing NodeTrix Representations of Clustered Graphs. 139-176 - Petr Kolman:
On Algorithms Employing Treewidth for L-bounded Cut Problems. 177-191 - Selma Djelloul, Odile Favaron, Mekkia Kouider:
Edge k-q-Colorability of Graphs. 193-206 - Christopher Auer, Christian Bachmaier, Franz J. Brandenburg, Wolfgang Brunner, Andreas Gleißner:
Data Structures and their Planar Graph Layouts. 207-237 - Franz J. Brandenburg:
Recognizing IC-Planar and NIC-Planar Graphs. 239-271 - Jean Cardinal, Stefan Felsner, Tillmann Miltzow, Casey Tompkins, Birgit Vogtenhuber:
Intersection Graphs of Rays and Grounded Segments. 273-295 - Junhao Gan, Yufei Tao:
An I/O-Efficient Algorithm for Computing Vertex Separators on Multi-Dimensional Grid Graphs and Its Applications. 297-327 - Jonathan Klawitter:
The SNPR neighbourhood of tree-child networks. 329-355 - Gregor Hültenschmidt, Philipp Kindermann, Wouter Meulemans, André Schulz:
Drawing Planar Graphs with Few Geometric Primitives. 357-387 - Max Ward, Andrew Gozzard, Michael J. Wise, Amitava Datta:
A Faster Algorithm for Maximum Induced Matchings on Circle Graphs. 389-396
Volume 22, Number 3, 2018
- Fabrizio Frati, Kwan-Liu Ma:
Guest editors' foreword. 397-399 - Tamara Mchedlidze, Marcel Radermacher, Ignaz Rutter:
Aligned Drawings of Planar Graphs. 401-429 - Nodari Sitchinava, Darren Strash:
Reconstructing Generalized Staircase Polygons with Uniform Step Length. 431-459 - David Eppstein:
The Effect of Planarization on Width. 461-481 - David Eppstein:
Edge Bounds and Degeneracy of Triangle-Free Penny Graphs and Squaregraphs. 483-499 - Philipp Kindermann, Wouter Meulemans, André Schulz:
Experimental Analysis of the Accessibility of Drawings with Few Segments. 501-518 - Kathrin Ballweg, Margit Pohl, Günter Wallner, Tatiana von Landesberger:
Visual Similarity Perception of Directed Acyclic Graphs: A Study on Influencing Factors and Similarity Judgment Strategies. 519-553
Volume 22, Number 4, 2018
- Nili Guttmann-Beck, Eyal Knaan, Michal Stern:
Approximation Algorithms for Not Necessarily Disjoint Clustered TSP. 555-575 - Michael J. Bannister, David Eppstein:
Crossing Minimization for 1-page and 2-page Drawings of Graphs with Bounded Treewidth. 577-606 - Nils M. Kriege, Andre Droschinsky, Petra Mutzel:
A note on block-and-bridge preserving maximum common subgraph algorithms for outerplanar graphs. 607-616
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-04-22 20:58 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
