Volume 2, 1998
-
Algorithms for Cluster Busting
in Anchored Graph Drawing
Kelly
A. Lyons, Henk
Meijer and David
Rappaport
Vol. 2, no. 1, pp. 1-24,
1998.
Submitted: April 1996. Revised: March 1998.
Communicated by Giuseppe Di
Battista.
-
A Broadcasting Algorithm with
Time and Message Optimum on Arrangement
Graphs
Leqiang
Bai, Hajime
Maeda, Hiroyuki
Ebara and Hideo
Nakano
Vol. 2, no. 2, pp. 1-17,
1998.
Submitted: June 1996. Revised: May 1998.
Communicated by Alon
Itai.
-
A Visibility Representation for
Graphs in Three Dimensions
Prosenjit Bose , Hazel
Everett, Sándor
P. Fekete, Michael
E. Houle, Anna
Lubiw, Henk
Meijer, Kathleen Romanik,
Günter Rote, Thomas
C. Shermer, Sue
Whitesides, and Christian
Zelle
Vol. 2, no. 3, pp. 1-16, 1998.
Submitted: February 1996. Revised: February 1997.
Communicated by Michael
T. Goodrich.
-
Scheduled Hot-Potato Routing
Joseph (Seffi) Naor,
Ariel Orda,
and
Raphael
Rom
Vol. 2, no. 4, pp. 1-20, 1998.
Submitted: November 1996. Revised: November 1997.
Communicated by Samir Khuller.
-
Treewidth and Minimum Fill-in on d-Trapezoid Graphs
Hans L. Bodlaender,
Ton Kloks,
Dieter Kratsch
and
Haiko Müller
Vol. 2, no. 5, pp. 1-23, 1998.
Submitted: August 1996. Revised: March 1998.
Communicated by Samir Khuller.
-
Memory Paging for Connectivity
and Path Problems in Graphs
Esteban Feuerstein and Alberto
Marchetti-Spaccamela
Vol. 2, no. 6, pp. 1-22, 1998.
Submitted: October 1994. Revised: September 1998.
Communicated by Roberto Tamassia.
-
New Lower Bounds For Orthogonal
Drawings
Therese
C. Biedl
Vol. 2, no. 7, pp. 1-31, 1998.
Submitted: July 1997. Revised: November 1998.
Communicated
by Dorothea
Wagner.
-
Rectangle-visibility Layouts of Unions and Products of Trees
Alice M.
Dean
and
Joan P.
Hutchinson
Vol. 2, no. 8, pp. 1-21, 1998.
Submitted: January 1998. Revised: September 1998.
Communicated
by Joseph S. B. Mitchell.
|
