Browse by Classification

Di Giacomo, Emilio and Liotta, Giuseppe and Trotta, Francesco (2008) Drawing Colored Graphs with Contrained Vertex Positions and Few Bends per Edge. [Conference Paper]

Everett, Hazel and Lazard, Sylvain and Liotta, Giuseppe and Wismath, Stephen (2008) Universal Sets of n Points for 1-bend Drawings of Planar Graphs with n Vertices. [Conference Paper]

Yildiz, Canan and Mutzel, Petra and Barth, Wilhelm (2007) A New Approximation Algorithm for Bend Minimization in the Kandinsky Model. [Conference Paper]

Wismath, Stephen K. and Di Giacomo, Emilio and Didimo, Walter and Liotta, Giuseppe and Meijer, Henk and Trotta, Francesco (2007) k-colored point-set embeddability of outerplanar graphs. [Conference Paper]

Gudmundsson, Joachim and van Kreveld, Marc and Merrick, Damian (2007) Schematisation of Tree Drawings. [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 Giacomo, Emilio and Liotta, Giuseppe and Trotta, Francesco (2006) How to Embed a Path onto Two Sets of Points. [Conference Paper]

Aziza, Shabnam and Biedl, Therese (2004) Hexagonal Grid Drawings: Algorithms and Lower Bounds. [Conference Paper]

Rahman, Md. Saidur and Egi, Noritsugu and Nishizeki, Takao (2004) No-Bend Orthogonal Drawings of Subdivisions of Planar Triconnected Cubic Graphs (Extended Abstract). [Conference Paper]

Dujmovic, Vida and Suderman, Matthew and Wood, David R. (2004) Really Straight Graph Drawings. [Conference Paper]

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

Wood, David R. (2002) Bounded Degree Book Embeddings and Three-Dimensional Orthogonal Graph Drawing. [Conference Paper]

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

Rahman, Md. Saidur and Naznin, Mahmuda and Nishizeki, Takao (2002) Orthogonal Drawings of Plane Graphs without Bends. [Conference Paper]

Biedl, Therese and Johansen, John and Shermer, Thomas and Wood, David R. (2002) Orthogonal Drawings with Few Layers. [Conference Paper]

Bachl, Walter (2002) Semi-dynamic Orthogonal Drawings of Planar Graphs (Extended Abstract). [Conference Paper]

Brandes, Ulrik and Eiglsperger, Markus and Kaufmann, Michael and Wagner, Dorothea (2002) Sketch-Driven Orthogonal Graph Drawing. [Conference Paper]

Baburin, Danil E. (2002) Some Modifications of Sugiyama Approach. [Conference Paper]

Buchheim, Christoph and Jünger, Michael and Leipert, Sebastian (2001) A Fast Layout Algorithm for k-Level Graphs. [Conference Paper]

Nakano, Shin-ichi and Yoshikawa, Makiko (2001) A Linear-Time Algorithm for Bend-Optimal Orthogonal Drawings of Biconnected Cubic Plane Graphs (Extended Abstract). [Conference Paper]

Brandes, Ulrik and Cornelsen, Sabine and Wagner, Dorothea (2001) How to Draw the Minimum Cuts of a Planar Graph (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]

Buchheim, Christoph and Jünger, Michael and Leipert, Sebastian (1999) A Fast Layout Algorithm for k-Level Graphs. [Preprint]

Garg, Ashim and Liotta, Giuseppe (1999) Almost Bend-Optimal Planar Orthogonal Drawings of Biconnected Degree-3 Planar Graphs in Quadratic Time. [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]

Kaufmann, Michael and Wiese, Roland (1999) Embedding Vertices at Points: Few Bends Suffice for Planar Graphs. [Conference Paper]

Closson, M. and Gartshore, S. and Johansen, John and Wismath, Stephen (1999) Fully Dynamic 3-Dimensional Orthogonal Graph Drawing. [Conference Paper]

Brandes, Ulrik and Wagner, Dorothea (1998) A Bayesian Paradigm for Dynamic Graph Layout. [Conference Paper]

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

Rahman, Md. Saidur and Nakano, Shin-Ichi and Nishizeki, Takao (1998) A Linear Algorithm for Optimal Orthogonal Drawings of Triconnected Cubic Plane Graphs. [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]

Eades, Peter and Feng, Qing-Wen (1998) Drawing Clustered Graphs on an Orthogonal Grid. [Conference Paper]

Garrido, M. Ángeles and Márquez, Alberto (1998) Embedding a Graph in the Grid of a Surface with the Minimum Number of Bends Is NP-hard. [Conference Paper]

Pach, János and Wenger, Rephael (1998) Embedding Planar Graphs at Fixed Vertex Locations. [Conference Paper]

Didimo, Walter and Leonforte, Antonio (1998) GRID: An Intercative Tool for Computing Orthogonal Drawings with the Minimum Number of Bends. [Conference Paper]

Papakostas, Achilleas and Tollis, Ioannis G. (1998) Incremental Orthogonal Graph Drawing in Three Dimensions. [Conference Paper]

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

Bridgeman, Stina and Fanto, Jody and Garg, Ashim and Tamassia, Roberto and Vismara, Luca (1998) InteractiveGiotto: An Algorithm for Interactive Orthogonal Graph Drawing. [Conference Paper]

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

Biedl, Therese and Shermer, Thomas and Whitesides, Sue and Wismath, Stephen (1998) Orthogonal 3-D Graph Drawing. [Conference Paper]

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

Bertolazzi, Paola and Di Battista, Giuseppe and Didimo, Walter (1998) Quasi-Upward planarity (extended abstract). [Conference Paper]

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

Fößmeier, Ulrich and Kant, Goos and Kaufmann, Michael (1997) 2-Visibility Drawings of Planar Graphs. [Conference Paper]

Garg, Ashim and Tamassia, Roberto (1997) A New Minimum Cost Flow Algorithm with Applications to Graph Drawing. [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]

Papakostas, Achilleas and Six, Janet M. and Tollis, Ioannis G. (1997) Experimental and Theoretical Results in Interactive Orthogonal Graph Drawing. [Conference Paper]

Eades, Peter and Symvonis, Antonios and Whitesides, Sue (1997) Two Algorithms for Three Dimensional Orthogonal Graph Drawing. [Conference Paper]

Sander, Georg (1996) A Fast Heuristic for Hierarchical Manhattan Layout. [Conference Paper]

Fößmeier, Ulrich and Kaufmann, Michael (1996) Drawing High Degree Graphs with Low Bend Numbers. [Conference Paper]

Biedl, Therese (1996) New Lower Bounds for Orthogonal Graph Drawings. [Conference Paper]

Purchase, Helen C. and Cohen, Robert F. and James, Murray (1996) Validating Graph Drawing Aesthetics. [Conference Paper]

Even, S. and Granot, G. (1995) Grid Layouts of Block Diagrams - Bounding the Number of Bends in Each Connection (Extended Abstract). [Conference Paper]

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

Fößmeier, Ulrich and Kaufmann, Michael (1995) On Bend-Minimum Orthogonal Upward Drawing of Directed Planar Graphs. [Conference Paper]