default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Graph Algorithms and Applications, Volume 18
Volume 18, Number 1, 2014
- Zhentao Li, Manikandan Narayanan
, Adrian Vetta:
The Complexity of the Simultaneous Cluster Problem. 1-34 - Edith Brunel, Andreas Gemsa, Marcus Krug, Ignaz Rutter, Dorothea Wagner:
Generalizing Geometric Graphs. 35-76 - Yifan Hu, Stephen G. Kobourov, Sankar Veeramoni:
Embedding, Clustering and Coloring for Dynamic Maps. 77-109 - Till Bruckdorfer, Michael Kaufmann, Fabrizio Montecchiani:
1-Bend Orthogonal Partial Edge Drawing. 111-131 - Md. Shafiul Alam, Asish Mukhopadhyay:
More on Generalized Jewels and the Point Placement Problem. 133-173
Volume 18, Number 2, 2014
- Stephen K. Wismath, Alexander Wolff:
Guest Editors' Foreword. 174-175 - Michael J. Bannister, Zhanpeng Cheng, William E. Devanny, David Eppstein:
Superpatterns and Universal Point Sets. 177-209 - David Eppstein:
Drawing Arrangement Graphs In Small Grids, Or How To Play Planarity. 211-231 - Stefan Felsner:
Exploiting Air-Pressure to Map Floorplans on Point Sets. 233-252 - Fabrizio Frati, Michael Kaufmann, János Pach, Csaba D. Tóth, David R. Wood:
On the Upward Planarity of Mixed Plane Graphs. 253-279 - Helen C. Purchase:
A healthy critical attitude: Revisiting the results of a graph drawing study. 281-311
Volume 18, Number 3, 2014
- Patrizio Angelini, David Eppstein, Fabrizio Frati, Michael Kaufmann, Sylvain Lazard, Tamara Mchedlidze, Monique Teillaud, Alexander Wolff:
Universal Point Sets for Drawing Planar Graphs with Circular Arcs. 313-324 - Carola Doerr, G. Ramakrishna, Jens M. Schmidt:
Computing Minimum Cycle Bases in Weighted Partial 2-Trees in Linear Time. 325-346 - Marina Groshaus, Francisco J. Soulignac, Pablo Terlisky:
Star and Biclique Coloring and Choosability. 347-383 - Céline Scornavacca, Leo van Iersel, Steven Kelk, David Bryant:
The agreement problem for unrooted phylogenetic trees is FPT. 385-392 - Ruy Fabila Monroy, Jorge López:
Computational search of small point sets with small rectilinear crossing number. 393-399 - Karin Arikushi, Csaba D. Tóth:
Crossing Angles of Geometric Graphs. 401-420 - Franz J. Brandenburg:
1-Visibility Representations of 1-Planar Graphs. 421-438 - Dániel Gerbner, Viola Mészáros, Dömötör Pálvölgyi, Alexey Pokrovskiy, Günter Rote:
Advantage in the discrete Voronoi game. 439-457 - Michael A. Bekos, Michael Kaufmann, Robert Krug, Thorsten Ludwig, Stefan Näher, Vincenzo Roselli:
Slanted Orthogonal Drawings: Model, Algorithms and Evaluations. 459-489
Volume 18, Number 4, 2014
- Sudebkumar Prasant Pal, Kunihiko Sadakane:
Guest Editors' Foreword. 491-492 - Bhawani Sankar Panda, Arti Pandey:
Algorithm and Hardness Results for Outer-connected Dominating Set in Graphs. 493-513 - Alejandro López-Ortiz, Jazmín Romero:
Parameterized Algorithms for the H-Packing with t-Overlap Problem. 515-538 - Yuya Higashikawa, Mordecai J. Golin, Naoki Katoh:
Minimax Regret Sink Location Problem in Dynamic Tree Networks with Uniform Capacity. 539-555 - Peter Damaschke, Olof Mogren:
Editing Simple Graphs. 557-576 - Nils M. Kriege, Petra Mutzel, Till Schäfer:
Practical SAHN Clustering for Very Large Data Sets and Expensive Distance Metrics. 577-602 - Jiong Guo, Yash Raj Shrestha:
Complexity of Disjoint Π-Vertex Deletion for Disconnected Forbidden Subgraphs. 603-631
Volume 18, Number 5, 2014
- Fabrizio Frati:
Multilayer Drawings of Clustered Graphs. 633-675 - Gregor Betz, Andreas Gemsa, Christof Mathies, Ignaz Rutter, Dorothea Wagner:
Column-Based Graph Layouts. 677-708 - David Pokrass Jacobs, Vilmar Trevisan, Fernando Tura:
Computing the Characteristic Polynomial of Threshold Graphs. 709-719 - William S. Evans, Michael Kaufmann, William J. Lenhart, Tamara Mchedlidze, Stephen K. Wismath:
Bar 1-Visibility Graphs vs. other Nearly Planar Graphs. 721-739
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-18 20:35 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:
