Subject: M.999 Others
Number of records: 98.
Barequet, Gill (2001) $\omega$-Searchlight Obedient Graph Drawings. In Marks, Joe, Eds. Proceedings Graph Drawing, pages pp. 321-327, Colonial Williamsburg.
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.
Cruz, Isabel F. and Twarog, Joseph P. (1996) 3D Graph Drawing with Simulated Annealing. In Brandenburg, Franz J., Eds. Proceedings Graph Drawing, pages pp. 162-165, Passau, Germany.
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.
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.
Mohar, Bojan and Rosenstiehl, Pierre (1995) A flow approach to upward drawings of toroidal maps. In Tamassia, Roberto and Tollis, Ioannis G., Eds. Proceedings Graph Drawing, pages pp. 33-39, Princeton.
Dogrusoz, Ugur and Genc, Burkay (2002) A Framework for Complexity Management in Graph Visualization. In Goodrich, Michael T. and Kobourov, Stephen G., Eds. Proceedings Graph Drawing, pages pp. 368-369, Irvine, CA, USA.
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.
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.
Nöllenburg, Martin and Wolff, Alexander (2006) A Mixed-Integer Program for Drawing High-Quality Metro Maps. In Healy, Patrick and Nikolov, Nikola S., Eds. Proceedings Graph Drawing, pages pp. 321-333, Limerick, Ireland.
Gajer, Pawel and Goodrich, Michael T. and Kobourov, Stephen G. (2001) A Multi-dimensional Approach to Force-Directed Layouts of Large Graphs. In Marks, Joe, Eds. Proceedings Graph Drawing, pages pp. 211-221, Colonial Williamsburg.
Dogrusoz, U and Genc, B (2006) A Multi-Graph Approach to Complexity Management in Interactive Graph Visualization. Computers & Graphics 30(1):pp. 86-97.
Walshaw, C. (2001) A Multilevel Algorithm for Force-Directed Graph Drawing. In Marks, Joe, Eds. Proceedings Graph Drawing, pages pp. 171-182, Colonial Williamsburg.
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.
Luo, Junhui and Miriyala, Kanth (1995) A Practical Approach to Static Node Positioning. In Tamassia, Roberto and Tollis, Ioannis G., Eds. Proceedings Graph Drawing, pages pp. 436-443, Princeton.
Di Battista, Giuseppe and Patrignani, Maurizio and Vargiu, Francesco (1998) A Split&Push Approach to 3D Orthogonal Drawing
(Extended Abstract). In Whitesides, Sue H., Eds. Proceedings Graph Drawing, pages pp. 87-101, Montréal, Canada.
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.
Gelfand, Natasha and Tamassia, Roberto (1998) Algorithmic Patterns for Orthogonal Graph Drawing. In Whitesides, Sue H., Eds. Proceedings Graph Drawing, pages pp. 138-152, Montréal, Canada.
Bertault, François and Miller, Mirka (1999) An Algorithm for Drawing Compound Graphs. In Kratochvíl, Jan, Eds. Proceedings Gaph Drawing, pages pp. 197-204, Stirín Castle, Czech Republic.
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.
Zhang, Huaming and He, Xin (2006) An Application of Well-Orderly Trees in Graph Drawing. In Healy, Patrick and Nikolov, Nikola S., Eds. Proceedings Graph Drawing, pages pp. 458-467, Limerick, Ireland.
Dujmovic, Vida and Whitesides, Sue (2002) An Efficient Fixed Parameter Tractable Algorithm for 1-Sided Crossing Minimization. In Goodrich, Michael T. and Kobourov, Stephen G., Eds. Proceedings Graph Drawing, pages pp. 118-129, Irvine, CA, USA.
Brandenburg, Franz J. and Himsolt, Michael and Rohrer, Christoph (1996) An Experimental Comparison of Force-Directed and Randomized Graph Drawing Algorithms. In Brandenburg, Franz J., Eds. Proceedings Graph Drawing, pages pp. 76-87, Passau, Germany.
Brandes, Ulrik and Schlieper, Barbara (2007) Angle and Distance Constraints on Tree Drawings. In Kaufmann, Michael and Wagner, Dorothea, Eds. Proceedings Graph Drawing, pages pp. 54-65, Karlsruhe, Germany.
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.
Shahrokhi, Farhad and Sýkora, Ondrej and Székely, László A. and Vrt'o, Imrich (1998) Bipartite Crossing Numbers of Meshes and Hypercubes. In DiBattista, Giuseppe, Eds. Proceedings Graph Drawing, pages pp. 37-46, Rome, Italy.
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.
Brandes, Ulrik and Kenis, Patrick and Wagner, Dorothea (1999) Centrality in Policy Network Drawings (Extended Abstract). In Kratochvíl, Jan, Eds. Proceedings Graph Drawing, pages pp. 250-258, Stirín Castle, Czech Republic.
Shieh, Fwu-Shan and McCreary, Carolyn (2001) Clan-Based Incremental Drawing. In Marks, Joe, Eds. Proceedings Graph Drawing, pages pp. 384-396, Colonial Williamsburg.
Dwyer, Tim and Marriott, Kim (2008) Constrained Stress Majorization Using Diagonally Scaled Gradient Projection. In Hong, Seok-Hee and Nishizeki, Takao and Quan, Wu, Eds. Proceedings Graph Drawing, pages pp. 219-230, Sidney, Australia.
Eppstein, David and Goodrich, Michael T. and Meng, Jeremy Yu (2006) Delta-confluent Drawings. In Healy, Patrick and Nikolov, Nikola S., Eds. Proceedings Graph Drawing, pages pp. 165-176, Limerick, Ireland.
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.
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.
Mohar, Bojan (1999) Drawing Graphs in the Hyperbolic Plane. In Kratochvíl, Jan, Eds. Proceedings Graph Drawing, pages pp. 127-136, Stirín Castle, Czech Republic.
Papadopoulos, Charis and Voglis, Constantinos (2006) Drawing Graphs using Modular Decomposition. In Healy, Patrick and Nikolov, Nikola S., Eds. Proceedings Graph Drawing, pages pp. 343-354, Limerick, Ireland.
Bertault, François and Eades, Peter (2001) Drawing Hypergraphs in the Subset Standard (Short Demo Paper). In Marks, Joe, Eds. Proceedings Graph Drawing, pages pp. 164-169, Colonial Williamsburg.
Aggarwal, Alok and Kosaraju, Rao and Pop, Mihai (1998) Drawing of Two-Dimensional Irregular Meshes. In Whitesides, Sue H., Eds. Proceedings Graph Drawing, pages pp. 1-14, Montréal, Canada.
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 Fleischer, Daniel and Puppe, Thomas (2006) Dynamic Spectral Layout of Small Worlds. In Healy, Patrick and Nikolov, Nikola S., Eds. Proceedings Graph Drawing, pages pp. 25-36, Limerick, Ireland.
Frati, Fabrizio (2007) Embedding Graphs Simultaneously with Fixed Edges. In Kaufmann, Michael and Wagner, Dorothea, Eds. Proceedings Graph Drawing, pages pp. 108-113, 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.
Noik, Emanuel G. (1995) Encoding Presentation Emphasis Algorithms for Graphs. In Tamassia, Roberto and Tollis, Ioannis G., Eds. Proceedings Graph Drawing, pages pp. 428-435, Princeton.
Quigley, Aaron and Eades, Peter (2001) FADE: Graph Drawing, Clustering, and Visual Abstraction. In Marks, Joe, Eds. Proceedings Graph Drawing, pages pp. 197-210, Colonial Williamsburg.
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.
Formella, Arno and Keller, Jörg (1996) Generalized Fisheye Views of Graphs. In Brandenburg, Franz J., Eds. Proceedings Graph Drawing, pages pp. 242-253, Passau, Germany.
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.
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.
Harel, David and Koren, Yehuda (2002) Graph Drawing by High-Dimensional Embedding. In Goodrich, Michael T. and Kobourov, Stephen G., Eds. Proceedings Graph Drawing, pages pp. 207-219, Irvine, CA, USA.
Storey, Margaret-Anne D. and Müller, Hausi A. (1996) Graph Layout Adjustment Strategies. In Brandenburg, Franz J., Eds. Proceedings Graph Drawing, pages pp. 487-499, Passau, Germany.
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.
Diehl, Stephan and Görg, Carsten (2002) Graphs, They Are Changing -Dynamic Graph Drawing for a Sequence of Graphs. In Goodrich, Michael T. and Kobourov, Stephen G., Eds. Proceedings Graph Drawing, pages pp. 23-30, Irvine, CA, USA.
Even, S. and Granot, G. (1995) Grid Layouts of Block Diagrams - Bounding the Number of Bends in Each Connection (Extended Abstract). In Tamassia, Roberto and Tollis, Ioannis G., Eds. Proceedings Graph Drawing, pages pp. 64-75, Princeton.
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.
Wybrow, Michael and Marriott, Kim and Stuckey, Peter J. (2006) Incremental Connector Routing. In Healy, Patrick and Nikolov, Nikola S., Eds. Proceedings Graph Drawing, pages pp. 446-457, Limerick, Ireland.
Demetrescu, Camil and Di Battista, Giuseppe and Finocchi, Irene and Liotta, Giuseppe and Patrignani, Maurizio and Pizzonia, Maurizio (1999) Infinite Trees and the Future (Extended Abstract). In Kratochvíl, Jan, Eds. Proceedings Graph Drawing, pages pp. 379-391, Stirín Castle, Czech Republic.
Lin, Tao and Eades, Peter (1995) Integration of Declarative and Algorithmic Approaches for Layout Creation. In Tamassia, Roberto and Tollis, Ioannis G., Eds. Proceedings Graph Drawing, pages pp. 376-387, Princeton.
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.
Huang, Weidong and Hong, Seok-Hee and Eades, Peter (2006) Layout effects on sociogram perception. In Healy, Patrick and Nikolov, Nikola S., Eds. Proceedings Graph Drawing, pages pp. 262-273, Limerick, Ireland.
Wood, David R. (2001) Lower Bounds for the Number of Bends in Three-Dimensional Orthogonal Graph Drawings. In Marks, Joe, Eds. Proceedings Graph Drawing, pages pp. 259-271, Colonial Williamsburg.
Saalfeld, Alan (1995) Map Generalization as a Graph Drawing Problem. In Tamassia, Roberto and Tollis, Ioannis G., Eds. Proceedings Graph Drawing, pages pp. 444-451, Princeton.
Lenhart, William and Liotta, Giuseppe (2001) Minimum Weight Drawings of Maximal Triangulations (Extended Abstract). In Marks, Joe, Eds. Proceedings Graph Drawing, pages pp. 338-349, Colonial Williamsburg.
Kobourov, Stephen G. and Landis, Matthew (2007) Morphing Planar Graphs in Spherical Space. In Kaufmann, Michael and Wagner, Dorothea, Eds. Proceedings Graph Drawing, pages pp. 306-317, Karlsruhe, Germany.
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.
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.
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.
Hutchinson, Joan P. (2001) On Polar Visibility Representations of Graphs. In Marks, Joe, Eds. Proceedings Graph Drawing, pages pp. 63-76, Colonial Williamsburg.
de Fraysseix, Hubert and Ossona de Mendez, Patrice (2007) On representations by contact and intersection of segments. Algorithmica 47(4):pp. 453-463.
Calamoneri, Tiziana and Massini, Annalisa (1998) On Three-Dimensional Layout of Interconnection Networks (Extended Abstract). In DiBattista, Giuseppe, Eds. Proceedings Graph Drawing, pages pp. 64-75, Rome, Italy.
Di Giacomo, Emilio and Liotta, Giuseppe and Patrignani, Maurizio (2002) Orthogonal 3D Shapes of Theta Graphs. In Goodrich, Michael T. and Kobourov, Stephen G., Eds. Proceedings Graph Drawing, pages pp. 142-149, Irvine, CA, USA.
Batagelj, Vladimir and Mrvar, Andrej and Zaversnik, Matjaz (1999) Partitioning Approach to Visualization of Large Graphs. In Kratochvíl, Jan, Eds. Proceedings Graph Drawing, pages pp. 90-97, Stirín Castle, Czech Republic.
Wood, David R. and Telle, Jan Arne (2007) Planar Decompositions and the Crossing Number of Graphs with an Excluded Minor. In Kaufmann, Michael and Wagner, Dorothea, Eds. Proceedings Graph Drawing, pages pp. 150-161, Karlsruhe, Germany.
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.
Biedl, Therese and Bretscher, Anna and Meijer, Henk (1999) Rectangle of Influence Drawings of Graphs without Filled 3-Cycles. In Kratochvíl, Jan, Eds. Proceedings Graph Drawing, pages pp. 359-368, Stirín Castle, Czech Republic.
Kimelman, Doug and Leban, Bruce and Roth, Tova and Zernik, Dror (1995) Reduction of Visual Complexity in Dynamic Graphs. In Tamassia, Roberto and Tollis, Ioannis G., Eds. Proceedings Graph Drawing, pages pp. 218-225, Princeton.
Six, Janet M. and Kakoulis, Konstantinos G. and Tollis, Ioannis G. (1998) Refinement of Orthogonal Graph Drawings. In Whitesides, Sue H., Eds. Proceedings Graph Drawing, pages pp. 302-315, Montréal, Canada.
Civril, Ali and Magdon-Ismail, Malik and Bocek-Rivele, Eli (2006) SDE: Graph Drawing Using Spectral Distance Embedding. In Healy, Patrick and Nikolov, Nikola S., Eds. Proceedings Graph Drawing, pages pp. 512-513, Limerick, Ireland.
Cappos, Justin and Estrella-Balderrama, Alejandro and Fowler, J. Joseph and Kobourov, Stephen G. (2007) Simultaneous Graph Embedding with Bends and Circular Arcs. In Kaufmann, Michael and Wagner, Dorothea, Eds. Proceedings Graph Drawing, pages pp. 95-107, Karlsruhe, Germany.
Civril, Ali and Magdon-Ismail, Malik and Bocek-Rivele, Eli (2007) SSDE: Fast Graph Drawing Using Sampled Spectral Distance Embedding. In Kaufmann, Michael and Wagner, Dorothea, Eds. Proceedings Graph Drawing, pages pp. 30-41, Karlsruhe, Germany.
Dwyer, Tim and Koren, Yehuda and Marriott, Kim (2006) Stress Majorization with Orthogonal Ordering Constraints. In Healy, Patrick and Nikolov, Nikola S., Eds. Proceedings Graph Drawing, pages pp. 141-152, Limerick, Ireland.
de Fraysseix, Hubert and Ossona de Mendez, Patrice (2007) Stretching of Jordan arc contact systems. Discrete Applied Mathematics 155(9):pp. 1079-1095.
Arvo, James (2002) Techniques for Interactive Graph Drawing. In Goodrich, Michael T. and Kobourov, Stephen G., Eds. Proceedings Graph Drawing, pages pp. 380-380, Irvine, CA, USA.
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.
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.
Cohen, Robert F. and Eades, Peter and Lin, Tao and Ruskey, Frank (1995) Three-Dimensional Graph Drawing. In Tamassia, Roberto and Tollis, Ioannis G., Eds. Proceedings Graph Drawing, pages pp. 1-11, Princeton.
Eppstein, David (2007) Upright-Quad Drawing of st-Planar Learning Spaces. In Kaufmann, Michael and Wagner, Dorothea, Eds. Proceedings Graph Drawing, pages pp. 282-293, Karlsruhe, Germany.
Jourdan, Guy-Vincent and Rival, Ivan and Zaguia, Nejib (1995) Upward Drawing on the Plane Grid Using Less Ink
(Extended Abstract). In Tamassia, Roberto and Tollis, Ioannis G., Eds. Proceedings Graph Drawing, pages pp. 318-327, Princeton.
Abello, James and Kumar, Krishna (1995) Visibility Graphs and Oriented Matroids (Extended Abstract). In Tamassia, Roberto and Tollis, Ioannis G., Eds. Proceedings Graph Drawing, pages pp. 147-158, Princeton.
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.
Lehmann, Katharina A. and Kottler, Stephan (2007) Visualizing Large and Clustered Networks. In Kaufmann, Michael and Wagner, Dorothea, Eds. Proceedings Graph Drawing, pages pp. 240-251, Karlsruhe, Germany.
Liotta, Giuseppe and Meijer, Henk (1999) Voronoi Drawings of Trees. In Kratochvíl, Jan, Eds. Proceedings Graph Drawing, pages pp. 369-378, Stirín Castle, Czech Republic.
This list was generated on Fri Jun 27 09:36:41 CEST 2008.
