default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Graph Algorithms and Applications, Volume 21
Volume 21, Number 1, 2017
- Emilio Di Giacomo, Anna Lubiw:
Guest Editors' Foreword. 1-3 - Björn Zimmer, Andreas Kerren:
OnGraX: A Web-Based System for the Collaborative Visual Analysis of Graphs. 5-27 - Peter Eades, Seok-Hee Hong, An Nguyen, Karsten Klein:
Shape-Based Quality Metrics for Large Graph Visualization. 29-53 - Tarik Crnovrsanin, Jacqueline Chu, Kwan-Liu Ma:
An Incremental Layout Method for Visualizing Online Dynamic Graphs. 55-80 - Carla Binucci
, Markus Chimani, Walter Didimo, Martin Gronemann, Karsten Klein, Jan Kratochvíl, Fabrizio Montecchiani, Ioannis G. Tollis:
Algorithms and Characterizations for 2-Layer Fan-planarity: From Caterpillar to Stegosaurus. 81-102 - David Auber, Nicolas Bonichon, Paul Dorbec, Claire Pennarun:
Rook-drawings of Plane Graphs. 103-120 - Vida Dujmovic:
The Utility of Untangling. 121-134 - Radoslav Fulek, Michael J. Pelsmajer, Marcus Schaefer:
Hanani-Tutte for Radial Planarity. 135-154
Volume 21, Number 2, 2017
- Xin He, Dayu He:
Star-Shaped and L-Shaped Orthogonal Drawings. 155-175 - Pavlos Eirinakis, Matthew D. Williamson, K. Subramani:
On the Shoshan-Zwick Algorithm for the All-Pairs Shortest Path Problem. 177-181 - Udo Hoffmann:
On the Complexity of the Planar Slope Number Problem. 183-193 - Sivan Altinakar, Gilles Caporossi, Alain Hertz:
Symmetry Breaking Constraints for the Minimum Deficiency Problem. 195-218 - Bart M. P. Jansen:
On Structural Parameterizations of Hitting Set: Hitting Paths in Graphs Using 2-SAT. 219-243
Volume 21, Number 3, 2017
- Mohammad Kaykobad, Rossella Petreschi:
Guest Editors' Foreword. 245-246 - Morito Oomine, Aleksandar Shurbevski, Hiroshi Nagamochi:
Parameterization of Strategy-Proof Mechanisms in the Obnoxious Facility Game. 247-263 - Barun Gorain, Partha Sarathi Mandal, Krishnendu Mukhopadhyaya:
Generalized Bounded Tree Cover of a Graph. 265-280 - Franz J. Brandenburg, Alexander Esch, Daniel Neuwirth:
On Aligned Bar 1-Visibility Graphs. 281-312 - Patrizio Angelini, Michael A. Bekos, Felice De Luca, Walter Didimo, Michael Kaufmann, Stephen G. Kobourov, Fabrizio Montecchiani, Chrysanthi N. Raftopoulou, Vincenzo Roselli, Antonios Symvonis:
Vertex-Coloring with Defects. 313-340 - Md. Iqbal Hossain, Sammi Abida Salma, Md. Saidur Rahman, Debajyoti Mondal:
A Necessary Condition and a Sufficient Condition for Pairwise Compatibility Graphs. 341-352 - Devsi Bantva:
Hamiltonian chromatic number of block graphs. 353-369 - Aditya Kumar Akash, Sándor P. Fekete, Seoung Kyou Lee, Alejandro López-Ortiz, Daniela Maftuleac, James McLurkin:
Lower Bounds for Graph Exploration Using Local Policies. 371-387
Volume 21, Number 4, 2017
- Prosenjit Bose, Jean-Lou De Carufel, Alina Shaikhet, Michiel H. M. Smid:
Essential Constraints of Edge-Constrained Proximity Graphs. 389-415 - Konrad Engel, Thomas Kalinowski, Martin W. P. Savelsbergh:
Incremental Network Design with Minimum Spanning Trees. 417-432 - Stephane Durocher, Debajyoti Mondal:
Drawing Planar Graphs with Reduced Height. 433-453 - Francisco J. Soulignac:
Bounded, minimal, and short representations of unit interval and unit circular-arc graphs. Chapter I: theory. 455-489 - Francisco J. Soulignac:
Bounded, minimal, and short representations of unit interval and unit circular-arc graphs. Chapter II: algorithms. 491-525 - Ahmad Biniaz, Prosenjit Bose, Ingo van Duijn, Anil Maheshwari, Michiel H. M. Smid:
Faster Algorithms for the Minimum Red-Blue-Purple Spanning Graph Problem. 527-546 - Max Ward, Andrew Gozzard, Amitava Datta:
A Maximum Weight Clique Algorithm For Dense Circle Graphs With Many Shared Endpoints. 547-554 - Radoslaw Cymer:
A Note on the Existence of All (g, f)-Factors. 555-560 - Alexander Igamberdiev, Wouter Meulemans, André Schulz:
Drawing Planar Cubic 3-Connected Graphs with Few Segments: Algorithms & Experiments. 561-588 - Ala Abuthawabeh, Dirk Zeckzer:
Topological Decomposition of Directed Graphs. 589-630 - Therese Biedl:
Ideal Drawings of Rooted Trees With Approximately Optimal Width. 631-648 - James A. Tilley:
D-resolvability of vertices in planar graphs. 649-661 - David Eppstein, J. Michael McCarthy, Brian E. Parrish:
Rooted Cycle Bases. 663-686 - Glencora Borradaile, Jennifer Iglesias, Theresa Migler, Antonio Ochoa, Gordon T. Wilfong, Lisa Zhang:
Egalitarian Graph Orientations. 687-708 - Michael A. Bekos, Michael Kaufmann, Robert Krug:
On the Total Number of Bends for Planar Octilinear Drawings. 709-730 - Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Ignaz Rutter:
Intersection-Link Representations of Graphs. 731-755 - Till Bruckdorfer, Sabine Cornelsen, Carsten Gutwenger, Michael Kaufmann, Fabrizio Montecchiani, Martin Nöllenburg, Alexander Wolff:
Progress on Partial Edge Drawings. 757-786
Volume 21, Number 5, 2017
- Yifan Hu, Martin Nöllenburg:
Guest editors' foreword. 787-789 - Mark Ortmann, Mirza Klimenta, Ulrik Brandes:
A Sparse Stress Model. 791-821 - Ulf Rüegg, Thorsten Ehlers, Miro Spönemann, Reinhard von Hanxleden:
Generalized Layerings for Arbitrary and Fixed Drawing Areas. 823-856 - Lev Nachmanson, Arlind Nocaj, Sergey Bereg, Leishi Zhang, Alexander E. Holroyd:
Node Overlap Removal by Growing a Tree. 857-872 - Thomas C. van Dijk, Martin Fink, Norbert Fischer, Fabian Lipp, Peter Markfelder, Alexander Ravsky, Subhash Suri, Alexander Wolff:
Block Crossings in Storyline Visualizations. 873-913 - Therese Biedl, Claire Pennarun:
Non-aligned Drawings of Planar Graphs. 915-937 - Éric Colin de Verdière, Vojtech Kaluza, Pavel Paták, Zuzana Patáková, Martin Tancer:
A Direct Proof of the Strong Hanani-Tutte Theorem on the Projective Plane. 939-981
Volume 21, Number 6, 2017
- Luis Barba, William S. Evans, Michael Hoffmann, Vincent Kusters, Maria Saumell, Bettina Speckmann:
Column planarity and partially-simultaneous geometric embedding. 983-1002 - Prabhav Kalaghatgi, Thomas Lengauer:
Computing phylogenetic trees using topologically related minimum spanning trees. 1003-1025 - Daniel Sumner Magruder, Stefan Bonn:
Root demotion: efficient post-processing of layered graphs to reduce dummy vertices for hierarchical graph drawing. 1027-1038 - Florent Foucaud, Ralf Klasing:
Parameterized and approximation complexity of the detection pair problem in graphs. 1039-1056 - Jan Christoph Athenstädt, Sabine Cornelsen:
Planarity of Overlapping Clusterings Including Unions of Two Partitions. 1057-1089 - Rémi de Joannis de Verclos, Jean-Sébastien Sereni:
Equitable colorings of $K_4$-minor-free graphs. 1091-1105 - Leah Wrenn Berman, Glenn G. Chappell, Jill R. Faudree, John Gimbel, Chris Hartman, Gordon I. Williams:
Graphs with Obstacle Number Greater than One. 1107-1119
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 2025-12-09 23:41 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:
