-
DOI: 10.7155/jgaa.00120
Collective Tree Spanners and Routing in AT-free Related Graphs
Feodor F. Dragan
,
Chenyu Yan
, and
Derek G. Corneil
Vol. 10, no. 2, pp. 97-122, 2006.
Regular paper
-
DOI: 10.7155/jgaa.00121
A Factor-Two Approximation Algorithm for Two-Dimensional Phase Unwrapping
Reuven Bar-Yehuda
and
Irad Yavneh
Vol. 10, no. 2, pp. 123-139, 2006.
Regular paper
-
DOI: 10.7155/jgaa.00122
Orthogonal Hypergraph Drawing for Improved Visibility
Thomas Eschbach
,
Wolfgang Guenther
, and
Bernd Becker
Vol. 10, no. 2, pp. 141-157, 2006.
Regular paper
-
DOI: 10.7155/jgaa.00123
A Survey of the Algorithmic Properties of Simplicial, Upper Bound and Middle Graphs
Grant A. Cheston
and
Tjoen Seng Jap
Vol. 10, no. 2, pp. 159-190, 2006.
Survey paper
-
DOI: 10.7155/jgaa.00124
Computing Communities in Large Networks Using Random Walks
Pascal Pons
and
Matthieu Latapy
Vol. 10, no. 2, pp. 191-218, 2006.
Regular paper
-
DOI: 10.7155/jgaa.00125
Algorithms and Experiments for the Webgraph
Debora Donato
,
Luigi Laura
,
Stefano Leonardi
,
Ulrich Meyer
,
Stefano Millozzi
, and
Jop F. Sibeyn
Vol. 10, no. 2, pp. 219-236, 2006.
Regular paper
-
DOI: 10.7155/jgaa.00126
A Multilevel Algorithm for the Minimum 2-sum Problem
Ilya Safro
,
Dorit Ron
, and
Achi Brandt
Vol. 10, no. 2, pp. 237-258, 2006.
Regular paper
-
DOI: 10.7155/jgaa.00127
Upward Planar Drawings and Switch-regularity Heuristics
Walter Didimo
Vol. 10, no. 2, pp. 259-285, 2006.
Regular paper
-
DOI: 10.7155/jgaa.00128
Drawing Kn in Three Dimensions with One Bend per Edge
Olivier Devillers
,
Hazel Everett
,
Sylvain Lazard
,
Maria Pentcheva
, and
Stephen Wismath
Vol. 10, no. 2, pp. 287-295, 2006.
Concise paper
-
DOI: 10.7155/jgaa.00129
On the approximation of Min Split-coloring and Min Cocoloring
Marc Demange
,
Tinaz Ekim
, and
Dominique de Werra
Vol. 10, no. 2, pp. 297-315, 2006.
Regular paper
-
DOI: 10.7155/jgaa.00130
NP-completeness of the Planar Separator Problems
Junichiro Fukuyama
Vol. 10, no. 2, pp. 317-328, 2006.
Regular paper
-
DOI: 10.7155/jgaa.00131
Efficient drawing of RNA secondary structure
David Auber
,
Maylis Delest
,
Jean-Philippe Domenger
, and
Serge Dulucq
Vol. 10, no. 2, pp. 329-351, 2006.
Regular paper
-
DOI: 10.7155/jgaa.00132
Planar embeddability of the vertices of a graph using a fixed point set is NP-hard
Sergio Cabello
Vol. 10, no. 2, pp. 353-363, 2006.
Regular paper
-
DOI: 10.7155/jgaa.00133
Small Stretch Spanners on Dynamic Graphs
Giorgio Ausiello
,
Paolo G. Franciosa
, and
Giuseppe F. Italiano
Vol. 10, no. 2, pp. 365-385, 2006.
Regular paper
-
DOI: 10.7155/jgaa.00134
A New Algorithm for Finding Minimal Cycle-Breaking Sets of Turns in a Graph
Lev Levitin
,
Mark Karpovsky
,
Mehmet Mustafa
, and
Lev Zakrevski
Vol. 10, no. 2, pp. 387-420, 2006.
Regular paper
|