Browse by Classification

Abbot, Alastair A. and Dinneen, Dr. Michael J. (2008) An Investigation of Algorithms to Aesthetically Draw Cayley Graphs. [Departmental Technical Report] (Unpublished)

Dwyer, Tim and Marriott, Kim and Wybrow, Michael (2007) Integrating Edge Routing into Force-Directed Layout. [Conference Paper]

Lauther, Ulrich (2007) Multipole-Based Force Approximation Revisited - a Simple but Fast Implementation Using a Dynamized Enclosing-Circle-Enhanced k-d-Tree. [Conference Paper]

Genc, B and Dogrusoz, U (2006) A Layout Algorithm for Signaling Pathways. [Journal (On-line/Unpaginated)]

Hachul, Stefan and Jünger, Michael (2006) An Experimental Comparison of Fast Algorithms for Drawing General Large Graphs. [Conference Paper]

Noack, Andreas (2006) Energy-Based Clustering of Graphs with Nonuniform Degrees. [Conference Paper]

Dwyer, Tim and Koren, Yehuda and Marriott, Kim (2006) Stress Majorization with Orthogonal Ordering Constraints. [Conference Paper]

Dogrusoz, Ugur and Giral, Erhan and Cetintas, Ahmet and Civril, Ali and Demir, Emek (2004) A Compound Graph Layout Algorithm for Biological Pathways. [Conference Paper]

Noack, Andreas (2004) An Energy Model for Visual Graph Clustering. [Conference Paper]

Koren, Yehuda and Harel, David (2004) Axis-by-Axis Stress Minimization. [Conference Paper]

Delgado-Friedrichs, Olaf (2004) Barycentric Drawings of Periodic Graphs. [Conference Paper]

Finkel, Benjamin and Tamassia, Roberto (2004) Curvilinear Graph Drawing Using the Force-Directed Method. [Conference Paper]

Chuang, Jen-Hui and Lin, Chun-Cheng and Yen, Hsu-Chun (2004) Drawing Graphs with Nonuniform Nodes Using Potential Fields. [Conference Paper]

Hachul, Stefan and Jünger, Michael (2004) Drawing Large Graphs with a Potential-Field-Based Multilevel Algorithm (Extended Abstract). [Conference Paper]

Andersen, Reid and Chung, Fan and Lu, Lincoln (2004) Drawing Power Law Graphs. [Conference Paper]

Baur, Michael and Brandes, Ulrik and Gaertler, Marco and Wagner, Dorothea (2004) Drawing the AS Graph in 2.5 Dimensions. [Conference Paper]

Gansner, Emden R. and Koren, Yehuda and North, Stephen (2004) Graph Drawing by Stress Majorization. [Conference Paper]

Bridgeman, Stina (2004) GraphEx: An Improved Graph Translation Service. [Conference Paper]

Ebner, Dietmar and Klau, Gunnar W. and Weiskircher, René (2004) Label Number Maximization in the Slider Model (Extended Abstract). [Conference Paper]

Erten, Cesim and Kobourov, Stephen G. and Le, Vu and Navabi, Armand (2004) Simultaneous Graph Drawing: Layout Algorithms and Visualization Schemes. [Conference Paper]

Hong, Seok-Hee and Merrick, Damian and do Nascimento, Hugo A.D. (2004) The Metro Map Layout Problem. [Conference Paper]

Hachul, Dr. Stefan (2002) A Potential-Field-Based Multilevel Algorithm for Drawing Large Graphs. PhD thesis, Universitaet zu Koeln.

Bachl, Sabine and Brandenburg, Franz J. (2002) Computing and Drawing Isomorphic Subgraphs. [Conference Paper]

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

Lauther, Ulrich and Stübinger, Andreas (2002) Generating Schematic Cable Plans Using Springembedder Methods. [Conference Paper]

Diehl, Stephan and Görg, Carsten (2002) Graphs, They Are Changing -Dynamic Graph Drawing for a Sequence of Graphs. [Conference Paper]

Hotz, Günter and Lohse, Steffen (2002) Planarity Testing of Graphs on Base of a Spring Model. [Conference Paper]

Gajer, Pawel and Goodrich, Michael T. and Kobourov, Stephen G. (2001) A Multi-dimensional Approach to Force-Directed Layouts of Large Graphs. [Conference Paper]

Walshaw, C. (2001) A Multilevel Algorithm for Force-Directed Graph Drawing. [Conference Paper]

Bertault, François and Eades, Peter (2001) Drawing Hypergraphs in the Subset Standard (Short Demo Paper). [Conference Paper]

Quigley, Aaron and Eades, Peter (2001) FADE: Graph Drawing, Clustering, and Visual Abstraction. [Conference Paper]

Brandes, Ulrik and Shubina, Galina and Tamassia, Roberto and Wagner, Dorothea (2001) Fast Layout Methods for Timetable Graphs. [Conference Paper]

Gajer, Pawel and Kobourov, Stephen G. (2001) GRIP: Graph dRawing with Intelligent Placement. [Conference Paper]

Bertault, François (1999) A Force-Directed Algorithm that Preserves Edge Crossing Properties. [Conference Paper]

Behzadi, Lila (1999) LayoutShow: A Signed Applet/Application for Graph Drawing and Experimentation (System Demonstration). [Conference Paper]

Basalaj, Wojciech and Eilbeck, Karen (1999) Straight-Line Drawings of Protein Interactions. [Conference Paper]

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

Huang, Mao Lin and Eades, Peter (1998) A Fully Animated Interactive System for Clustering and Navigating Huge Graphs. [Conference Paper]

Gansner, Emden R. and North, Stephen (1998) Improved Force-Directed Layouts. [Conference Paper]

Ryall, Kathy and Marks, Joe and Shieber, Stuart (1997) An Interactive System for Drawing Graphs. [Conference Paper]

Frick, Arne and Keskin, Can and Vogelmann, Volker (1997) Integration of Declarative Approaches (System Demonstration). [Conference Paper]

Brandenburg, Franz J. and Himsolt, Michael and Rohrer, Christoph (1996) An Experimental Comparison of Force-Directed and Randomized Graph Drawing Algorithms. [Conference Paper]

Dodson, David (1996) COMAIDE: Information Visualization using Cooperative 3D Diagram Layout. [Conference Paper]

Kamps, Thomas and Kleinz, Joerg and Read, John (1996) Constraint-Based Spring-Model Algorithm for Graph Layout. [Conference Paper]

Ignatowicz, Jovanna (1996) Drawing Force-Directed Graphs Using Optigraph. [Conference Paper]

Wang, Xiaobo and Miyamoto, Isao (1996) Generating Customized Layouts. [Conference Paper]

Eades, Peter and de Mendonça Neto, C. F. X. (1996) Vertex Splitting and Tension-Free Layout. [Conference Paper]

Frick, Arne and Ludwig, Andreas and Mehldau, Heiko (1995) A Fast Adaptive Layout Algorithm for Undirected Graphs (Extended Abstract and System Demonstration). [Conference Paper]

Sugiyama, Kozo and Misue, Kazuo (1995) A Simple and Unified Method for Drawing Graphs: Magnetic-Spring Algorithm. [Conference Paper]