-
DOI: 10.7155/jgaa.00195
Guest Editor's Foreword
Ioannis G. Tollis
and
Maurizio Patrignani
Vol. 14, no. 1, pp. 3-4, 2010.
-
DOI: 10.7155/jgaa.00196
Cubic graphs have bounded slope parameter
Balázs Keszegh
,
János Pach
,
Dömötör Pálvölgyi
, and
Géza Tóth
Vol. 14, no. 1, pp. 5-17, 2010.
Regular paper
-
DOI: 10.7155/jgaa.00197
An Algorithm to Construct Greedy Drawings of Triangulations
Patrizio Angelini
,
Fabrizio Frati
, and
Luca Grilli
Vol. 14, no. 1, pp. 19-51, 2010.
Regular paper
-
DOI: 10.7155/jgaa.00198
Efficient, Proximity-Preserving Node Overlap Removal
Emden Gansner
and
Yifan Hu
Vol. 14, no. 1, pp. 53-74, 2010.
Regular paper
-
DOI: 10.7155/jgaa.00199
On Metro-Line Crossing Minimization
Evmorfia Argyriou
,
Michael A. Bekos
,
Michael Kaufmann
, and
Antonios Symvonis
Vol. 14, no. 1, pp. 75-96, 2010.
Regular paper
-
DOI: 10.7155/jgaa.00200
Visual Analysis of One-To-Many Matched Graphs
Emilio Di Giacomo
,
Walter Didimo
,
Giuseppe Liotta
, and
Pietro Palladino
Vol. 14, no. 1, pp. 97-119, 2010.
Regular paper
|
-
DOI: 10.7155/jgaa.00201
New complexity results for time-constrained dynamical optimal path problems
Sebastian Kluge
,
Martin Brokate
, and
Konrad Reif
Vol. 14, no. 2, pp. 123-147, 2010.
Regular paper
-
DOI: 10.7155/jgaa.00202
Resource relocation on asymmetric networks
D. Jacob Wildstrom
Vol. 14, no. 2, pp. 149-163, 2010.
Regular paper
-
DOI: 10.7155/jgaa.00203
Computational Aspects of Lucidity-Driven Graph Clustering
Robert Görke
,
Marco Gaertler
,
Florian Hübner
, and
Dorothea Wagner
Vol. 14, no. 2, pp. 165-197, 2010.
Regular paper
-
DOI: 10.7155/jgaa.00204
Intersection Graphs of Pseudosegments: Chordal Graphs
Cornelia Dangelmayr
,
Stefan Felsner
, and
William T. Trotter
Vol. 14, no. 2, pp. 199-220, 2010.
Regular paper
-
DOI: 10.7155/jgaa.00205
A Graph Pebbling Algorithm on Weighted Graphs
Nandor Sieben
Vol. 14, no. 2, pp. 221-244, 2010.
Regular paper
-
DOI: 10.7155/jgaa.00206
Minimum-Layer Upward Drawings of Trees
Muhammad Jawaherul Alam
,
Md. Abul Hassan Samee
,
Mashfiqui Rabbi
, and
Md. Saidur Rahman
Vol. 14, no. 2, pp. 245-267, 2010.
Regular paper
-
DOI: 10.7155/jgaa.00207
On the Maximum Independent Set Problem in Subclasses of Planar Graphs
Vadim Lozin
and
Martin Milanič
Vol. 14, no. 2, pp. 269-286, 2010.
Regular paper
-
DOI: 10.7155/jgaa.00208
Computing All Best Swaps for Minimum-Stretch Tree Spanners
Shantanu Das
,
Beat Gfeller
, and
Peter Widmayer
Vol. 14, no. 2, pp. 287-306, 2010.
Regular paper
-
DOI: 10.7155/jgaa.00209
Finding the Most Relevant Fragments in Networks
Kevin Buchin
,
Sergio Cabello
,
Joachim Gudmundsson
,
Maarten Löffler
,
Jun Luo
,
Günter Rote
,
Rodrigo I. Silveira
,
Bettina Speckmann
, and
Thomas Wolle
Vol. 14, no. 2, pp. 307-336, 2010.
Regular paper
-
DOI: 10.7155/jgaa.00210
Applications of Parameterized st-Orientations
Charalampos Papamanthou
and
Ioannis G. Tollis
Vol. 14, no. 2, pp. 337-365, 2010.
Regular paper
-
DOI: 10.7155/jgaa.00211
Acyclic Orientation of Drawings
Eyal Ackerman
,
Kevin Buchin
,
Christian Knauer
, and
Günter Rote
Vol. 14, no. 2, pp. 367-384, 2010.
Regular paper
-
DOI: 10.7155/jgaa.00212
A Linear-Time Approximation Algorithm for Rotation Distance
Sean Cleary
and
Katherine St. John
Vol. 14, no. 2, pp. 385-390, 2010.
Concise paper
-
DOI: 10.7155/jgaa.00213
A Fast Algorithm for Computing a Nearly Equitable Edge Coloring with Balanced Conditions
Akiyoshi Shioura
and
Mutsunori Yagiura
Vol. 14, no. 2, pp. 391-407, 2010.
Regular paper
|