Items where Subject is "P Styles > P.480 Layered"

Pach, János and Tóth, Géza (2012) Monotone Crossing Number. In: Graph Drawing 19th International Symposium, GD 2011, September 21-23, 2011, Eindhoven, The Netherlands , pp. 278-289 (Official URL: http://dx.doi.org/10.1007/978-3-642-25878-7_27).

Pupyrev, Sergey and Nachmanson, Lev and Kaufmann, Michael (2011) Improving Layered Graph Layouts with Edge Bundling. In: Graph Drawing 18th International Symposium, GD 2010, September 21-24, 2010, Konstanz, Germany , pp. 329-340 (Official URL: http://dx.doi.org/10.1007/978-3-642-18469-7_30).

Xu, Kai and Williams, Rohan and Hong, Seok-Hee and Liu, Qing and Zhang, Ji (2010) Semi-bipartite Graph Visualization for Gene Ontology Networks. In: Graph Drawing 17th International Symposium, GD 2009, September 22-25, 2009, Chicago, IL, USA , pp. 244-255 (Official URL: http://dx.doi.org/10.1007/978-3-642-11805-0_24).

Chimani, Markus and Gutwenger, Carsten and Mutzel, Petra and Wong, Hoi-Ming (2010) Upward Planarization Layout. In: Graph Drawing 17th International Symposium, GD 2009, September 22-25, 2009, Chicago, IL, USA , pp. 94-106 (Official URL: http://dx.doi.org/10.1007/978-3-642-11805-0_11).

Albrecht, Benjamin and Effinger, Philip and Held, Markus and Kaufmann, Michael and Kottler, Stephan (2010) Visualization of Complex BPEL Models. In: Graph Drawing 17th International Symposium, GD 2009, September 22-25, 2009, Chicago, IL, USA , pp. 421-423 (Official URL: http://dx.doi.org/10.1007/978-3-642-11805-0_45).

Tamassia, Roberto and Palazzi, Bernardo and Papamanthou, Charalampos (2009) Graph Drawing for Security Visualization. In: Graph Drawing 16th International Symposium, GD 2008, September 21- 24, 2008, Heraklion, Crete, Greece , pp. 2-13 (Official URL: http://dx.doi.org/10.1007/978-3-642-00219-9_2).

Fowler, J. Joseph and Kobourov, Stephen G. (2008) Characterization of Unlabeled Level Planar Graphs. In: Graph Drawing 15th International Symposium, GD 2007, September 24-26, 2007, Sydney, Australia , pp. 37-49 (Official URL: http://dx.doi.org/10.1007/978-3-540-77537-9_7).

Bachmaier, Christian and Brunner, Wolfgang and König, Christof (2008) Cyclic Level Planarity Testing and Embedding. In: Graph Drawing 15th International Symposium, GD 2007, September 24-26, 2007, Sydney, Australia , pp. 50-61 (Official URL: http://dx.doi.org/10.1007/978-3-540-77537-9_8).

Fowler, J. Joseph and Kobourov, Stephen G. (2008) Minimum Level Nonplanar Patterns for Trees. In: Graph Drawing 15th International Symposium, GD 2007, September 24-26, 2007, Sydney, Australia , pp. 69-75 (Official URL: http://dx.doi.org/10.1007/978-3-540-77537-9_10).

Harrigan, Martin and Healy, Patrick (2008) Practical Level Planarity Testing and Layout with Embedding Constraints. In: Graph Drawing 15th International Symposium, GD 2007, September 24-26, 2007, Sydney, Australia , pp. 62-68 (Official URL: http://dx.doi.org/10.1007/978-3-540-77537-9_9).

Tsiaras, Vassilis and Triantafilou, Sofia and Tollis, Ioannis G. (2008) Treemaps for Directed Acyclic Graphs. In: Graph Drawing 15th International Symposium, GD 2007, September 24-26, 2007, Sydney, Australia , pp. 377-388 (Official URL: http://dx.doi.org/10.1007/978-3-540-77537-9_37).

Hong, Seok-Hee and Nikolov, Nikola S. (2006) Hierarchical Layouts of Directed Graphs in Three Dimensions. In: Graph Drawing 13th International Symposium, GD 2005, September 12-14, 2005, Limerick, Ireland , pp. 251-261 (Official URL: http://dx.doi.org/10.1007/11618058_23).

Suderman, Matthew (2006) Proper and Planar Drawings of Graphs on Three Layers. In: Graph Drawing 13th International Symposium, GD 2005, September 12-14, 2005, Limerick, Ireland , pp. 434-445 (Official URL: http://dx.doi.org/10.1007/11618058_39).

Forster, Michael (2004) A Fast and Simple Heuristic for Constrained Two-Level Crossing Reduction. In: Graph Drawing 12th International Symposium, GD 2004, September 29-October 2, 2004, New York, NY, USA , pp. 206-216 (Official URL: http://dx.doi.org/10.1007/978-3-540-31843-9_22).

Eiglsperger, Markus and Siebenhaller, Martin and Kaufmann, Michael (2004) An Efficient Implementation of Sugiyama's Algorithm for Layered Graph Drawing. In: Graph Drawing 12th International Symposium, GD 2004, September 29-October 2, 2004, New York, NY, USA , pp. 155-166 (Official URL: http://dx.doi.org/10.1007/978-3-540-31843-9_17).

Nagamochi, Hiroshi (2004) An Improved Approximation to the One-Sided Bilayer Drawing. In: Graph Drawing 11th International Symposium, GD 2003, September 21-24, 2003, Perugia, Italy , pp. 406-418 (Official URL: http://dx.doi.org/10.1007/978-3-540-24595-7_38).

Eppstein, David and Goodrich, Michael T. and Meng, Jeremy Yu (2004) Confluent Layered Drawings. In: Graph Drawing 12th International Symposium, GD 2004, September 29-October 2, 2004, New York, NY, USA , pp. 184-194 (Official URL: http://dx.doi.org/10.1007/978-3-540-31843-9_20).

Görg, Carsten and Birke, Peter and Pohl, Mathias and Diehl, Stephan (2004) Dynamic Graph Drawing of Sequences of Orthogonal and Hierarchical Graphs. In: Graph Drawing 12th International Symposium, GD 2004, September 29-October 2, 2004, New York, NY, USA , pp. 228-238 (Official URL: http://dx.doi.org/10.1007/978-3-540-31843-9_24).

Suderman, Matthew and Whitesides, Sue (2004) Experiments with the Fixed-Parameter Approach for Two-Layer Planarization. In: Graph Drawing 11th International Symposium, GD 2003, September 21-24, 2003, Perugia, Italy , pp. 345-356 (Official URL: http://dx.doi.org/10.1007/978-3-540-24595-7_32).

Dujmovic, Vida and Fernau, Henning and Kaufmann, Michael (2004) Fixed Parameter Algorithms for one-sided crossing minimization Revisited. In: Graph Drawing 11th International Symposium, GD 2003, September 21-24, 2003, Perugia, Italy , pp. 332-344 (Official URL: http://dx.doi.org/10.1007/978-3-540-24595-7_31).

Di Giacomo, Emilio and Didimo, Walter and Liotta, Giuseppe and Suderman, Matthew (2004) Hamiltonian-with-Handles Graphs and the k-Spine Drawability Problem. In: Graph Drawing 12th International Symposium, GD 2004, September 29-October 2, 2004, New York, NY, USA , pp. 262-272 (Official URL: http://dx.doi.org/10.1007/978-3-540-31843-9_27).

Forster, Michael (2002) Applying Crossing Reduction Strategies to Layered Compound Graphs. In: Graph Drawing 10th International Symposium, GD 2002, August 26-28, 2002, Irvine, CA, USA , pp. 276-284 (Official URL: http://dx.doi.org/10.1007/3-540-36151-0_26).

Six, Janet M. and Tollis, Ioannis G. (2002) Automated Visualization of Process Diagrams. In: Graph Drawing 9th International Symposium, GD 2001, September 23-26, 2001, Vienna, Austria , pp. 44-59 (Official URL: http://dx.doi.org/10.1007/3-540-45848-4_4).

Eschbach, Thomas and Günther, Wolfgang and Drechsler, Rolf and Becker, Bernd (2002) Crossing Reduction by Windows Optimization. In: Graph Drawing 10th International Symposium, GD 2002, August 26-28, 2002, Irvine, CA, USA , pp. 285-294 (Official URL: http://dx.doi.org/10.1007/3-540-36151-0_27).

Brandes, Ulrik and Köpf, Boris (2002) Fast and Simple Horizontal Coordinate Assignment. In: Graph Drawing 9th International Symposium, GD 2001, September 23-26, 2001, Vienna, Austria , pp. 31-44 (Official URL: http://dx.doi.org/10.1007/3-540-45848-4_3).

Healy, Patrick and Nikolov, Nikola S. (2002) How to Layer a Directed Acyclic Graph. In: Graph Drawing 9th International Symposium, GD 2001, September 23-26, 2001, Vienna, Austria , pp. 16-30 (Official URL: http://dx.doi.org/10.1007/3-540-45848-4_2).

Jünger, Michael and Leipert, Sebastian (2002) Level Planar Embedding in linear Time. [Journal (On-line/Unpaginated)]

North, Stephen and Woodhull, Gordon (2002) Online Hierarchical Graph Drawing. In: Graph Drawing 9th International Symposium, GD 2001, September 23-26, 2001, Vienna, Austria , pp. 232-246 (Official URL: http://dx.doi.org/10.1007/3-540-45848-4_19).

Barth, Wilhelm and Jünger, Michael and Mutzel, Petra (2002) Simple and Efficient Bilayer Cross Counting. In: Graph Drawing 10th International Symposium, GD 2002, August 26-28, 2002, Irvine, CA, USA , pp. 130-141 (Official URL: http://dx.doi.org/10.1007/3-540-36151-0_13).

Barth, Wilhelm and Jünger, Michael and Mutzel, Petra (2002) Simple and Efficient Bilayer Cross Counting. [Preprint]

Baburin, Danil E. (2002) Some Modifications of Sugiyama Approach. In: Graph Drawing 10th International Symposium, GD 2002, August 26-28, 2002, Irvine, CA, USA , pp. 366-367 (Official URL: http://dx.doi.org/10.1007/3-540-36151-0_36).

Buchheim, Christoph and Jünger, Michael and Leipert, Sebastian (2001) A Fast Layout Algorithm for k-Level Graphs. In: Graph Drawing 8th International Symposium, GD 2000, September 20–23, 2000, Colonial Williamsburg, VA, USA , pp. 229-240 (Official URL: http://dx.doi.org/10.1007/3-540-44541-2_22).

Waddle, Vance (2001) Graph Layout for Displaying Data Structures. In: Graph Drawing 8th International Symposium, GD 2000, September 20–23, 2000, Colonial Williamsburg, VA, USA , pp. 241-252 (Official URL: http://dx.doi.org/10.1007/3-540-44541-2_23).

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

Waddle, Vance and Malhotra, Ashok (1999) An E log E Line Crossing Algorithm for Levelled Graphs. In: Graph Drawing 7th International Symposium, GD’99, September 15-19, 1999, Štirín Castle, Czech Republic , pp. 59-71 (Official URL: http://dx.doi.org/10.1007/3-540-46648-7_6).

Jünger, Michael and Leipert, Sebastian (1999) Level Planar Embedding in Linear Time. In: Graph Drawing 7th International Symposium, GD’99, September 15-19, 1999, Štirín Castle, Czech Republic , pp. 72-81 (Official URL: http://dx.doi.org/10.1007/3-540-46648-7_7).

Jünger, Michael and Leipert, Sebastian (1999) Level Planar Embedding in linear Time. [Preprint]

Shahrokhi, Farhad and Vrt'o, Imrich (1999) On 3-Layer Crossings and Pseudo Arrangements. In: Graph Drawing 7th International Symposium, GD’99, September 15-19, 1999, Štirín Castle, Czech Republic , pp. 225-231 (Official URL: http://dx.doi.org/10.1007/3-540-46648-7_23).

Chen, Ho-Lin and Yen, Hsu-Chun (1999) Orthogonal and Straight-Line Drawings of Graphs with Succinct Representations. In: Graph Drawing 7th International Symposium, GD’99, September 15-19, 1999, Štirín Castle, Czech Republic , pp. 416-417 (Official URL: http://dx.doi.org/10.1007/3-540-46648-7_43).

Kakoulis, Konstantinos G. and Tollis, Ioannis G. (1998) An Algorithm for Labeling Edges of Hierarchical Drawings. In: Graph Drawing 5th International Symposium, GD '97, September 18-20, 1997, Rome, Italy , pp. 169-180 (Official URL: http://dx.doi.org/10.1007/3-540-63938-1_60).

Lin, Xuemin and Eades, Peter (1998) Area Requirements for Drawing Hierarchically Planar Graphs. In: Graph Drawing 5th International Symposium, GD '97, September 18-20, 1997, Rome, Italy , pp. 219-229 (Official URL: http://dx.doi.org/10.1007/3-540-63938-1_64).

Seemann, Jochen (1998) Extending the Sugiyama Algorithm for Drawing UML Class Diagrams: Towards Automatic Layout of Object-Oriented Software Diagrams. In: Graph Drawing 5th International Symposium, GD '97, September 18-20, 1997, Rome, Italy , pp. 415-424 (Official URL: http://dx.doi.org/10.1007/3-540-63938-1_86).

Dillencourt, Michael B. and Eppstein, David and Hirschberg, Daniel S. (1998) Geometric Thickness of Complete Graphs. In: Graph Drawing 6th International Symposium, GD’ 98, August 13-15, 1998, Montréal, Canada , pp. 102-110 (Official URL: http://dx.doi.org/10.1007/3-540-37623-2_8).

Jünger, Michael and Leipert, Sebastian and Mutzel, Petra (1998) Level Planarity Testing in Linear Time. [Preprint]

Mutzel, Petra (1997) An Alternative Method to Crossing Minimization on Hierarchical Graphs (extended abstract). In: Symposium on Graph Drawing, GD '96, September 18-20, 1996, Berkeley, California, USA , pp. 318-333 (Official URL: http://dx.doi.org/10.1007/3-540-62495-3_57).

Garg, Ashim and Tamassia, Roberto (1997) GIOTTO3D: A System for Visualizing Hierarchical Structures in 3D. In: Symposium on Graph Drawing, GD '96, September 18-20, 1996, Berkeley, California, USA , pp. 193-200 (Official URL: http://dx.doi.org/10.1007/3-540-62495-3_48).

Jünger, Michael and Leipert, Sebastian and Mutzel, Petra (1997) Pitfalls of using PQ-Trees in Automatic Graph Drawing. [Preprint]

Eades, Peter and Feng, Qing-Wen and Lin, Xuemin (1997) Straight-Line Drawing Algorithms for Hierarchical Graphs and Clustered Graphs. In: Symposium on Graph Drawing, GD '96, September 18-20, 1996, Berkeley, California, USA , pp. 113-128 (Official URL: http://dx.doi.org/10.1007/3-540-62495-3_42).

Frick, Arne (1997) Upper Bounds on the Number of Hidden Nodes in Sugiyama's Algorithm. In: Symposium on Graph Drawing, GD '96, September 18-20, 1996, Berkeley, California, USA , pp. 169-183 (Official URL: http://dx.doi.org/10.1007/3-540-62495-3_46).

Jünger, Michael and Mutzel, Petra (1996) 2-Layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms. [Preprint]

Sander, Georg (1996) A Fast Heuristic for Hierarchical Manhattan Layout. In: Symposium on Graph Drawing, GD 1995, September 20-22, 1995, Passau, Germany , pp. 447-458 (Official URL: http://dx.doi.org/10.1007/BFb0021828).

Sugiyama, Kozo and Misue, Kazuo (1996) A Generic Compound Graph Visualizer/Manipulator : D-ABDUCTOR. In: Symposium on Graph Drawing, GD 1995, September 20-22, 1995, Passau, Germany , pp. 500-503 (Official URL: http://dx.doi.org/10.1007/BFb0021834).

Paris, Gilles (1996) Automatic Drawing of Compound Digraphs for a Real-Time Power System Simulator. In: Symposium on Graph Drawing, GD 1995, September 20-22, 1995, Passau, Germany , pp. 431-434 (Official URL: http://dx.doi.org/10.1007/BFb0021826).

Sander, Georg and Alt, M. and Ferdinand, C. and Wilhelm, R. (1996) CLAX - A Visualized Compiler. In: Symposium on Graph Drawing, GD 1995, September 20-22, 1995, Passau, Germany , pp. 459-462 (Official URL: http://dx.doi.org/10.1007/BFb0021829).

Dodson, David (1996) COMAIDE: Information Visualization using Cooperative 3D Diagram Layout. In: Symposium on Graph Drawing, GD 1995, September 20-22, 1995, Passau, Germany , pp. 190-201 (Official URL: http://dx.doi.org/10.1007/BFb0021803).

Jünger, Michael and Mutzel, Petra (1995) Exact and Heuristic Algorithms for 2-Layer Straightline Crossing Minimization. [Preprint]