default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Graph Algorithms and Applications, Volume 17
Volume 17, Number 1, 2013
- Ulrik Brandes, Barbara Pampel:
Orthogonal-Ordering Constraints are Tough. 1-10 - Evmorfia N. Argyriou, Michael A. Bekos
, Michael Kaufmann, Antonios Symvonis:
Geometric RAC Simultaneous Drawings of Graphs. 11-34 - David Eppstein:
The Complexity of Bendless Three-Dimensional Orthogonal Graph Drawing. 35-55
Volume 17, Number 2, 2013
- Shin-Ichi Nakano:
Guest Editor's Foreword. 57-58 - Md. Iqbal Hossain, Debajyoti Mondal, Md. Saidur Rahman, Sammi Abida Salma:
Universal Line-Sets for Drawing Planar 3-Trees. 59-79 - Sammi Abida Salma, Md. Saidur Rahman, Md. Iqbal Hossain:
Triangle-Free Outerplanar 3-Graphs are Pairwise Compatibility Graphs. 81-102 - Christian Bachmaier, Marco Matzeder:
Drawing Unordered Trees on k-Grids. 103-128 - R. Krithika, N. S. Narayanaswamy:
Parameterized Algorithms for (r, l)-Partization. 129-146
Volume 17, Number 3, 2013
- Bernhard Haeupler, Krishnam Raju Jampani, Anna Lubiw:
Testing Simultaneous Planarity when the Common Graph is 2-Connected. 147-171 - David Eppstein, Maarten Löffler, Elena Mumford, Martin Nöllenburg:
Optimal 3D Angular Resolution for Low-Degree Graphs. 173-200 - Erin W. Chambers, David Eppstein:
Flows in One-Crossing-Minor-Free Graphs. 201-220 - Fabrizio Frati, Radoslav Fulek, Andres J. Ruiz-Vargas:
On the Page Number of Upward Planar Directed Acyclic Graphs. 221-244 - Peng Li, Yaokun Wu:
Maximal Neighborhood Search and Rigid Interval Graphs. 245-264 - Reinhard Bauer, Moritz Baum, Ignaz Rutter, Dorothea Wagner:
On the Complexity of Partitioning Graphs for Arc-Flags. 265-299 - Stephane Durocher, Debajyoti Mondal, Rahnuma Islam Nishat, Sue Whitesides:
A Note on Minimum-Segment Drawings of Planar Graphs. 301-328 - Markus Chimani, Philipp Hungerländer:
Multi-level Verticality Optimization: Concept, Strategies, and Drawing Scheme. 329-362
Volume 17, Number 4, 2013
- Walter Didimo, Maurizio Patrignani:
Guest Editors' Foreword. 363-365 - Marcus Schaefer:
Toward a Theory of Planarity: Hanani-Tutte and Planarity Variants. 367-440 - Martin Nöllenburg, Roman Prutkin, Ignaz Rutter:
Edge-weighted contact representations of planar graphs. 441-473 - Steven Chaplick, Torsten Ueckerdt:
Planar Graphs as VPG-Graphs. 475-494 - Till Tantau:
Graph Drawing in TikZ. 495-513 - Emden R. Gansner, Yifan Hu, Stephen C. North:
Interactive Visualization of Streaming Text Data with Dynamic Maps. 515-540 - Christopher Auer, Christian Bachmaier, Franz J. Brandenburg, Andreas Gleißner, Josef Reislhuber:
Optical Graph Recognition. 541-565
Volume 17, Number 5, 2013
- Atish Das Sarma, Amita Gajewar, Richard J. Lipton, Danupon Nanongkai:
An Approximate Restatement of the Four-Color Theorem. 567-573 - Michael A. Bekos, Michael Kaufmann, Stephen G. Kobourov, Antonios Symvonis:
Smooth Orthogonal Layouts. 575-595
Volume 17, Number 6, 2013
- Subir Kumar Ghosh:
Guest Editor's Foreword. 597-598 - Martin Olsen, Morten Revsbæk:
On Alliance Partitions and Bisection Width for Planar Graphs. 599-614 - Venkatesh Raman, Saket Saurabh, Ondrej Suchý:
An FPT algorithm for Tree Deletion Set. 615-628 - Md. Manzurul Hasan, Md. Saidur Rahman, Muhammad Rezaul Karim:
Box-Rectangular Drawings of Planar Graphs. 629-646 - Tobias Brunsch, Kamiel Cornelissen, Bodo Manthey, Heiko Röglin:
Smoothed Analysis of Belief Propagation for Minimum-Cost Flow and Matching. 647-670 - Tapas Kumar Mishra, Sudebkumar Prasant Pal:
Lower bounds for Ramsey numbers for complete bipartite and 3-uniform tripartite subgraphs. 671-688
Volume 17, Number 7, 2013
- David Eppstein, Joseph A. Simons:
Confluent Hasse Diagrams. 689-710
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-04 20:45 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:
