Vol. 14 No. 2 (2010)

Published: 2010-01-01

New complexity results for time-constrained dynamical optimal path problems

Sebastian Kluge, Martin Brokate, Konrad Reif

123-147
- article (PDF)
Resource relocation on asymmetric networks

D. Jacob Wildstrom

149-163
- article (PDF)
Computational Aspects of Lucidity-Driven Graph Clustering

Robert Görke, Marco Gaertler, Florian Hübner, Dorothea Wagner

165-197
- article (PDF)
Intersection Graphs of Pseudosegments: Chordal Graphs

Cornelia Dangelmayr, Stefan Felsner, William Trotter

199-220
- article (PDF)
A Graph Pebbling Algorithm on Weighted Graphs

Nandor Sieben

221-244
- article (PDF)
Minimum-Layer Upward Drawings of Trees

Muhammad Jawaherul Alam, Md. Abul Hassan Samee, Mashfiqui Rabbi, Md. Saidur Rahman

245-267
- article (PDF)
On the Maximum Independent Set Problem in Subclasses of Planar Graphs

Vadim Lozin, Martin Milanič

269-286
- article (PDF)
Computing All Best Swaps for Minimum-Stretch Tree Spanners

Shantanu Das, Beat Gfeller, Peter Widmayer

287-306
- article (PDF)
Finding the Most Relevant Fragments in Networks

Kevin Buchin, Sergio Cabello, Joachim Gudmundsson, Maarten Löffler, Jun Luo, Günter Rote, Rodrigo Silveira, Bettina Speckmann, Thomas Wolle

307-336
- article (PDF)
Applications of Parameterized st-Orientations

Charalampos Papamanthou, Ioannis Tollis

337-365
- article (PDF)
Acyclic Orientation of Drawings

Eyal Ackerman, Kevin Buchin, Christian Knauer, Günter Rote

367-384
- article (PDF)
A Linear-Time Approximation Algorithm for Rotation Distance

Sean Cleary, Katherine St. John

385-390
- article (PDF)
A Fast Algorithm for Computing a Nearly Equitable Edge Coloring with Balanced Conditions

Akiyoshi Shioura, Mutsunori Yagiura

391-407
- article (PDF)