Browse by Classification

Frati, Fabrizio and Patrignani, Maurizio (2008) A Note on Minimum-Area Straight-line Drawings of Planar Graphs. [Conference Paper]

Krug, Marcus and Wagner, Dorothea (2008) Minimizing the Area for Planar Straight-Line Grid Drawings. [Conference Paper]

Kaufmann, Michael (2008) Polynomial Area Bounds for MST embeddings of trees. [Conference Paper]

Carlson, Josiah and Eppstein, David (2007) Trees with Convex Faces and Optimal Angles. [Conference Paper]

Devillers, Olivier and Everett, Hazel and Lazard, Sylvain and Pentcheva, Maria and Wismath, Stephen (2006) Drawing K_n in Three Dimensions with One Bend per Edge. [Conference Paper]

Di Battista, Giuseppe and Frati, Fabrizio (2006) Small Area Drawings of Outerplanar Graphs. [Conference Paper]

Di Giacomo, Emilio and Liotta, Giuseppe and Meijer, Henk and Wismath, Stephen, K. (2006) Volume Requirements of 3D Upward Drawings. [Conference Paper]

Biedl, Therese and Brandenburg, Franz J. (2005) Drawing Planar Bipartite Graphs With Small Area. [Conference Paper] (In Press)

Garg, Ashim and Rusu, Adrian (2004) A More Practical Algorithm for Drawing Binary Trees in Linear Area with Arbitrary Aspect Ratio. [Conference Paper]

Garg, Ashim and Rusu, Adrian (2004) Area-Efficient Drawings of Outerplanar Graphs. [Conference Paper]

Chow, Stirling and Ruskey, Frank (2004) Drawing Area-Proportional Venn and Euler Diagrams. [Conference Paper]

Hasunuma, Toru (2004) Laying Out Iterated Line Digraphs Using Queues. [Conference Paper]

Calamoneri, Tiziana and Massini, Annalisa (2004) Nearly Optimal Three Dimensional Layout of Hypercube Networks. [Conference Paper]

Akkerman, Thorsten and Buchheim, Christoph and Jünger, Michael and Teske, Daniel (2004) On the complexity of drawing trees nicely: corrigendum. [Journal (Paginated)]

de Verdière, Éric Colin and Lazarus, Francis (2004) Optimal Pants Decompositions and Shortest Homotopic Cycles on an Orientable Surface. [Conference Paper]

Cabello, Sergio and Demaine, Erik D. and Rote, Günter (2004) Planar Embeddings of Graphs with Specified Edge Lengths. [Conference Paper]

Erten, Cesim and Kobourov, Stephen G. (2004) Simultaneous Embedding of Planar Graphs with Few Bends. [Conference Paper]

Dujmovic, Vida and Wood, David R. (2004) Three-Dimensional Grid Drawings with Sub-quadratic Volume. [Conference Paper]

Binucci, Carla and Didimo, Walter and Liotta, Giuseppe and Nonato, Maddalena (2002) Computing Labeled Orthogonal Drawings. [Conference Paper]

Mutton, Paul and Rodgers, Peter (2002) Demonstration of a Preprocessor for the Spring Embedder. [Conference Paper]

Freivalds, Karlis and Dogrusoz, Ugur and Kikusts, Paulis (2002) Disconnected Graph Layout and the Polyomino Packing Approach. [Conference Paper]

Biedl, Therese (2002) Drawing Outer-Planar Graphs in O(n log n) Area. [Conference Paper]

Eiglsperger, Markus and Kaufmann, Michael (2002) Fast Compaction for Orthogonal Drawings with Vertices of Prescribed Size. [Conference Paper]

Dujmovic, Vida and Morin, Pat and Wood, David R. (2002) Path-Width and Three-Dimensional Straight-Line Grid Drawings of Graphs. [Conference Paper]

Garg, Ashim and Rusu, Adrian (2002) Straight-Line Drawings of Binary Trees with Linear Area and Arbitrary Aspect Ratio (Extended Abstract). [Conference Paper]

Castelló, Rodolfo and Mili, Rym and Tollis, Ioannis G. (2001) An Algorithmic Framework for Visualizing Statecharts. [Conference Paper]

Klau, Gunnar W. and Klein, Karsten and Mutzel, Petra (2001) An Experimental Comparison of Orthogonal Compaction Algorithms (Extended Abstract). [Conference Paper]

Lynn, Benjamin Y. S. and Symvonis, Antonios and Wood, David R. (2001) Refinement of Three-Dimensional Orthogonal Graph Drawings. [Conference Paper]

Cheng, C. C. and Duncan, Christian A. and Goodrich, Michael T. and Kobourov, Stephen G. (1999) Drawing Planar Graphs with Circular Arcs. [Conference Paper]

Miura, Kazuyuki and Nakano, Shin-ichi and Nishizeki, Takao (1999) Grid Drawings of Four-Connected Plane Graphs. [Conference Paper]

Bridgeman, Stina and Di Battista, Giuseppe and Didimo, Walter and Liotta, Giuseppe and Tamassia, Roberto and Vismara, Luca (1999) Turn-Regularity and Planar Orthogonal Drawings (Extended Abstract). [Conference Paper]

Barouni, Ala Eddine and Jaoua, Ali and Zaguia, Nejib (1999) Visualizing Algorithms for the Design and Analysis of Survivable Networks. [Conference Paper]

Goodrich, Michael T. and Wagner, Cristopher G. (1998) A Framework for Drawing Planar Graphs with Curves and Polylines. [Conference Paper]

Hayashi, Kunihiko and Inoue, Michiko and Masuzawa, Toshimitsu and Fujiwara, Hideo (1998) A Layout Adjustment Problem for Disjoint Rectangles Preserving Orthogonal Order. [Conference Paper]

Fößmeier, Ulrich and Kaufmann, Michael (1998) Algorithms and Area Bounds for Nonplanar Orthogonal Drawings. [Conference Paper]

Wood, David R. (1998) An Algorithm for Three-Dimensional Orthogonal Graph Drawing. [Conference Paper]

Lin, Xuemin and Eades, Peter (1998) Area Requirements for Drawing Hierarchically Planar Graphs. [Conference Paper]

Duncan, Christian A. and Goodrich, Michael T. and Kobourov, Stephen G. (1998) Balanced Aspect Ratio Trees and Their Use for Drawing Very Large Graphs. [Conference Paper]

Fößmeier, Ulrich (1998) Interactive Orthogonal Graph Drawing: Algorithms and Bounds. [Conference Paper]

Crescenzi, P. and Penna, Paolo (1998) Minimum-Area h-v Drawings of Complete Binary Trees. [Conference Paper]

Fößmeier, Ulrich and Heß, Carsten and Kaufmann, Michael (1998) On Improving Orthogonal Drawings: The 4M-Algorithm. [Conference Paper]

Calamoneri, Tiziana and Massini, Annalisa (1998) On Three-Dimensional Layout of Interconnection Networks (Extended Abstract). [Conference Paper]

Gutwenger, Carsten and Mutzel, Petra (1998) Planar Polyline Drawings with Good Angular Resolution. [Conference Paper]

Penna, Paolo and Vocca, Paola (1998) Proximity Drawings: Three Dimensions Are Better than Two (Extended Abstract). [Conference Paper]

Six, Janet M. and Kakoulis, Konstantinos G. and Tollis, Ioannis G. (1998) Refinement of Orthogonal Graph Drawings. [Conference Paper]

Papakostas, Achilleas and Tollis, Ioannis G. (1997) A Pairing Technique for Area-Efficient Orthogonal Drawings. [Conference Paper]

Di Battista, Giuseppe and Garg, Ashim and Liotta, Giuseppe and Parise, Armando and Tamassia, Roberto and Tassinari, Emanuele and Vargiu, Francesco and Vismara, Luca (1997) Drawing Directed Acyclic Graphs: An Experimantal Study. [Conference Paper]

Chan, Timothy and Goodrich, Michael T. and Kosaraju, Rao and Tamassia, Roberto (1997) Optimizing Area and Aspect Ratio in Straight-Line Orthogonal Tree Drawings. [Conference Paper]

Cobos, F. J. and Dana, J. C. and Hurtado, F. and Márquez, Alberto and Mateos, F. (1996) On a Visibility Representation of Graphs. [Conference Paper]

Papakostas, Achilleas and Tollis, Ioannis G. (1995) Improved Algorithms and Bounds for Orthogonal Drawings. [Conference Paper]

Chrobak, Marek and Nakano, Shin-ichi (1995) Minimum-Width Grid Drawings of Plane Graphs (Extended Abstract). [Conference Paper]

Crescenzi, P. and Piperno, A. (1995) Optimal-area upward drawings of AVL trees (Extended abstract). [Conference Paper]

Cohen, Robert F. and Eades, Peter and Lin, Tao and Ruskey, Frank (1995) Three-Dimensional Graph Drawing. [Conference Paper]

Jourdan, Guy-Vincent and Rival, Ivan and Zaguia, Nejib (1995) Upward Drawing on the Plane Grid Using Less Ink (Extended Abstract). [Conference Paper]