Browse by Classification

Kyncl, Jan (2008) The Complexity of Several Realizability Problems for Abstract Topological Graphs. [Conference Paper]

Dillencourt, Michael B. and Eppstein, David and Goodrich, Michael T. (2007) Choosing Colors for Geometric Graphs via Color Space Embeddings. [Conference Paper]

Brandes, Ulrik and Pich, Christian (2007) Eigensolver Methods for Progressive Multidimensional Scaling of Large Data. [Conference Paper]

Dwyer, Tim and Marriott, Kim and Stuckey, Peter J. (2007) Fast Node Overlap Removal - Correction. [Conference Paper]

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

Benkert, Marc and Nöllenburg, Martin and Uno, Takeaki and Wolff, Alexander (2007) Minimizing Intra-Edge Crossings in Wiring Diagrams and Public Transport Maps. [Conference Paper]

Biedl, Therese and Brandenburg, Franz J. (2007) Partitions of Graphs into Trees. [Conference Paper]

Papamanthou, Charalampos and Tollis, Ioannis G. (2006) Applications of Parameterized st-Orientations in Graph Drawing Algorithms. [Conference Paper]

Patrignani, Maurizio (2006) Complexity Results for Three-dimensional Orthogonal Graph Drawing. [Conference Paper]

Dwyer, Tim and Marriott, Kim and Stuckey, Peter J. (2006) Fast Node Overlap Removal. [Conference Paper]

Biedl, Therese and Lubiw, Anna and Spriggs, Michael (2006) Morphing Planar Graphs While Preserving Edge Directions. [Conference Paper]

Patrignani, Maurizio (2006) On Extending a Partial Straight-Line Drawing. [Conference Paper]

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

Efrat, Alon and Erten, Cesim and Kobourov, Stephen G. (2004) Fixed-Location Circular-Arc Drawing of Planar Graphs. [Conference Paper]

Hasunuma, Toru (2004) Laying Out Iterated Line Digraphs Using Queues. [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]

Di Giacomo, Emilio and Meijer, Henk (2004) Track Drawings of Graphs with Constant Queue Number. [Conference Paper]

Brandes, Ulrik and Dwyer, Tim and Schreiber, Falk (2004) Visualizing Related Metabolic Pathways in Two and a Half Dimensions (Long Paper). [Conference Paper]

Healy, Patrick and Nikolov, Nikola S. (2002) A Branch-and-Cut Approach to the Directed Acyclic Graph Layering Problem. [Conference Paper]

de Fraysseix, Hubert and Ossona de Mendez, Patrice (2002) A Characterization of DFS Cotree Critical Graphs. [Conference Paper]

Byun, Yanga and Jeong, Euna and Han, Kyungsook (2002) A Partitioned Approach to Protein Interaction Mapping. [Conference Paper]

Edwards, Keith and Farr, Graham (2002) An Algorithm for Finding Large Induced Planar Subgraphs. [Conference Paper]

Forster, Michael (2002) Applying Crossing Reduction Strategies to Layered Compound Graphs. [Conference Paper]

Six, Janet M. and Tollis, Ioannis G. (2002) Automated Visualization of Process Diagrams. [Conference Paper]

Di Giacomo, Emilio and Didimo, Walter and Liotta, Giuseppe and Wismath, Stephen (2002) Book Embeddings and Point-Set Embeddings of Series-Parallel Digraphs. [Conference Paper]

Streinu, Ileana and Tosun, Elif (2002) Camera Position Reconstruction and Tight Direction Networks. [Conference Paper]

Chanda, Amrita and Garg, Ashim (2002) Compact Encodings of Planar Orthogonal Drawings. [Conference Paper]

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]

Carmel, Liran and Harel, David and Koren, Yehuda (2002) Drawing Directed Graphs Using One-Dimensional Optimization. [Conference Paper]

Duncan, Christian A. and Efrat, Alon and Kobourov, Stephen G. and Wenk, Carola (2002) Drawing with Fat Edges. [Conference Paper]

Liao, Chien-Chih and Lu, Hsueh-I. and Yen, Hsu-Chun (2002) Floor-Planning via Orderly Spanning Trees. [Conference Paper]

Fiala, Jirí and Kratochvíl, Jan and Proskurowski, Andrzej (2002) Geometric Systems of Disjoint Representatives. [Conference Paper]

Friedrich, Carsten and Houle, Michael E. (2002) Graph Drawing in Motion II. [Conference Paper]

Raitner, Marcus (2002) HGV: A Library for Hierarchies, Graphs, and Views. [Conference Paper]

Healy, Patrick and Nikolov, Nikola S. (2002) How to Layer a Directed Acyclic Graph. [Conference Paper]

Buchheim, Christoph and Jünger, Michael and Leipert, Sebastian (2002) Improving Walker's Algorithm to Run in Linear Time. [Conference Paper]

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

Duncan, Christian A. and Kobourov, Stephen G. (2002) Polar Coordinate Drawing of Planar Graphs with Good Angular Resolution. [Conference Paper]

Pach, János and Tóth, Géza (2002) Recognizing String Graphs Is Decidable. [Conference Paper]

Rahman, Md. Saidur and Nishizeki, Takao and Ghosh, Shubhashis (2002) Rectangular Drawings of Planar Graphs (Extended Abstract). [Conference Paper]

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

Chen, Ho-Lin and Liao, Chien-Chih and Lu, Hsueh-I. and Yen, Hsu-Chun (2002) Some Applications of Orderly Spanning Trees in Graph Drawing. [Conference Paper]

Baburin, Danil E. (2002) Some Modifications of Sugiyama Approach. [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]

Newton, Matthew and Sykora, Ondrej and Vrt'o, Imrich (2002) Two New Heuristics for Two-Sided Bipartite Graph Drawing. [Conference Paper]

do Nascimento, Hugo A.D. and Eades, Peter (2002) User Hints for Directed Graph Drawing. [Conference Paper]

Boissonnat, J.D. and Cazals, F. and Flötotto, J. (2001) 2D-Structure Drawings of Similar Molecules. [Conference Paper]

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

Harel, David and Koren, Yehuda (2001) A Fast Multi-scale Method for Drawing Large Graphs. [Conference Paper]

Dean, Alice M. (2001) A Layout Algorithm for Bar-Visibility Graphs on the Möbius Band. [Conference Paper]

Gutwenger, Carsten and Mutzel, Petra (2001) A Linear Time Implementation of SPQR-Trees. [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]

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

Bridgeman, Stina and Tamassia, Roberto (2001) A User Study in Similarity Measures for Graph Drawing. [Conference Paper]

Hong, Seok-Hee and Eades, Peter (2001) An Algorithm for Finding Three Dimensional Symmetry in Trees. [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]

Shieh, Fwu-Shan and McCreary, Carolyn (2001) Clan-Based Incremental Drawing. [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]

Brandes, Ulrik and Cornelsen, Sabine and Wagner, Dorothea (2001) How to Draw the Minimum Cuts of a Planar Graph (Extended Abstract). [Conference Paper]

Günther, Wolfgang and Schönfeld, Robby and Becker, Bernd and Molitor, Paul (2001) k-Layer Straightline Crossing Minimization by Speeding Up Sifting. [Conference Paper]

Chen, Ho-Lin and Lu, Hsueh-I. and Yen, Hsu-Chun (2001) On Maximum Symmetric Subgraphs. [Conference Paper]

de Fraysseix, Hubert and Ossona de Mendez, Patrice (2001) On topological aspects of orientations. [Journal (Paginated)]

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

de Fraysseix, Hubert (1999) An Heuristic for Graph Symmetry Detection. [Conference Paper]

Klau, Gunnar W. and Mutzel, Petra (1999) Combining Graph Labeling and Compaction (Extended Abstract). [Conference Paper]

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

Bachl, Sabine (1999) Isomorphic Subgraphs. [Conference Paper]

Wood, David R. (1999) Multi-dimensional Orthogonal Graph Drawing with Small Boxes(Extended Abstract). [Conference Paper]

Mutzel, Petra and Ziegler, Thomas (1999) The Constrained Crossing Minimization Problem. [Conference Paper]

Healy, Patrick and Kuusik, Ago (1999) The Vertex-Exchange Graph: A New Concept for Multi-level Crossing Minimisation. [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]

Wiese, Roland and Kaufmann, Michael (1998) Adding Constraints to an Algorithm for Orthogonal Graph Drawing. [Conference Paper]

Houle, Michael E. and Webber, Richard (1998) Approximation Algorithms for Finding Best Viewpoints. [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]

Kratochvíl, Jan (1998) Crossing Number of Abstract Topological Graphs. [Conference Paper]

Bridgeman, Stina and Tamassia, Roberto (1998) Difference Metrics for Interactive Orthogonal Graph Drawing Algorithms. [Conference Paper]

Lenhart, William and Liotta, Giuseppe (1998) Drawable and Forbidden Minimum Weight Triangulations. [Conference Paper]

Hong, Seok-Hee and Eades, Peter and Quigley, Aaron and Lee, Sang-Ho (1998) Drawing Algorithms for Series-Parallel Digraphs in Two and Three Dimensions. [Conference Paper]

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

Eades, Peter and Houle, Michael E. and Webber, Richard (1998) Finding the Best Viewpoints for Three-Dimensional Graph Drawings. [Conference Paper]

Dillencourt, Michael B. and Eppstein, David and Hirschberg, Daniel S. (1998) Geometric Thickness of Complete Graphs. [Conference Paper]

Brandenburg, Franz J. (1998) Graph Clustering I: Cycles of Cliques. [Conference Paper]

Roxborough, Tom and Sen, Arunabha (1998) Graph Clustering Using Multiway Ratio Cut (Software Demonstration). [Conference Paper]

Biedl, Therese and Marks, Joe and Ryall, Kathy and Whitesides, Sue (1998) Graph Multidrawing: Finding Nice Drawings Without Defining Nice. [Conference Paper]

Dobkin, David P. and Gansner, Emden R. and Koutsofios, Eleftherios and North, Stephen (1998) Implementing a General-Purpose Edge Router. [Conference Paper]

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

Schreiber, Falk and Skodinis, Konstantinos (1998) NP-Completeness of Some Tree-Clustering Problems. [Conference Paper]

Zhu, Binhai and Deng, Xiaotie (1998) On Computing and Drawing Maxmin-Height Covering Triangulation. [Conference Paper]

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

Jünger, Michael and Leipert, Sebastian and Mutzel, Petra (1998) Pitfalls of Using PQ-Trees in Automatic Graph Drawing. [Conference Paper]

Demaine, Erik D. and Demaine, Martin L. (1998) Planar Drawings of Origami Polyhedra. [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]

Meyer, Bernd (1998) Self-Organizing Graphs - A Neural Network Perspective of Graph Layout. [Conference Paper]

Fekete, Sándor P. and Houle, Michael E. and Whitesides, Sue (1998) The Wobbly Logic Engine: Proving Hardness of Non-rigid Geometric Graph Representation Problems. [Conference Paper]

Biedl, Therese (1998) Three Approaches to 3D-Orthogonal Box-Drawings (Extended Abstract). [Conference Paper]

Hlinený, Petr (1998) Touching Graphs of Unit Balls. [Conference Paper]

Brandes, Ulrik and Wagner, Dorothea (1998) Using Graph Layout to Visualize Train Interconnection Data. [Conference Paper]

Steckelbach, Björn and Bubeck, Till and Fößmeier, Ulrich and Kaufmann, Michael and Ritt, Marcus and Rosenstiel, Wolfgang (1998) Visualization of Parallel Execution Graphs. [Conference Paper]

Nakano, Shin-ichi and Rahman, Md. Saidur and Nishizeki, Takao (1997) A Linear-Time Algorithm for Four-Partitioning Four-Connected Planar Graphs. [Conference Paper]

Garg, Ashim and Tamassia, Roberto (1997) A New Minimum Cost Flow Algorithm with Applications to Graph Drawing. [Conference Paper]

Mutzel, Petra (1997) An Alternative Mathod to Crossing Minimization on Hierarchiocal Graphs (extended abstract). [Conference Paper]

Lozada, L. A. P. and de Mendonça Neto, C. F. X. and Rosi, R. M. and Stolfi, J. (1997) Automatic Visualization of Two-Dimensional Cellular Complexes. [Conference Paper]

Calamoneri, Tiziana and Sterbini, Andrea (1997) Drawing 2-, 3- and 4-colorable Graphs in O(n²) Volume. [Conference Paper]

Kratochvíl, Jan (1997) Intersection Graphs of Noncrossing Arc-Connected Sets in the Plane. [Conference Paper]

Bose, Prosenjit and Dean, Alice M. and Hutchinson, Joan P. and Shermer, Thomas (1997) On Rectangle Visibility Graphs. [Conference Paper]

Kakoulis, Konstantinos G. and Tollis, Ioannis G. (1997) On the Edge Label Placement Problem. [Conference Paper]

Wittenburg, Kent and Weitzman, Louis (1997) Qualitative Visualization on Processes: Attributed Graph Layout and Focusing Techniques. [Conference Paper]

Alzohairi, Mohammad and Rival, Ivan (1997) Series-Parallel Planar Ordered Sets Have Pagenumber Two (Extended Abstract). [Conference Paper]

Frick, Arne (1997) Upper Bounds on the Number of Hidden Nodes in Sugiyama's Algorithm. [Conference Paper]

Kuchem, Ruth and Wagner, Dorothea (1997) Wiring Edge-Disjoint Layouts. [Conference Paper]

Monien, Burkhard and Ramme, Friedhelm and Salmen, Helmut (1996) A Parallel Simulated Annealing Algorithm for Generating 3D Layouts of Undirected Graphs. [Conference Paper]

Paris, Gilles (1996) Automatic Drawing of Compound Digraphs for a Real-Time Power System Simulator. [Conference Paper]

Shieh, Fwu-Shan and McCreary, Carolyn (1996) Directed Graphs Drawing by Clan-Based Decomposition. [Conference Paper]

He, Xin (1996) Grid Embedding of 4-Connected Plane Graphs. [Conference Paper]

Lenhart, William and Liotta, Giuseppe (1996) How to Draw Outerplanar Minimum Weight Triangulations. [Conference Paper]

North, Stephen (1996) Incremental Layout in DynaDAG. [Conference Paper]

Papakostas, Achilleas and Tollis, Ioannis G. (1996) Issues in Interactive Orthogonal Graph Drawing. [Conference Paper]

Kikusts, Paulis and Rucevskis, Peteris (1996) Layout Algorithms of Graph-Like Diagrams for GRADE Windows Graphic Editors. [Conference Paper]

Breu, Heinz and Kirkpatrick, David G. (1996) On the Complexity of Recognizing Intersection and Touching Graphs of Disks. [Conference Paper]

Heath, Lenwood S. and Pemmaraju, Sriram V. (1996) Recognizing Leveled-Planar Dags in Linear Time. [Conference Paper]

Di Battista, Giuseppe and Liotta, Giuseppe and Whitesides, Sue (1996) The Strength of Weak Proximity (Extended Abstract). [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]

de Fraysseix, Hubert and Ossona de Mendez, Patrice and Pach, János (1995) A Left-First Search Algorithm for Planar Graphs. [Journal (Paginated)]

Kaugars, Karlis and Reinfelds, Juris and Brazma, Alvis (1995) A Simple Algorithm for Drawing Large Graphs on Small Screens. [Conference Paper]

Brandenburg, Franz J. (1995) Designing Graph Drawings by Layout Graph Grammars. [Conference Paper]

Cruz, Isabel F. and Garg, Ashim (1995) Drawing Graphs by Example Efficiently: Trees and Planar Acyclic Digraphs (Extended Abstract). [Conference Paper]

Tollis, Ioannis G. and Xia, Chunliang (1995) Drawing Telecommunication Networks. [Conference Paper]

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

Djidjev, Hristo (1995) On Drawing a Graph Convexly in the Plane (Extended Abstract). [Conference Paper]

Garg, Ashim (1995) On Drawing Angle Graphs (Extended Abstract). [Conference Paper]

Godau, Michael (1995) On the difficulty of embedding planar graphs with inaccuracies (Extended Abstract). [Conference Paper]

ElGindy, H. and Liotta, Giuseppe and Lubiw, Anna and Meijer, Henk and Whitesides, Sue (1995) Recognizing Rectangle of Influence Drawable Graphs (extended abstract). [Conference Paper]

Jünger, Michael and Mutzel, Petra (1995) The Polyhedral Approach to the Maximum Planar Subgraph Problem: New Chances for Related Problems. [Conference Paper]

Jünger, Michael and Mutzel, Petra (1994) The Polyhedral Approach to the Maximum Planar Subgraph Problem: New Chances for Related Problems. [Preprint]