Subject: P.600.700 Orthogonal
Number of records: 73.
Brandes, Ulrik and Wagner, Dorothea (1998) A Bayesian Paradigm for Dynamic Graph Layout. In Di Battista, Giuseppe, Eds. Proceedings Graph Drawing, pages pp. 236-247, Rome, Italy.
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.
Rahman, Md. Saidur and Nakano, Shin-Ichi and Nishizeki, Takao (1998) A Linear Algorithm for Optimal Orthogonal Drawings of Triconnected Cubic Plane Graphs. In DiBattista, Giuseppe, Eds. Proceedings Graph Drawing, pages pp. 99-110, Rome, Italy.
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.
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.
Patrignani, Maurizio (2004) A Note on the Self-similarity of Some Orthogonal Drawings. In Pach, János, Eds. Proceedings Graph Drawing, pages pp. 389-394, New York.
Papakostas, Achilleas and Tollis, Ioannis G. (1997) A Pairing Technique for Area-Efficient Orthogonal Drawings. In North, Stephen, Eds. Proceedings Graph Drawing, pages pp. 355-370, Berkeley, California, USA.
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.
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.
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.
Fößmeier, Ulrich and Kaufmann, Michael (1998) Algorithms and Area Bounds for Nonplanar Orthogonal Drawings. In DiBattista, Giuseppe, Eds. Proceedings Graph Drawing, pages pp. 134-145, Rome, Italy.
Eppstein, David (2004) Algorithms for Drawing Media. In Pach, János, Eds. Proceedings Graph Drawing, pages pp. 173-183, New York.
Garg, Ashim and Liotta, Giuseppe (1999) Almost Bend-Optimal Planar Orthogonal Drawings of Biconnected Degree-3 Planar Graphs in Quadratic Time. In Kratochvíl, Jan, Eds. Proceedings September 15-19, 1999, pages pp. 38-48, Stirín Castle, Czech Republic.
Wood, David R. (1998) An Algorithm for Three-Dimensional Orthogonal Graph Drawing. In Whitesides, Sue H., Eds. Proceedings Graph Drawing, pages pp. 332-346, Montréal, Canada.
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.
Bekos, Michael A. and Kaufmann, Michael and Symvonis, Antonios and Wolff, Alexander (2004) Boundary Labeling: Models and Efficient Algorithms for Rectangular Maps. In Pach, János, Eds. Proceedings Graph Drawing, pages pp. 49-59, New York.
Wood, David R. (2002) Bounded Degree Book Embeddings and Three-Dimensional Orthogonal Graph Drawing. In Mutzel, Petra and Jünger, Michael and Leipert, Sebastian, Eds. Proceedings Graph Drawing, pages pp. 312-327, Vienna, Austria.
Stola, Jan (2008) Colorability in Orthogonal Graph Drawing. In Hong, Seok-Hee and Nishizeki, Takao and Quan, Wu, Eds. Proceedings Graph Drawing, pages pp. 327-338, Sidney, Australia.
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.
Binucci, Carla and Didimo, Walter and Liotta, Giuseppe and Nonato, Maddalena (2002) Computing Labeled Orthogonal Drawings. In Goodrich, Michael T. and Kobourov, Stephen G., Eds. Proceedings Graph Drawing, pages pp. 66-73, Irvine, CA, USA.
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.
Eades, Peter and Feng, Qing-Wen (1998) Drawing Clustered Graphs on an Orthogonal Grid. In Di Battista, Giuseppe, Eds. Proceedings Graph Drawing, pages pp. 146-157, Rome, Italy.
Fößmeier, Ulrich and Kaufmann, Michael (1996) Drawing High Degree Graphs with Low Bend Numbers. In Brandenburg, Franz J., Eds. Proceedings Graph Drawing, pages pp. 254-266, Passau, Germany.
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.
Papakostas, Achilleas and Six, Janet M. and Tollis, Ioannis G. (1997) Experimental and Theoretical Results in Interactive Orthogonal Graph Drawing. In North, Stephen, Eds. Proceedings Graph Drawing, pages pp. 371-386, Berkeley, California, USA.
Miura, Kazuyuki and Miyazawa, Ayako and Nishizeki, Takao (2002) Extended Rectangular Drawings of Plane Graphs with Designated Corners (Extended Abstract). In Goodrich, Michael T. and Kobourov, Stephen G., Eds. Proceedings Graph Drawing, pages pp. 256-267, Irvine, CA, USA.
Seemann, Jochen (1998) Extending the Sugiyama Algorithm for Drawing UML Class Diagrams: Towards Automatic Layout of Object-Oriented Software Diagrams. In DiBattista, Giuseppe, Eds. Proceedings Graph Drawing, pages pp. 415-424, Rome, Italy.
Eiglsperger, Markus and Kaufmann, Michael (2002) Fast Compaction for Orthogonal Drawings with Vertices of Prescribed Size. In Mutzel, Petra and Jünger, Michael and Leipert, Sebastian, Eds. Proceedings Graph Drawing, pages pp. 124-138, Vienna, Austria.
Closson, M. and Gartshore, S. and Johansen, John and Wismath, Stephen (1999) Fully Dynamic 3-Dimensional Orthogonal Graph Drawing. In Kratochvíl, Jan, Eds. Proceedings Graph Drawing, pages pp. 49-58, Stirín Castle, Czech Republic.
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.
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.
Didimo, Walter and Leonforte, Antonio (1998) GRID: An Intercative Tool for Computing Orthogonal Drawings with the Minimum Number of Bends. In DiBattista, Giuseppe, Eds. Proceedings Graph Drawing, pages pp. 309-316, Rome, Italy.
Papakostas, Achilleas and Tollis, Ioannis G. (1995) Improved Algorithms and Bounds for Orthogonal Drawings. In Tamassia, Roberto and Tollis, Ioannis G., Eds. Proceedings Graph Drawing, pages pp. 40-51, Princeton.
Papakostas, Achilleas and Tollis, Ioannis G. (1998) Incremental Orthogonal Graph Drawing in Three Dimensions. In DiBattista, Guiseppe, Eds. Proceedings Graph Drawing, pages pp. 52-63, Rome, Italy.
Fößmeier, Ulrich (1998) Interactive Orthogonal Graph Drawing: Algorithms and Bounds. In DiBattista, Giuseppe, Eds. Proceedings Graph Drawing, pages pp. 111-123, Rome, Italy.
Bridgeman, Stina and Fanto, Jody and Garg, Ashim and Tamassia, Roberto and Vismara, Luca (1998) InteractiveGiotto: An Algorithm for Interactive Orthogonal Graph Drawing. In Di Battista, Giuseppe, Eds. Proceedings Graph Drawing, pages pp. 303-308, Rome, Italy.
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.
Binucci, Carla and Didimo, Walter and Liotta, Giuseppe and Nonato, Maddalena (2002) Labeling Heuristics for Orthogonal Drawings. In Mutzel, Petra and Jünger, Michael and Leipert, Sebastian, Eds. Proceedings Graph Drawing, pages pp. 139-153, Vienna, Austria.
Sander, Georg (2003) Layout of Directed Hypergraphs with Orthogonal Hyperedges. In Proceedings Graph Drawing 2003 (but only the short version, not the full version).
Sander, Georg (2004) Layout of Directed Hypergraphs with Orthogonal Hyperedges (Extended Abstract)
. In Liotta, Giuseppe, Eds. Proceedings Graph Drawing, pages pp. 381-386, Perugia.
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.
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.
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.
Biedl, Therese (1996) New Lower Bounds for Orthogonal Graph Drawings. In Brandenburg, Franz J., Eds. Proceedings Graph Drawing, pages pp. 28-39, Passau, Germany.
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.
Rahman, Md. Saidur and Egi, Noritsugu and Nishizeki, Takao (2004) No-Bend Orthogonal Drawings of Subdivisions of Planar Triconnected Cubic Graphs (Extended Abstract)
. In Liotta, Giuseppe, Eds. Proceedings Graph Drawing, pages pp. 387-392, Perugia.
Fößmeier, Ulrich and Kaufmann, Michael (1995) On Bend-Minimum Orthogonal Upward Drawing of Directed Planar Graphs. In Tamassia, Roberto and Tollis, Ioannis G., Eds. Proceedings Graph Drawing, pages pp. 52-63, 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.
Zhang, Huaming and Sadasivam, Sadish (2008) On Planar Polyline Drawings. In Hong, Seok-Hee and Nishizeki, Takao and Quan, Wu, Eds. Proceedings Graph Drawing, pages pp. 213-218, Sidney, Australia.
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.
Biedl, Therese and Shermer, Thomas and Whitesides, Sue and Wismath, Stephen (1998) Orthogonal 3-D Graph Drawing. In DiBattista, Giuseppe, Eds. Proceedings Graph Drawing, pages pp. 76-86, 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.
Di Battista, Giuseppe and Didimo, Walter and Patrignani, Maurizio and Pizzonia, Maurizio (1999) Orthogonal and Quasi-upward Drawings with Vertices of Prescribed Size (Extended Abstract). In Kratochvíl, Jan, Eds. Proceedings Graph Drawing, pages pp. 297-310, Stirín Castle, Czech Republic.
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.
Di Battista, Giuseppe and Liotta, Giuseppe and Lubiw, Anna and Whitesides, Sue (2001) Orthogonal Drawings of Cycles in 3D Space (Extended Abstract). In Marks, Joe, Eds. Proceedings Graph Drawing, pages pp. 272-283, Colonial Williamsburg.
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 Johansen, John and Shermer, Thomas and Wood, David R. (2002) Orthogonal Drawings with Few Layers. In Mutzel, Petra and Jünger, Michael and Leipert, Sebastian, Eds. Proceedings Graph Drawing, pages pp. 297-311, Vienna, Austria.
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.
Di Battista, Giuseppe and Didimo, Walter and Marcandalli, A. (2002) Planarization of Clustered Graphs (Extended Abstract). In Mutzel, Petra and Jünger, Michael and Leipert, Sebastian, Eds. Proceedings Graph Drawing, pages pp. 60-74, 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.
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.
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.
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.
Brandes, Ulrik and Eiglsperger, Markus and Kaufmann, Michael and Wagner, Dorothea (2002) Sketch-Driven Orthogonal Graph Drawing. In Goodrich, Michael T. and Kobourov, Stephen G., Eds. Proceedings Graph Drawing, pages pp. 1-11, Irvine, CA, USA.
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.
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.
Biedl, Therese and Madden, Brendan and Tollis, Ioannis G. (1998) The Three-Phase Method: A Unified Approach to Orthogonal Graph Drawing. In DiBattista, Giuseppe, Eds. Proceedings Graph Drawing, pages pp. 391-402, 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.
Biedl, Therese and Thiele, Torsten and Wood, David R. (2001) Three-Dimensional Orthogonal Graph Drawing with Optimal Volume. In Marks, Joe, Eds. Proceedings Graph Drawing, pages pp. 284-295, Colonial Williamsburg.
Bridgeman, Stina and Di Battista, Giuseppe and Didimo, Walter and Liotta, Giuseppe and Tamassia, Roberto and Vismara, Luca (1999) Turn-Regularity and Planar Orthogonal Drawings (Extended Abstract). In Kratochvíl, Jan, Eds. Proceedings Graph Drawing, pages pp. 8-26, Stirín Castle, Czech Republic.
Eades, Peter and Symvonis, Antonios and Whitesides, Sue (1997) Two Algorithms for Three Dimensional Orthogonal Graph Drawing. In North, Stephen, Eds. Proceedings Graph Drawing, pages pp. 139-154, Berkeley, California, USA.
This list was generated on Fri Jun 27 09:36:54 CEST 2008.
