CiteSeer.IST Home   Check: The following citations are predicted to all refer to the same paper.   Details

T. Biedl, J. Marks, K. Ryall, and S. Whitesides. Graph multidrawing: Finding nice drawings without defining nice. In this volume.

T. Biedl, J. Marks, K. Ryall, and S. Whitesides. Graph multidrawing: Finding nice drawings without defining nice. In S. Whitesides, editor, Graph Drawing (Proc. GD '98), volume 1547 of Lecture Notes Cornput. Sci., pages 347 355. Springer-Verlag, 1998.

T. Biedl, J. Marks, K. Ryall, and S. Whitesides. Graph multidrawing: Finding nice drawings without de ning nice. Proc. Graph Drawing'98, LNCS 1547 (1998), 347-355.

T. Biedl, J. Marks, K. Ryall, and S. Whitesides. Graph multidrawing: Finding nice drawings without defining nice. In this volume.

CiteSeer.IST - Copyright Penn State and NEC