default search action
Journal of Graph Algorithms and Applications, Volume 14
Volume 14, Number 1, 2010
- Balázs Keszegh, János Pach, Dömötör Pálvölgyi, Géza Tóth:
Cubic graphs have bounded slope parameter. 5-17 - Patrizio Angelini, Fabrizio Frati, Luca Grilli:
An Algorithm to Construct Greedy Drawings of Triangulations. 19-51 - Evmorfia N. Argyriou, Michael A. Bekos, Michael Kaufmann, Antonios Symvonis:
On Metro-Line Crossing Minimization. 75-96 - Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Pietro Palladino:
Visual Analysis of One-To-Many Matched Graphs. 97-119
Volume 14, Number 2, 2010
- Sebastian Kluge, Martin Brokate, Konrad Reif:
New complexity results for time-constrained dynamical optimal path problems. 123-147 - Robert Görke, Marco Gaertler, Florian Hübner, Dorothea Wagner:
Computational Aspects of Lucidity-Driven Graph Clustering. 165-197 - Cornelia Dangelmayr, Stefan Felsner, William T. Trotter:
Intersection Graphs of Pseudosegments: Chordal Graphs. 199-220 - Muhammad Jawaherul Alam, Md. Abul Hassan Samee, Mashfiqui Rabbi, Md. Saidur Rahman:
Minimum-Layer Upward Drawings of Trees. 245-267 - Vadim V. Lozin, Martin Milanic:
On the Maximum Independent Set Problem in Subclasses of Planar Graphs. 269-286 - Shantanu Das, Beat Gfeller, Peter Widmayer:
Computing All Best Swaps for Minimum-Stretch Tree Spanners. 287-306 - Kevin Buchin, Sergio Cabello, Joachim Gudmundsson, Maarten Löffler, Jun Luo, Günter Rote, Rodrigo I. Silveira, Bettina Speckmann, Thomas Wolle:
Finding the Most Relevant Fragments in Networks. 307-336 - Eyal Ackerman, Kevin Buchin, Christian Knauer, Günter Rote:
Acyclic Orientation of Drawings. 367-384 - Sean Cleary, Katherine St. John:
A Linear-Time Approximation Algorithm for Rotation Distance. 385-390 - Akiyoshi Shioura, Mutsunori Yagiura:
A Fast Algorithm for Computing a Nearly Equitable Edge Coloring with Balanced Conditions. 391-407
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2015-03-06 02:50 CET by the dblp team