Subject: P.720 Straight-line
Number of records: 62.
Jünger, Michael and Mutzel, Petra (1996) 2-Layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms.
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.
Six, Janet M. and Tollis, Ioannis G. (1999) A Framework for Circular Drawings of Networks. In Kratochvíl, Jan, Eds. Proceedings Graph Drawing, pages pp. 107-116, Stirín Castle, Czech Republic.
Hong, Seok-Hee and Eades, Peter (2004) A Linear Time Algorithm for Constructing Maximally Symmetric Straight-Line Drawings of Planar Graphs. In Pach, János, Eds. Proceedings Graph Drawing, pages pp. 307-317, New York.
Garg, Ashim and Rusu, Adrian (2004) A More Practical Algorithm for Drawing Binary Trees in Linear Area with Arbitrary Aspect Ratio. In Liotta, Giuseppe, Eds. Proceedings Graph Drawing, pages pp. 159-165, Perugia.
Frati, Fabrizio and Patrignani, Maurizio (2008) A Note on Minimum-Area Straight-line Drawings of Planar Graphs. In Hong, Seok-Hee and Nishizeki, Takao and Quan, Wu, Eds. Proceedings Graph Drawing, pages pp. 339-344, Sidney, Australia.
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.
Garg, Ashim and Rusu, Adrian (2004) Area-Efficient Drawings of Outerplanar Graphs. In Liotta, Giuseppe, Eds. Proceedings Graph Drawing, pages pp. 129-134, Perugia.
Di Giacomo, Emilio and Didimo, Walter and Liotta, Giuseppe and Meijer, Henk (2004) Computing Radial Drawings on the Minimum Number of Circles. In Pach, János, Eds. Proceedings Graph Drawing, pages pp. 250-261, New York.
Nagamochi, Hiroshi and Kuroya, Katsutoshi (2004) Convex Drawing for c-Planar Biconnected Clustered Graphs. In Liotta, Giuseppe, Eds. Proceedings Graph Drawing, pages pp. 369-380, Perugia.
Miura, Kazuyuki and Azuma, Machiko and Nishizeki, Takao (2006) Convex Drawings of Plane Graphs of Minimum Outer Apices. In Healy, Patrick and Nikolov, Nikola S., Eds. Proceedings Graph Drawing, pages pp. 297-308, Limerick, Ireland.
Eschbach, Thomas and Günther, Wolfgang and Drechsler, Rolf and Becker, Bernd (2002) Crossing Reduction by Windows Optimization. In Goodrich, Michael T. and Kobourov, Stephen G., Eds. Proceedings Graph Drawing, pages pp. 285-294, Irvine, CA, USA.
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.
Keszegh, Balázs and Pach, János and Pálvölgyi, Dömötör and Tóth, Géza (2007) Drawing cubic graphs with at most five slopes. In Kaufmann, Michael and Wagner, Dorothea, Eds. Proceedings Graph Drawing, pages pp. 114-125, Karlsruhe, Germany.
Hachul, Stefan and Jünger, Michael (2004) Drawing Large Graphs with a Potential-Field-Based Multilevel Algorithm (Extended Abstract)
. In Pach, János, Eds. Proceedings Graph Drawing, pages pp. 285-295, New York.
Andersen, Reid and Chung, Fan and Lu, Lincoln (2004) Drawing Power Law Graphs. In Pach, János, Eds. Proceedings Graph Drawing, pages pp. 12-17, New York.
Eades, Peter and Garvan, Patrick (1996) Drawing Stressed Planar Graphs in Three Dimensions. In Brandenburg, Franz J., Eds. Proceedings Graph Drawing, pages pp. 212-223, Passau, Germany.
Baur, Michael and Brandes, Ulrik and Gaertler, Marco and Wagner, Dorothea (2004) Drawing the AS Graph in 2.5 Dimensions
. In Pach, János, Eds. Proceedings Graph Drawing, pages pp. 43-48, New York.
Jünger, Michael and Mutzel, Petra (1995) Exact and Heuristic Algorithms for 2-Layer Straightline Crossing Minimization.
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.
Pach, János and Pinchasi, Rom and Tardos, Gábor and Tóth, Géza (2003) Geometric Graphs with No Self-intersecting Path of Length Three. In Goodrich, Michael T. and Kobourov, Stephen G., Eds. Proceedings Graph Drawing, pages pp. 295-311, 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.
Gansner, Emden R. and Koren, Yehuda and North, Stephen (2004) Graph Drawing by Stress Majorization. In Pach, János, Eds. Proceedings Graph Drawing, pages pp. 239-250, New York.
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.
Miura, Kazuyuki and Nakano, Shin-ichi and Nishizeki, Takao (1999) Grid Drawings of Four-Connected Plane Graphs. In Kratochvíl, Jan, Eds. Proceedings Graph Drawing, pages pp. 145-154, Stirín Castle, Czech Republic.
He, Xin (1996) Grid Embedding of 4-Connected Plane Graphs. In Brandenburg, Franz J., Eds. Proceedings Graph Drawing, pages pp. 287-299, Passau, Germany.
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.
Buchheim, Christoph and Jünger, Michael and Leipert, Sebastian (2002) Improving Walker's Algorithm to Run in Linear Time.
Krug, Marcus and Wagner, Dorothea (2008) Minimizing the Area for Planar Straight-Line Grid Drawings. In Hong, Seok-Hee and Nishizeki, Takao and Quan, Wu, Eds. Proceedings Graph Drawing, pages pp. 207-212, Sidney, Australia.
Eades, Peter and Feng, Qing-Wen (1997) Multilevel Visualization of Clustered Graphs. In North, Stephen, Eds. Proceedings Graph Drawing, pages pp. 101-112, Berkeley, California, USA.
Rahman, Md. Saidur and Egi, Noritsugu and Nishizeki, Takao (2006) No-Bend Orthogonal Drawings of Series-Parallel Graphs. In Healy, Patrick and Nikolov, Nikola S., Eds. Proceedings Graph Drawing, pages pp. 409-420, Limerick, Ireland.
Shahrokhi, Farhad and Vrt'o, Imrich (1999) On 3-Layer Crossings and Pseudo Arrangements. In Kratochvíl, Jan, Eds. Proceedings Graph Drawing, pages pp. 225-231, Stirín Castle, Czech Republic.
Bose, Prosenjit (1998) On Embedding an Outer-Planar Graph in a Point Set. In DiBattista, Giuseppe, Eds. Proceedings Graph Drawing, pages pp. 25-36, Rome, Italy.
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.
Hutchinson, Joan P. and Shermer, Thomas and Vince, Andrew (1996) On Representations of Some Thickness-Two Graphs. In Brandenburg, Franz J., Eds. Proceedings Graph Drawing, pages pp. 324-332, Passau, Germany.
Miura, Kazuyuki and Matsuno, Tetsuya and Nishizeki, Takao (2007) Open Rectangle-of-Influence Drawings of Inner Triangulated Plane Graphs. In Kaufmann, Michael and Wagner, Dorothea, Eds. Proceedings Graph Drawing, pages pp. 138-149, Karlsruhe, Germany.
Bose, Prosenjit and McAllister, Michael and Snoeyink, Jack (1996) Optimal Algorithms to Embed Trees in a Point Set. In Brandenburg, Franz J., Eds. Proceedings Graph Drawing, pages pp. 64-75, Passau, Germany.
Crescenzi, P. and Piperno, A. (1995) Optimal-area upward drawings of AVL trees (Extended abstract). In Tamassia, Roberto and Tollis, Ioannis G., Eds. Proceedings Graph Drawing, pages pp. 307-317, Princeton.
Chan, Timothy and Goodrich, Michael T. and Kosaraju, Rao and Tamassia, Roberto (1997) Optimizing Area and Aspect Ratio in Straight-Line Orthogonal Tree Drawings. In North, Stephen, Eds. Proceedings Graph Drawing, pages pp. 63-75, Berkeley, California, USA.
Chen, Ho-Lin and Yen, Hsu-Chun (1999) Orthogonal and Straight-Line Drawings of Graphs with Succinct Representations. In Kratochvíl, Jan, Eds. Proceedings Graph Drawing, pages pp. 416-417, Stirín Castle, Czech Republic.
Dujmovic, Vida and Morin, Pat and Wood, David R. (2002) Path-Width and Three-Dimensional Straight-Line Grid Drawings of Graphs. In Goodrich, Michael T. and Kobourov, Stephen G., Eds. Proceedings Graph Drawing, pages pp. 42-53, Irvine, CA, USA.
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.
Suderman, Matthew (2006) Proper and Planar Drawings of Graphs on Three Layers. In Healy, Patrick and Nikolov, Nikola S., Eds. Proceedings Graph Drawing, pages pp. 434-445, Limerick, Ireland.
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.
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.
Barth, Wilhelm and Jünger, Michael and Mutzel, Petra (2002) Simple and Efficient Bilayer Cross Counting.
Barth, Wilhelm and Jünger, Michael and Mutzel, Petra (2002) Simple and Efficient Bilayer Cross Counting. In Goodrich, Michael T. and Kobourov, Stephen G., Eds. Proceedings Graph Drawing, pages pp. 130-141, Irvine, CA, USA.
Di Battista, Giuseppe and Frati, Fabrizio (2006) Small Area Drawings of Outerplanar Graphs. In Healy, Patrick and Nikolov, Nikola S., Eds. Proceedings Graph Drawing, pages pp. 89-100, Limerick, Ireland.
Eades, Peter and Feng, Qing-Wen and Lin, Xuemin (1997) Straight-Line Drawing Algorithms for Hierarchical Graphs and Clustered Graphs. In North, Stephen, Eds. Proceedings Graph Drawing, pages pp. 113-128, Berkeley, California, USA.
Fusy, Eric (2007) Straight-line drawing of quadrangulations. In Kaufmann, Michael and Wagner, Dorothea, Eds. Proceedings Graph Drawing, pages pp. 234-239, Karlsruhe, Germany.
Di Giacomo, Emilio and Didimo, Walter (2004) Straight-Line Drawings of 2-Outerplanar Graphs on Two Curves (Extended Abstract)
. In Liotta, Giuseppe, Eds. Proceedings Graph Drawing, pages pp. 419-424, Perugia.
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.
Basalaj, Wojciech and Eilbeck, Karen (1999) Straight-Line Drawings of Protein Interactions. In Kratochvíl, Jan, Eds. Proceedings Graph Drawing, pages pp. 259-266, Stirín Castle, Czech Republic.
Felsner, Stefan and Liotta, Giuseppe and Wismath, Stephen (2002) Straight-Line Drawings on Restricted Integer Grids in Two and Three Dimensions (Extended Abstract). In Mutzel, Petra and Jünger, Michael and Leipert, Sebastian, Eds. Proceedings Graph Drawing, pages pp. 328-342, Vienna, Austria.
Frati, Fabrizio (2008) Straight-Line Orthogonal Drawings of Binary and Ternary Trees. In Hong, Seok-Hee and Nishizeki, Takao and Quan, Wu, Eds. Proceedings Graph Drawing, pages pp. 76-87, Sidney, Australia.
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.
Dujmovic, Vida and Wood, David R. (2004) Three-Dimensional Grid Drawings with Sub-quadratic Volume. In Liotta, Giuseppe, Eds. Proceedings Graph Drawing, pages pp. 190-201, Perugia.
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.
Fusy, Eric (2006) Transversal structures on triangulations, with application to straight-line drawing. In Healy, Patrick and Nikolov, Nikola S., Eds. Proceedings Graph Drawing, pages pp. 177-188, Limerick, Ireland.
Kaufmann, Michael and Vrto, Imrich and Geyer, Markus (2006) Two trees which are self-intersecting when drawn simultaneously. In Healy, Patrick and Nikolov, Nikola S., Eds. Proceedings Graph Drawing, pages pp. 201-210, Limerick, Ireland.
Matuszewski, Christian and Schönfeld, Robby and Molitor, Paul (1999) Using Sifting for k-Layer Straightline Crossing Minimization. In Kratochvíl, Jan, Eds. Proceedings Graph Drawing, pages pp. 217-224, Stirín Castle, Czech Republic.
Hong, Seok-Hee and Murtagh, Tom (2004) Visualisation of Large and Complex Networks Using PolyPlane. In Pach, János, Eds. Proceedings Graph Drawing, pages pp. 471-481, New York.
This list was generated on Fri Jun 27 09:36:57 CEST 2008.
