Subject: G.999 Others
Number of records: 141.
Boissonnat, J.D. and Cazals, F. and Flötotto, J. (2001) 2D-Structure Drawings of Similar Molecules. In Marks, Joe, Eds. Proceedings Graph Drawing, pages pp. 115-126, Colonial Williamsburg.
Healy, Patrick and Nikolov, Nikola S. (2002) A Branch-and-Cut Approach to the Directed Acyclic Graph Layering Problem. In Goodrich, Michael T. and Kobourov, Stephen G., Eds. Proceedings Graph Drawing, pages pp. 98-109, Irvine, CA, USA.
de Fraysseix, Hubert and Ossona de Mendez, Patrice (2002) A Characterization of DFS Cotree Critical Graphs
. In Mutzel, Petra and Jünger, Michael and Leipert, Sebastian, Eds. Proceedings Graph Drawing, pages pp. 84-95, Vienna, Austria.
Frick, Arne and Ludwig, Andreas and Mehldau, Heiko (1995) A Fast Adaptive Layout Algorithm for Undirected Graphs
(Extended Abstract and System Demonstration). In Tamassia, Roberto and Tollis, Ioannis G., Eds. Proceedings Graph Drawing, pages pp. 388-403, Princeton.
Buchheim, Christoph and Jünger, Michael and Leipert, Sebastian (2001) A Fast Layout Algorithm for k-Level Graphs. In Marks, Joe, Eds. Proceedings Graph Drawing, pages pp. 229-240, Colonial Williamsburg.
Harel, David and Koren, Yehuda (2001) A Fast Multi-scale Method for Drawing Large Graphs. In Marks, Joe, Eds. Proceedings Graph Drawing, pages pp. 183-196, Colonial Williamsburg.
Goodrich, Michael T. and Wagner, Cristopher G. (1998) A Framework for Drawing Planar Graphs with Curves and Polylines. In Whitesides, Sue H., Eds. Proceedings Graph Drawing, pages pp. 153-166, Montréal, Canada.
Hayashi, Kunihiko and Inoue, Michiko and Masuzawa, Toshimitsu and Fujiwara, Hideo (1998) A Layout Adjustment Problem for Disjoint Rectangles Preserving Orthogonal Order. In Whitesides, Sue H., Eds. Proceedings Graph Drawing, pages pp. 183-197, Montréal, Canada.
Dean, Alice M. (2001) A Layout Algorithm for Bar-Visibility Graphs on the Möbius Band. In Marks, Joe, Eds. Proceedings Graph Drawing, pages pp. 350-359, Colonial Williamsburg.
de Fraysseix, Hubert and Ossona de Mendez, Patrice and Pach, János (1995) A Left-First Search Algorithm for Planar Graphs. Discrete Computational Geometry 13:pp. 459-468.
Gutwenger, Carsten and Mutzel, Petra (2001) A Linear Time Implementation of SPQR-Trees. In Marks, Joe, Eds. Proceedings Graph Drawing, pages pp. 77-90, Colonial Williamsburg.
Nakano, Shin-ichi and Yoshikawa, Makiko (2001) A Linear-Time Algorithm for Bend-Optimal Orthogonal Drawings of Biconnected Cubic Plane Graphs (Extended Abstract). In Marks, Joe, Eds. Proceedings Graph Drawing, pages pp. 296-307, Colonial Williamsburg.
Nakano, Shin-ichi and Rahman, Md. Saidur and Nishizeki, Takao (1997) A Linear-Time Algorithm for Four-Partitioning Four-Connected Planar Graphs. In North, Stephen, Eds. Proceedings Graph Drawing, pages pp. 334-344, Berkeley, California,.
Walshaw, C. (2001) A Multilevel Algorithm for Force-Directed Graph Drawing. In Marks, Joe, Eds. Proceedings Graph Drawing, pages pp. 171-182, Colonial Williamsburg.
Garg, Ashim and Tamassia, Roberto (1997) A New Minimum Cost Flow Algorithm with Applications to Graph Drawing. In North, Stephen, Eds. Proceedings Graph Drawing, pages pp. 201-216, Berkeley, California, USA.
Monien, Burkhard and Ramme, Friedhelm and Salmen, Helmut (1996) A Parallel Simulated Annealing Algorithm for Generating 3D Layouts of Undirected Graphs. In Brandenburg, Franz J., Eds. Proceedings Graph Drawing, pages pp. 396-408, Passau, Germany.
Byun, Yanga and Jeong, Euna and Han, Kyungsook (2002) A Partitioned Approach to Protein Interaction Mapping. In Goodrich, Michael T. and Kobourov, Stephen G., Eds. Proceedings Graph Drawing, pages pp. 370-371, Irvine, CA, USA.
Kaugars, Karlis and Reinfelds, Juris and Brazma, Alvis (1995) A Simple Algorithm for Drawing Large Graphs on Small Screens. In Tamassia, Roberto and Tollis, Ioannis G., Eds. Proceedings Graph Drawing, pages pp. 278-281, Princeton.
Bridgeman, Stina and Tamassia, Roberto (2001) A User Study in Similarity Measures for Graph Drawing. In Marks, Joe, Eds. Proceedings Graph Drawing, pages pp. 19-30, Colonial Williamsburg.
Wiese, Roland and Kaufmann, Michael (1998) Adding Constraints to an Algorithm for Orthogonal Graph Drawing. In Whitesides, Sue H., Eds. Proceedings Graph Drawing, pages pp. 462-463, Montréal, Canada.
Edwards, Keith and Farr, Graham (2002) An Algorithm for Finding Large Induced Planar Subgraphs. In Mutzel, Petra and Jünger, Michael and Leipert, Sebastian, Eds. Proceedings Graph Drawing, pages pp. 75-83, Vienna, Austria.
Hong, Seok-Hee and Eades, Peter (2001) An Algorithm for Finding Three Dimensional Symmetry in Trees. In Marks, Joe, Eds. Proceedings Graph Drawing, pages pp. 360-371, Colonial Williamsburg.
Castelló, Rodolfo and Mili, Rym and Tollis, Ioannis G. (2001) An Algorithmic Framework for Visualizing Statecharts. In Marks, Joe, Eds. Proceedings Graph Drawing, pages pp. 139-149, Colonial Williamsburg.
Mutzel, Petra (1997) An Alternative Mathod to Crossing Minimization on Hierarchiocal Graphs (extended abstract). In North, Stephen, Eds. Proceedings Graph Drawing, pages pp. 318-333, Berkeley, California, USA.
Klau, Gunnar W. and Klein, Karsten and Mutzel, Petra (2001) An Experimental Comparison of Orthogonal Compaction Algorithms (Extended Abstract). In Marks, Joe, Eds. Proceedings Graph Drawing, pages pp. 37-51, Colonial Williamsburg.
de Fraysseix, Hubert (1999) An Heuristic for Graph Symmetry Detection. In Kratochvíl, Jan, Eds. Proceedings Graph Drawing, pages pp. 276-285, Stirín Castle, Czech Republic.
Papamanthou, Charalampos and Tollis, Ioannis G. (2006) Applications of Parameterized st-Orientations in Graph Drawing Algorithms. In Healy, Patrick and Nikolov, Nikola S., Eds. Proceedings Graph Drawing, pages pp. 355-367, Limerick, Ireland.
Forster, Michael (2002) Applying Crossing Reduction Strategies to Layered Compound Graphs. In Goodrich, Michael T. and Kobourov, Stephen G., Eds. Proceedings Graph Drawing, pages pp. 276-284, Irvine, CA, USA.
Houle, Michael E. and Webber, Richard (1998) Approximation Algorithms for Finding Best Viewpoints. In Whitesides, Sue H., Eds. Proceedings Graph Drawing, pages pp. 210-223, Montréal, Canada.
Six, Janet M. and Tollis, Ioannis G. (2002) Automated Visualization of Process Diagrams. In Mutzel, Petra and Jünger, Michael and Leipert, Sebastian, Eds. Proceedings Graph Drawing, pages pp. 44-59, Vienna, Austria.
Paris, Gilles (1996) Automatic Drawing of Compound Digraphs for a Real-Time Power System Simulator. In Brandenburg, Franz J., Eds. Proceedings Graph Drawing, pages pp. 431-434, Passau, Germany.
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. In North, Stephen, Eds. Proceedings Graph Drawing, pages pp. 303-317, Berkeley, California, USA.
Koren, Yehuda and Harel, David (2004) Axis-by-Axis Stress Minimization. In Liotta, Giuseppe, Eds. Proceedings Graph Drawing, pages pp. 450-459, Perugia.
Duncan, Christian A. and Goodrich, Michael T. and Kobourov, Stephen G. (1998) Balanced Aspect Ratio Trees and Their Use for Drawing Very Large Graphs. In Whitesides, Sue H., Eds. Proceedings Graph Drawing, pages pp. 111-124, Montréal, Canada.
Di Giacomo, Emilio and Didimo, Walter and Liotta, Giuseppe and Wismath, Stephen (2002) Book Embeddings and Point-Set Embeddings of Series-Parallel Digraphs. In Goodrich, Michael T. and Kobourov, Stephen G., Eds. Proceedings Graph Drawing, pages pp. 162-173, Irvine, CA, USA.
Streinu, Ileana and Tosun, Elif (2002) Camera Position Reconstruction and Tight Direction Networks
. In Goodrich, Michael T. and Kobourov, Stephen G., Eds. Proceedings Graph Drawing, pages pp. 372-373, Irvine, CA, USA.
Dillencourt, Michael B. and Eppstein, David and Goodrich, Michael T. (2007) Choosing Colors for Geometric Graphs via Color Space Embeddings. In Kaufmann, Michael and Wagner, Dorothea, Eds. Proceedings Graph Drawing, pages pp. 294-305, Karlsruhe, Germany.
Shieh, Fwu-Shan and McCreary, Carolyn (2001) Clan-Based Incremental Drawing. In Marks, Joe, Eds. Proceedings Graph Drawing, pages pp. 384-396, Colonial Williamsburg.
Klau, Gunnar W. and Mutzel, Petra (1999) Combining Graph Labeling and Compaction (Extended Abstract). In Kratochvíl, Jan, Eds. Proceedings Graph Drawing, pages pp. 27-37, Stirín Castle, Czech Republic.
Chanda, Amrita and Garg, Ashim (2002) Compact Encodings of Planar Orthogonal Drawings. In Goodrich, Michael T. and Kobourov, Stephen G., Eds. Proceedings Graph Drawing, pages pp. 174-185, Irvine, CA, USA.
Patrignani, Maurizio (2006) Complexity Results for Three-dimensional Orthogonal Graph Drawing. In Healy, Patrick and Nikolov, Nikola S., Eds. Proceedings Graph Drawing, pages pp. 368-379, Limerick, Ireland.
Bachl, Sabine and Brandenburg, Franz J. (2002) Computing and Drawing Isomorphic Subgraphs. In Goodrich, Michael T. and Kobourov, Stephen G., Eds. Proceedings Graph Drawing, pages pp. 74-85, Irvine, CA, USA.
Kratochvíl, Jan (1998) Crossing Number of Abstract Topological Graphs. In Whitesides, Sue H., Eds. Proceedings Graph Drawing, pages pp. 238-245, Montréal, Canada.
Mutton, Paul and Rodgers, Peter (2002) Demonstration of a Preprocessor for the Spring Embedder. In Goodrich, Michael T. and Kobourov, Stephen G., Eds. Proceedings Graph Drawing, pages pp. 374-375, Irvine, CA, USA.
Brandenburg, Franz J. (1995) Designing Graph Drawings by Layout Graph Grammars. In Tamassia, Roberto and Tollis, Ioannis G., Eds. Proceedings Graph Drawing, pages pp. 416-427, Princeton.
Bridgeman, Stina and Tamassia, Roberto (1998) Difference Metrics for Interactive Orthogonal Graph Drawing Algorithms. In Whitesides, Sue H., Eds. Proceedings Graph Drawing, pages pp. 57-71, Montréal, Canada.
Shieh, Fwu-Shan and McCreary, Carolyn (1996) Directed Graphs Drawing by Clan-Based Decomposition. In Brandenburg, Franz J., Eds. Proceedings Graph Drawing, pages pp. 472-482, Passau, Germany.
Lenhart, William and Liotta, Giuseppe (1998) Drawable and Forbidden Minimum Weight Triangulations. In DiBattista, Giuseppe, Eds. Proceedings Graph Drawing, pages pp. 1-12, Rome, Italy.
Calamoneri, Tiziana and Sterbini, Andrea (1997) Drawing 2-, 3- and 4-colorable Graphs in O(n²) Volume. In North, Stephen, Eds. Proceedings Graph Drawing, pages pp. 53-62, Berkeley, California, USA.
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. In Whitesides, Sue H., Eds. Proceedings Graph Drawing, pages pp. 198-209, Montréal, Canada.
Carmel, Liran and Harel, David and Koren, Yehuda (2002) Drawing Directed Graphs Using One-Dimensional Optimization. In Goodrich, Michael T. and Kobourov, Stephen G., Eds. Proceedings Graph Drawing, pages pp. 193-206, Irvine, CA, USA.
Cruz, Isabel F. and Garg, Ashim (1995) Drawing Graphs by Example Efficiently: Trees and Planar Acyclic Digraphs (Extended Abstract). In Tamassia, Roberto and Tollis, Ioannis G., Eds. Proceedings Graph Drawing, pages pp. 404-415, Princeton.
Tollis, Ioannis G. and Xia, Chunliang (1995) Drawing Telecommunication Networks. In Tamassia, Roberto and Tollis, Ioannis G., Eds. Proceedings Graph Drawing, pages pp. 206-217, Princeton.
Duncan, Christian A. and Efrat, Alon and Kobourov, Stephen G. and Wenk, Carola (2002) Drawing with Fat Edges. In Mutzel, Petra and Jünger, Michael and Leipert, Sebastian, Eds. Proceedings Graph Drawing, pages pp. 162-177, Vienna, Austria.
Brandes, Ulrik and Pich, Christian (2007) Eigensolver Methods for Progressive Multidimensional Scaling of Large Data. In Kaufmann, Michael and Wagner, Dorothea, Eds. Proceedings Graph Drawing, pages pp. 42-53, Karlsruhe, Germany.
Pach, János and Wenger, Rephael (1998) Embedding Planar Graphs at Fixed Vertex Locations. In Whitesides, Sue H., Eds. Proceedings Graph Drawing, pages pp. 263-274, Montréal, Canada.
Kaufmann, Michael and Wiese, Roland (1999) Embedding Vertices at Points: Few Bends Suffice for Planar Graphs. In Kratochvíl, Jan, Eds. Proceedings Graph Drawing, pages pp. 165-174, Stirín Castle, Czech Republic.
Brandes, Ulrik and Shubina, Galina and Tamassia, Roberto and Wagner, Dorothea (2001) Fast Layout Methods for Timetable Graphs. In Marks, Joe, Eds. Proceedings Graph Drawing, pages pp. 127-138, Colonial Williamsburg.
Dwyer, Tim and Marriott, Kim and Stuckey, Peter J. (2006) Fast Node Overlap Removal. In Healy, Patrick and Nikolov, Nikola S., Eds. Proceedings Graph Drawing, pages pp. 153-164, Limerick, Ireland.
Dwyer, Tim and Marriott, Kim and Stuckey, Peter J. (2007) Fast Node Overlap Removal - Correction. In Kaufmann, Michael and Wagner, Dorothea, Eds. Proceedings Graph Drawing, pages pp. 446-447, Karlsruhe, Germany.
Eades, Peter and Houle, Michael E. and Webber, Richard (1998) Finding the Best Viewpoints for Three-Dimensional Graph Drawings. In DiBattista, Giuseppe, Eds. Proceedings Graph Drawing, pages pp. 87-98, Rome, Italy.
Efrat, Alon and Erten, Cesim and Kobourov, Stephen G. (2004) Fixed-Location Circular-Arc Drawing of Planar Graphs. In Liotta, Giuseppe, Eds. Proceedings Graph Drawing, pages pp. 147-158, Perugia.
Liao, Chien-Chih and Lu, Hsueh-I. and Yen, Hsu-Chun (2002) Floor-Planning via Orderly Spanning Trees. In Mutzel, Petra and Jünger, Michael and Leipert, Sebastian, Eds. Proceedings Graph Drawing, pages pp. 367-377, Vienna, Austria.
Fiala, Jirí and Kratochvíl, Jan and Proskurowski, Andrzej (2002) Geometric Systems of Disjoint Representatives. In Goodrich, Michael T. and Kobourov, Stephen G., Eds. Proceedings Graph Drawing, pages pp. 110-117, Irvine, CA, USA.
Dillencourt, Michael B. and Eppstein, David and Hirschberg, Daniel S. (1998) Geometric Thickness of Complete Graphs. In Whitesides, Sue H., Eds. Proceedings Graph Drawing, pages pp. 102-110, Montréal, Canada.
Brandenburg, Franz J. (1998) Graph Clustering I: Cycles of Cliques. In Di Battista, Giuseppe, Eds. Proceedings Graph Drawing, pages pp. 158-168, Rome, Italy.
Roxborough, Tom and Sen, Arunabha (1998) Graph Clustering Using Multiway Ratio Cut (Software Demonstration). In Di Battista, Giuseppe, Eds. Proceedings Graph Drawing, pages pp. 291-296, Rome, Italy.
Friedrich, Carsten and Houle, Michael E. (2002) Graph Drawing in Motion II. In Mutzel, Petra and Jünger, Michael and Leipert, Sebastian, Eds. Proceedings Graph Drawing, pages pp. 220-231, Vienna, Austria.
Biedl, Therese and Marks, Joe and Ryall, Kathy and Whitesides, Sue (1998) Graph Multidrawing: Finding Nice Drawings Without Defining Nice. In Whitesides, Sue H., Eds. Proceedings Graph Drawing, pages pp. 347-355, Montréal, Canada.
He, Xin (1996) Grid Embedding of 4-Connected Plane Graphs. In Brandenburg, Franz J., Eds. Proceedings Graph Drawing, pages pp. 287-299, Passau, Germany.
Gajer, Pawel and G. Kobourov, Stephen (2001) GRIP: Graph dRawing with Intelligent Placement. In Marks, Joe, Eds. Proceedings Graph Drawing, pages pp. 222-228, Colonial Wiliamsburg.
Raitner, Marcus (2002) HGV: A Library for Hierarchies, Graphs, and Views. In Goodrich, Michael T. and Kobourov, Stephen G., Eds. Proceedings Graph Drawing, pages pp. 236-243, Irvine, CA, USA.
Lenhart, William and Liotta, Giuseppe (1996) How to Draw Outerplanar Minimum Weight Triangulations. In Brandenburg, Franz J., Eds. Proceedings Graph Drawing, pages pp. 373-384, Passau, Germany.
Brandes, Ulrik and Cornelsen, Sabine and Wagner, Dorothea (2001) How to Draw the Minimum Cuts of a Planar Graph
(Extended Abstract). In Marks, Joe, Eds. Proceedings Graph Drawing, pages pp. 103-114, Colonial Williamsburg.
Healy, Patrick and Nikolov, Nikola S. (2002) How to Layer a Directed Acyclic Graph. In Mutzel, Petra and Jünger, Michael and Leipert, Sebastian, Eds. Proceedings Graph Drawing, pages pp. 16-30, Vienna, Austria.
Dobkin, David P. and Gansner, Emden R. and Koutsofios, Eleftherios and North, Stephen (1998) Implementing a General-Purpose Edge Router. In Di Battista, Giuseppe, Eds. Proceedings Graph Drawing, pages pp. 262-271, Rome, Italy.
Gansner, Emden R. and North, Stephen (1998) Improved Force-Directed Layouts
. In Whitesides, Sue H., Eds. Proceedings Graph Drawing, pages pp. 364-373, Montréal, Canada.
Buchheim, Christoph and Jünger, Michael and Leipert, Sebastian (2002) Improving Walker's Algorithm to Run in Linear Time. In Goodrich, Michael T. and Kobourov, Stephen G., Eds. Proceedings Graph Drawing, pages pp. 344-353, Irvine, CA, USA.
North, Stephen (1996) Incremental Layout in DynaDAG. In Brandenburg, Franz J., Eds. Proceedings Graph Drawing, pages pp. 409-418, Passau, Germany.
Dwyer, Tim and Marriott, Kim and Wybrow, Michael (2007) Integrating Edge Routing into Force-Directed Layout. In Kaufmann, Michael and Wagner, Dorothea, Eds. Proceedings Graph Drawing, pages pp. 8-19, Karlsruhe, Germany.
Kratochvíl, Jan (1997) Intersection Graphs of Noncrossing Arc-Connected Sets in the Plane. In North, Stephen, Eds. Proceedings Symposium on Graph Drawing, GD '96, pages pp. 268-270, Berkeley, California,.
Bachl, Sabine (1999) Isomorphic Subgraphs. In Kratochvíl, Jan, Eds. Proceedings Graph Drawing, pages pp. 286-296, Stirín Castle, Czech Republic.
Papakostas, Achilleas and Tollis, Ioannis G. (1996) Issues in Interactive Orthogonal Graph Drawing. In Brandenburg, Franz J., Eds. Proceedings Graph Drawing, pages pp. 419-430, Passau, Germany.
Günther, Wolfgang and Schönfeld, Robby and Becker, Bernd and Molitor, Paul (2001) k-Layer Straightline Crossing Minimization by Speeding Up Sifting. In Marks, Joe, Eds. Proceedings Graph Drawing, pages pp. 253-258, Colonial Williamsburg.
Hasunuma, Toru (2004) Laying Out Iterated Line Digraphs Using Queues. In Liotta, Giuseppe, Eds. Proceedings Graph Drawing, pages pp. 202-213, Perugia.
Kikusts, Paulis and Rucevskis, Peteris (1996) Layout Algorithms of Graph-Like Diagrams for GRADE Windows Graphic Editors. In Brandenburg, Franz J., Eds. Proceedings Graph Drawing, pages pp. 361-364, Passau, Germany.
Benkert, Marc and Nöllenburg, Martin and Uno, Takeaki and Wolff, Alexander (2007) Minimizing Intra-Edge Crossings in Wiring Diagrams and Public Transport Maps. In Kaufmann, Michael and Wagner, Dorothea, Eds. Proceedings Graph Drawing, pages pp. 270-281, Karlsruhe, Germany.
Chrobak, Marek and Nakano, Shin-ichi (1995) Minimum-Width Grid Drawings of Plane Graphs (Extended Abstract). In Tamassia, Roberto and Tollis, Ioannis G., Eds. Proceedings Graph Drawing, pages pp. 104-110, Princeton.
Biedl, Therese and Lubiw, Anna and Spriggs, Michael (2006) Morphing Planar Graphs While Preserving Edge Directions. In Healy, Patrick and Nikolov, Nikola S., Eds. Proceedings Graph Drawing, pages pp. 13-24, Limerick, Ireland.
Wood, David R. (1999) Multi-dimensional Orthogonal Graph Drawing with Small Boxes(Extended Abstract). In Kratochvíl, Jan, Eds. Proceedings Graph Drawing, pages pp. 311-322, Stirín Castle, Czech Republic.
Schreiber, Falk and Skodinis, Konstantinos (1998) NP-Completeness of Some Tree-Clustering Problems
. In Whitesides, Sue H., Eds. Proceedings Graph Drawing, pages pp. 288-301, Montréal, Canada.
Zhu, Binhai and Deng, Xiaotie (1998) On Computing and Drawing Maxmin-Height Covering Triangulation. In Whitesides, Sue H., Eds. Proceedings Graph Drawing, pages pp. 464-466, Montréal, Canada.
Djidjev, Hristo (1995) On Drawing a Graph Convexly in the Plane (Extended Abstract). In Tamassia, Roberto and Tollis, Ioannis G., Eds. Proceedings Graph Drawing, pages pp. 76-83, Princeton.
Garg, Ashim (1995) On Drawing Angle Graphs (Extended Abstract). In Tamassia, Roberto and Tollis, Ioannis G., Eds. Proceedings Graph Drawing, pages pp. 84-95, Princeton.
Patrignani, Maurizio (2006) On Extending a Partial Straight-Line Drawing. In Healy, Patrick and Nikolov, Nikola S., Eds. Proceedings Graph Drawing, pages pp. 380-385, Limerick, Ireland.
Fößmeier, Ulrich and Heß, Carsten and Kaufmann, Michael (1998) On Improving Orthogonal Drawings: The 4M-Algorithm. In Whitesides, Sue H., Eds. Proceedings Graph Drawing, pages pp. 125-137, Montréal, Canada.
Chen, Ho-Lin and Lu, Hsueh-I. and Yen, Hsu-Chun (2001) On Maximum Symmetric Subgraphs. In Marks, Joe, Eds. Proceedings Graph Drawing, pages pp. 372-383, Colonial Williamsburg.
Bose, Prosenjit and Dean, Alice M. and Hutchinson, Joan P. and Shermer, Thomas (1997) On Rectangle Visibility Graphs. In North, Stephen, Eds. Proceedings Graph Drawing, pages pp. 25-44, Berkeley, California, USA.
Breu, Heinz and Kirkpatrick, David G. (1996) On the Complexity of Recognizing Intersection and Touching Graphs of Disks. In Brandenburg, Franz J., Eds. Proceedings Graph Drawing, pages pp. 88-98, Passau, Germany.
Godau, Michael (1995) On the difficulty of embedding planar graphs with inaccuracies (Extended Abstract). In Tamassia, Roberto and Tollis, Ioannis G., Eds. Proceedings Graph Drawing, pages pp. 254-261, Princeton.
Kakoulis, Konstantinos G. and Tollis, Ioannis G. (1997) On the Edge Label Placement Problem. In North, Stephen, Eds. Proceedings Graph Drawing, pages pp. 241-256, Berkeley, California, USA.
de Fraysseix, Hubert and Ossona de Mendez, Patrice (2001) On topological aspects of orientations. Discrete Mathematics 229(1-3):pp. 57-72.
Rahman, Md. Saidur and Naznin, Mahmuda and Nishizeki, Takao (2002) Orthogonal Drawings of Plane Graphs without Bends. In Mutzel, Petra and Jünger, Michael and Leipert, Sebastian, Eds. Proceedings Graph Drawing, pages pp. 392-406, Vienna, Austria.
Biedl, Therese and Brandenburg, Franz J. (2007) Partitions of Graphs into Trees. In Kaufmann, Michael and Wagner, Dorothea, Eds. Proceedings Graph Drawing, pages pp. 430-439, Karlsruhe, Germany.
Jünger, Michael and Leipert, Sebastian and Mutzel, Petra (1998) Pitfalls of Using PQ-Trees in Automatic Graph Drawing. In Di Battista, Giuseppe, Eds. Proceedings Graph Drawing, pages pp. 193-204, Rome, Italy.
Demaine, Erik D. and Demaine, Martin L. (1998) Planar Drawings of Origami Polyhedra
. In Whitesides, Whitesides,, Eds. Proceedings Graph Drawing, pages pp. 438-440, Montréal, Canada.
Gutwenger, Carsten and Mutzel, Petra (1998) Planar Polyline Drawings with Good Angular Resolution
. In Whitesides, Sue H., Eds. Proceedings Graph Drawing, pages pp. 167-182, Montréal, Canada.
Duncan, Christian A. and Kobourov, Stephen G. (2002) Polar Coordinate Drawing of Planar Graphs with Good Angular Resolution. In Mutzel, Petra and Jünger, Michael and Leipert, Sebastian, Eds. Proceedings Graph Drawing, pages pp. 407-421, Vienna, Austria.
Wittenburg, Kent and Weitzman, Louis (1997) Qualitative Visualization on Processes: Attributed Graph Layout and Focusing Techniques. In North, Stephen, Eds. Proceedings Graph Drawing, pages pp. 401-408, Berkeley, California, USA.
Bertolazzi, Paola and Di Battista, Giuseppe and Didimo, Walter (1998) Quasi-Upward planarity (extended abstract). In Whitesides, Sue H., Eds. Proceedings Graph Drawing, pages pp. 15-29, Montréal, Canada.
Heath, Lenwood S. and Pemmaraju, Sriram V. (1996) Recognizing Leveled-Planar Dags in Linear Time. In Brandenburg, Franz J., Eds. Proceedings Graph Drawing, pages pp. 300-311, Passau, Germany.
ElGindy, H. and Liotta, Giuseppe and Lubiw, Anna and Meijer, Henk and Whitesides, Sue (1995) Recognizing Rectangle of Influence Drawable Graphs (extended abstract). In Tamassia, Roberto and Tollis, Ioannis G., Eds. Proceedings Graph Drawing, pages pp. 352-363, Princeton.
Pach, János and Tóth, Géza (2002) Recognizing String Graphs Is Decidable. In Mutzel, Petra and Jünger, Michael and Leipert, Sebastian, Eds. Proceedings Graph Drawing, pages pp. 247-260, Vienna, Austria.
Rahman, Md. Saidur and Nishizeki, Takao and Ghosh, Shubhashis (2002) Rectangular Drawings of Planar Graphs (Extended Abstract). In Goodrich, Michael T. and Kobourov, Stephen G., Eds. Proceedings Graph Drawing, pages pp. 244-255, Irvine, CA, USA.
Lynn, Benjamin Y. S. and Symvonis, Antonios and Wood, David R. (2001) Refinement of Three-Dimensional Orthogonal Graph Drawings. In Marks, Joe, Eds. Proceedings Graph Drawing, pages pp. 308-320, Colonial Williamsburg.
Meyer, Bernd (1998) Self-Organizing Graphs - A Neural Network Perspective of Graph Layout. In Whitesides, Sue H., Eds. Proceedings Graph Drawing, pages pp. 246-262, Montréal, Canada.
Bachl, Walter (2002) Semi-dynamic Orthogonal Drawings of Planar Graphs (Extended Abstract). In Goodrich, Michael T. and Kobourov, Stephen G., Eds. Proceedings Graph Drawing, pages pp. 354-361, Irvine, CA, USA.
Alzohairi, Mohammad and Rival, Ivan (1997) Series-Parallel Planar Ordered Sets Have Pagenumber Two (Extended Abstract). In North, Stephen, Eds. Proceedings Graph Drawing, pages pp. 11-24, Berkeley, California, USA.
Erten, Cesim and Kobourov, Stephen G. and Le, Vu and Navabi, Armand (2004) Simultaneous Graph Drawing: Layout Algorithms and Visualization Schemes. In Liotta, Giuseppe, Eds. Proceedings Graph Drawing, pages pp. 437-449, Perugia.
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. In Goodrich, Michael T. and Kobourov, Stephen G., Eds. Proceedings Graph Drawing, pages pp. 332-343, Irvine, CA, USA.
Baburin, Danil E. (2002) Some Modifications of Sugiyama Approach. In Goodrich, Michael T. and Kobourov, Stephen G., Eds. Proceedings Graph Drawing, pages pp. 366-367, Irvine, CA, USA.
Garg, Ashim and Rusu, Adrian (2002) Straight-Line Drawings of Binary Trees with Linear Area and Arbitrary Aspect Ratio (Extended Abstract). In Goodrich, Michael T. and Kobourov, Stephen G., Eds. Proceedings Graph Drawing, pages pp. 320-331, Irvine, CA, USA.
Kyncl, Jan (2008) The Complexity of Several Realizability Problems for Abstract Topological Graphs. In Hong, Seok-Hee and Nishizeki, Takao and Quan, Wu, Eds. Proceedings Graph Drawing, pages pp. 137-158, Sidney, Australia.
Mutzel, Petra and Ziegler, Thomas (1999) The Constrained Crossing Minimization Problem. In Kratochvíl, Jan, Eds. Proceedings Graph Drawing, pages pp. 175-185, Stirín Castle, Czech Republic.
Jünger, Michael and Mutzel, Petra (1995) The Polyhedral Approach to the Maximum Planar Subgraph Problem: New Chances for Related Problems. In Tamassia, Roberto and Tollis, Ioannis G., Eds. Proceedings Graph Drawing, pages pp. 119-130, Princeton.
Jünger, Michael and Mutzel, Petra (1994) The Polyhedral Approach to the Maximum Planar Subgraph Problem: New Chances for Related Problems.
Di Battista, Giuseppe and Liotta, Giuseppe and Whitesides, Sue (1996) The Strength of Weak Proximity (Extended Abstract). In Brandenburg, Franz J., Eds. Proceedings Graph Drawing, pages pp. 178-189, Passau, Germany.
Healy, Patrick and Kuusik, Ago (1999) The Vertex-Exchange Graph: A New Concept for Multi-level Crossing Minimisation. In Kratochvíl, Jan, Eds. Proceedings Graph Drawing, pages pp. 205-216, Stirín Castle, Czech Republic.
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. In Di Battista, Giuseppe, Eds. Proceedings Graph Drawing, pages pp. 272-283, Rome, Italy.
Biedl, Therese (1998) Three Approaches to 3D-Orthogonal Box-Drawings
(Extended Abstract). In Whitesides, Sue H., Eds. Proceedings Graph Drawing, pages pp. 30-43, Montréal, Canada.
Hlinený, Petr (1998) Touching Graphs of Unit Balls. In DiBattista, Giuseppe, Eds. Proceedings Graph Drawing, pages pp. 350-358, Rome, Italy.
Di Giacomo, Emilio and Meijer, Henk (2004) Track Drawings of Graphs with Constant Queue Number. In Liotta, Giuseppe, Eds. Proceedings Graph Drawing, pages pp. 214-225, Perugia.
Newton, Matthew and Sykora, Ondrej and Vrt'o, Imrich (2002) Two New Heuristics for Two-Sided Bipartite Graph Drawing. In Goodrich, Michael T. and Kobourov, Stephen G., Eds. Proceedings Graph Drawing, pages pp. 312-319, Irvine, CA, USA.
Frick, Arne (1997) Upper Bounds on the Number of Hidden Nodes in Sugiyama's Algorithm. In North, Stephen, Eds. Proceedings Graph Drawing, pages pp. 169-183, Berkeley, California, USA.
do Nascimento, Hugo A.D. and Eades, Peter (2002) User Hints for Directed Graph Drawing. In Mutzel, Petra and Jünger, Michael and Leipert, Sebastian, Eds. Proceedings Graph Drawing, pages pp. 205-219, Vienna, Austria.
Brandes, Ulrik and Wagner, Dorothea (1998) Using Graph Layout to Visualize Train Interconnection Data
. In Whitesides, Sue H., Eds. Proceedings Graph Drawing, pages pp. 44-56, Montréal, Canada.
Eades, Peter and de Mendonça Neto, C. F. X. (1996) Vertex Splitting and Tension-Free Layout. In Brandenburg, Franz J., Eds. Proceedings Graph Drawing, pages pp. 202-211, Passau, Germany.
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. In Whitesides, Sue H., Eds. Proceedings Graph Drawing, pages pp. 403-412, Montréal, Canada.
Barouni, Ala Eddine and Jaoua, Ali and Zaguia, Nejib (1999) Visualizing Algorithms for the Design and Analysis of Survivable Networks. In Kratochvíl, Jan, Eds. Proceedings Graph Drawing, pages pp. 232-241, Stirín Castle, Czech Republic.
Brandes, Ulrik and Dwyer, Tim and Schreiber, Falk (2004) Visualizing Related Metabolic Pathways in Two and a Half Dimensions (Long Paper)
. In Liotta, Giuseppe, Eds. Proceedings Graph Drawing, pages pp. 111-122, Perugia.
Kuchem, Ruth and Wagner, Dorothea (1997) Wiring Edge-Disjoint Layouts. In North, Stephen, Eds. Proceedings Graph Drawing, pages pp. 271-285, Berkeley, California, USA.
This list was generated on Fri Jun 27 09:36:25 CEST 2008.
