Skip to main content
Skip to main navigation menu
Skip to site footer
Open Menu
Current
Archives
Announcements
About
About the Journal
Submissions
Editorial Team
Executive Committee
Advisory Board
Privacy Statement
Contact
Search
Register
Login
Home
/
Archives
/
Vol. 10 No. 2 (2006)
Vol. 10 No. 2 (2006)
Published:
2006-01-01
Collective Tree Spanners and Routing in AT-free Related Graphs
Feodor Dragan, Chenyu Yan, Derek Corneil
97-122
article (PDF)
A Factor-Two Approximation Algorithm for Two-Dimensional Phase Unwrapping
Reuven Bar-Yehuda, Irad Yavneh
123-139
article (PDF)
Orthogonal Hypergraph Drawing for Improved Visibility
Thomas Eschbach, Wolfgang Guenther, Bernd Becker
141-157
article (PDF)
A Survey of the Algorithmic Properties of Simplicial, Upper Bound and Middle Graphs
Grant Cheston, Tjoen Seng Jap
159-190
article (PDF)
Computing Communities in Large Networks Using Random Walks
Pascal Pons, Matthieu Latapy
191-218
article (PDF)
Algorithms and Experiments for the Webgraph
Debora Donato, Luigi Laura, Stefano Leonardi, Ulrich Meyer, Stefano Millozzi, Jop Sibeyn
219-236
article (PDF)
A Multilevel Algorithm for the Minimum 2-sum Problem
Ilya Safro, Dorit Ron, Achi Brandt
237-258
article (PDF)
Upward Planar Drawings and Switch-regularity Heuristics
Walter Didimo
259-285
article (PDF)
Drawing Kn in Three Dimensions with One Bend per Edge
Olivier Devillers, Hazel Everett, Sylvain Lazard, Maria Pentcheva, Stephen Wismath
287-295
article (PDF)
On the approximation of Min Split-coloring and Min Cocoloring
Marc Demange, Tinaz Ekim, Dominique de Werra
297-315
article (PDF)
NP-completeness of the Planar Separator Problems
Junichiro Fukuyama
317-328
article (PDF)
Efficient drawing of RNA secondary structure
David Auber, Maylis Delest, Jean-Philippe Domenger, Serge Dulucq
329-351
article (PDF)
Planar embeddability of the vertices of a graph using a fixed point set is NP-hard
Sergio Cabello
353-363
article (PDF)
Small Stretch Spanners on Dynamic Graphs
Giorgio Ausiello, Paolo Franciosa, Giuseppe Italiano
365-385
article (PDF)
A New Algorithm for Finding Minimal Cycle-Breaking Sets of Turns in a Graph
Lev Levitin, Mark Karpovsky, Mehmet Mustafa, Lev Zakrevski
387-420
article (PDF)
Make a Submission
Make a Submission
Information
For Readers
For Authors
For Librarians
Browse
Categories
Regular
Concise
Survey
Current Issue