default search action
Journal of Graph Algorithms and Applications, Volume 23
Volume 23, Number 1, 2019
- Md. Saidur Rahman, Hsu-Chun Yen, Sheung-Hung Poon:
Guest Editors' Foreword. 1-2 - Katsuhisa Yamanaka, Erik D. Demaine, Takashi Horiyama, Akitoshi Kawamura, Shin-Ichi Nakano, Yoshio Okamoto, Toshiki Saitoh
, Akira Suzuki, Ryuhei Uehara
Sequentially Swapping Colored Tokens on Graphs. 3-27 - Jun Kawahara, Toshiki Saitoh
The Time Complexity of Permutation Routing via Matching, Token Swapping and a Variant. 29-70 - Felice De Luca, Emilio Di Giacomo, Walter Didimo, Stephen G. Kobourov, Giuseppe Liotta:
An Experimental Study on the Ply Number of Straight-line Drawings. 71-91 - Yuko Kuroki, Tomomi Matsui:
Approximation Algorithm for Cycle-Star Hub Network Design Problems and Cycle-Metric Labeling Problems. 93-110
Volume 23, Number 2, 2019
- Rémy Belmonte, Mehdi Khosravian Ghadikolaei
How Bad is the Freedom to Flood-It? 111-134 - Kieran Clancy
An effective crossing minimisation heuristic based on star insertion. 135-166 - Jean Cardinal, Jean-Paul Doignon, Keno Merckx:
Finding a Maximum-Weight Convex Set in a Chordal Graph. 167-190 - Farah Chanchary, Anil Maheshwari:
Time Windowed Data Structures for Graphs. 191-226 - Zoë Bukovac, Graham Farr, Kerri Morgan
Short certificates for chromatic equivalence. 227-269 - Riccardo Dondi, Giancarlo Mauri
Covering a Graph with Clubs. 271-292 - Anuj Dawar
Constructing Hard Examples for Graph Isomorphism. 293-316 - Juli Atherton, Derek Ruths, Adrian Vetta:
Computation in Causal Graphs. 317-344 - Anna Lubiw, Debajyoti Mondal:
Construction and Local Routing for Angle-Monotone Graphs. 345-369 - Myroslav Kryven
Drawing Graphs on Few Circles and Few Spheres. 371-391 - Victor Chepoi
Fast approximation of eccentricities and distances in hyperbolic graphs. 393-433 - Kazuya Haraguchi
COOMA: A Components Overlaid Mining Algorithm for Enumerating Connected Subgraphs with Common Itemsets. 434-458
Volume 23, Number 3, 2019
- Therese Biedl, Andreas Kerren:
Guest Editors' Foreword. 459-461 - Thom Castermans, Mereke van Garderen, Wouter Meulemans, Martin Nöllenburg, Xiaoru Yuan:
Short Plane Supports for Spatial Hypergraphs. 463-498 - Michael Jünger, Petra Mutzel
A Flow Formulation for Horizontal Coordinate Assignment with Prescribed Width. 499-524 - Tamara Mchedlidze
Aesthetic Discrimination of Graph Layouts. 525-552 - Giacomo Ortali, Ioannis G. Tollis:
A New Framework for Hierarchical Drawings. 553-578 - Elena Arseneva, Prosenjit Bose, Pilar Cano, Anthony D'Angelo, Vida Dujmovic, Fabrizio Frati
Pole Dancing: 3D Morphs for Tree Drawings. 579-602
Volume 23, Number 4, 2019
- Rutger Kraaijer, Marc J. van Kreveld
Geometry and Generation of a New Graph Planarity Game. 603-624 - Glencora Borradaile, Theresa Migler, Gordon T. Wilfong:
Density decompositions of networks. 625-651 - Thomas Bläsius
How to Draw a Planarization. 653-682 - Fabrizio Frati
Simultaneous Embeddings with Few Bends and Crossings. 683-713 - Remie Janssen
Treewidth of display graphs: bounds, brambles and applications. 715-743
Volume 23, Number 5, 2019
- M. Sohel Rahman, Wing-Kin Sung, Ryuhei Uehara
Guest Editors' Foreword. 755-757 - Toshihiro Fujito, Kei Kimura, Yuki Mizuno:
Approximating Partially Bounded Degree Deletion on Directed Graphs. 759-780 - Manas Jyoti Kashyop, Tsunehiko Nagayama, Kunihiko Sadakane:
Faster algorithms for shortest path and network flow based on graph decomposition. 781-813 - Suthee Ruangwises
Random Popular Matchings with Incomplete Preference Lists. 815-835 - Shin-Ichi Nakano:
A Simple Algorithm for r-gatherings on the Line. 837-845
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-12-01 00:02 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: