default search action
Journal of Graph Algorithms and Applications, Volume 16
Volume 16, Number 1, 2012
- Ulrik Brandes, Sabine Cornelsen:
Guest Editor's Foreword. 3-4 - Patrizio Angelini, Enrico Colasante, Giuseppe Di Battista, Fabrizio Frati
, Maurizio Patrignani:
Monotone Drawings of Graphs. 5-35 - Patrizio Angelini, Markus Geyer, Michael Kaufmann, Daniel Neuwirth:
On a Tree and a Path with no Geometric Simultaneous Embedding. 37-83 - Christian A. Duncan, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Martin Nöllenburg
Lombardi Drawings of Graphs. 85-108 - Giordano Da Lozzo, Giuseppe Di Battista, Francesco Ingrassia:
Drawing Graphs on a Smartphone. 109-126
Volume 16, Number 2, 2012
- Andrei Asinowski, Elad Cohen, Martin Charles Golumbic, Vincent Limouzy, Marina Lipshteyn, Michal Stern:
Vertex Intersection Graphs of Paths on a Grid. 129-150 - Christian Bachmaier, Franz-Josef Brandenburg, Wolfgang Brunner, Raymund Fülöp:
Drawing Recurrent Hierarchies. 151-198 - Boaz Ben-Moshe, Amit Dvir
Centdian Computation in Cactus Graphs. 199-224 - Bojan Mohar, Petr Skoda:
Minimizing the Number of Label Transitions Around a Nonseparating Vertex of a Planar Graph. 225-241 - Erin W. Chambers
Drawing Graphs in the Plane with a Prescribed Outer Face and Polynomial Area. 243-259 - Shira Zucker:
The Black-and-White Coloring Problem on Chordal Graphs. 261-281 - Krishnam Raju Jampani, Anna Lubiw:
The Simultaneous Representation Problem for Chordal, Comparability and Permutation Graphs. 283-315 - Jiun-Jie Wang, Xin He:
Visibility Representation of Plane Graphs with Simultaneous Bound for Both Width and Height. 317-334 - Demetres Christofides
Finding Hamilton cycles in robustly expanding digraphs. 335-358 - Vassilis Tsiaras, Ioannis G. Tollis:
DAGmaps and ε-Visibility Representations for DAGs: Algorithms and Characterizations. 359-380 - John M. Boyer
Subgraph Homeomorphism via the Edge Addition Planarity Algorithm. 381-410 - Robert Görke, Tanja Hartmann, Dorothea Wagner:
Dynamic Graph Clustering Using Minimum-Cut Trees. 411-446 - Reinhard Bauer, Gianlorenzo D'Angelo
The Shortcut Problem - Complexity and Algorithms. 447-481 - Arnold L. Rosenberg:
The Parking Problem for Finite-State Robots. 483-506 - Gregory L. McColm:
Generating Geometric Graphs Using Automorphisms. 507-541 - David Eppstein, Emma S. Spiro
The h-Index of a Graph and its Application to Dynamic Subgraph Statistics. 543-567 - Evmorfia N. Argyriou, Michael A. Bekos
The Straight-Line RAC Drawing Problem is NP-Hard. 569-597 - Ignaz Rutter
Augmenting the Connectivity of Planar and Geometric Graphs. 599-628
Volume 16, Number 3, 2012
- Marc J. van Kreveld, Bettina Speckmann
Guest Editor's Foreword. 631-633 - Sabine Cornelsen, Andreas Karrenbauer
Accelerated Bend Minimization. 635-650 - Michael J. Bannister, David Eppstein, Joseph A. Simons:
Inapproximability of Orthogonal Compaction. 651-673 - Giuseppe Di Battista
How to Visualize the K-root Name Server. 675-699 - Md. Jawaherul Alam, Therese Biedl, Stefan Felsner, Michael Kaufmann, Stephen G. Kobourov
Proportional Contact Representations of Planar Graphs. 701-728 - Markus Chimani, Carsten Gutwenger:
Advances in the Planarization Method: Effective Multiple Edge Insertions. 729-757 - Radoslav Fulek
Adjacent Crossings Do Matter. 759-782
Volume 16, Number 4, 2012
- Brett Stevens, Aaron Williams:
Hamilton Cycles in Restricted and Incomplete Rotator Graphs. 785-810 - Bart M. P. Jansen:
Kernelization for Maximum Leaf Spanning Tree with Positive Vertex Weights. 811-846 - Immanuel Halupczok, André Schulz:
Pinning balloons with perfect angles and optimal area. 847-870
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-11-22 19:34 CET 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: