Items where Subject is "M Methods > M.500 Layered"

Up a level
Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Group by: Creators Name | Item Type
Jump to: A | B | C | D | E | F | G | H | J | M | N | P | R | S | T | W | X
Number of items at this level: 50.

A

Angelini, Patrizio and Da Lozzo, Giordano and Di Battista, Giuseppe and Frati, Fabrizio and Partignani, Maurizio and Rutter, Ignaz (2016) Beyond Level Planarity. In: Graph Drawing and Network Visualization. GD 2016, September, 19. - 21., 2016 , pp. 482-495(Official URL: http://dx.doi.org/10.1007/978-3-319-50106-2_37).

Aulbach, Maximilian and Fink, Martin and Schuhmann, Julian and Wolff, Alexander (2014) Drawing Graphs within Restricted Area. In: Graph Drawing 22nd International Symposium, GD 2014, September 24-26, 2014 , pp. 367-379(Official URL: http://dx.doi.org/10.1007/978-3-662-45803-7_31).

B

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 , pp. 50-61(Official URL: http://dx.doi.org/10.1007/978-3-540-77537-9_8).

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

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 , pp. 130-141(Official URL: http://dx.doi.org/10.1007/3-540-36151-0_13).

Biedl, Therese and Johansen, John and Shermer, Thomas and Wood, David R. (2002) Orthogonal Drawings with Few Layers. In: Graph Drawing 9th International Symposium, GD 2001, September 23-26, 2001 , pp. 297-311(Official URL: http://dx.doi.org/10.1007/3-540-45848-4_24).

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 , pp. 31-44(Official URL: http://dx.doi.org/10.1007/3-540-45848-4_3).

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

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 , pp. 229-240(Official URL: http://dx.doi.org/10.1007/3-540-44541-2_22).

C

Carmel, Liran and Harel, David and Koren, Yehuda (2002) Drawing Directed Graphs Using One-Dimensional Optimization. In: Graph Drawing 10th International Symposium, GD 2002, August 26-28, 2002 , pp. 193-206(Official URL: http://dx.doi.org/10.1007/3-540-36151-0_19).

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 , pp. 416-417(Official URL: http://dx.doi.org/10.1007/3-540-46648-7_43).

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 , pp. 94-106(Official URL: http://dx.doi.org/10.1007/978-3-642-11805-0_11).

Cruz, Isabel F. and Garg, Ashim (1995) Drawing Graphs by Example Efficiently: Trees and Planar Acyclic Digraphs (Extended Abstract). In: Graph Drawing DIMACS International Workshop, GD 1994, October 10–12, 1994 , pp. 404-415(Official URL: http://dx.doi.org/10.1007/3-540-58950-3_394).

D

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 , pp. 102-110(Official URL: http://dx.doi.org/10.1007/3-540-37623-2_8).

E

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 , pp. 113-128(Official URL: http://dx.doi.org/10.1007/3-540-62495-3_42).

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 , pp. 155-166(Official URL: http://dx.doi.org/10.1007/978-3-540-31843-9_17).

Eppstein, David (2002) Separating Thickness from Geometric Thickness. In: Graph Drawing 10th International Symposium, GD 2002, August 26-28, 2002 , pp. 150-161(Official URL: http://dx.doi.org/10.1007/3-540-36151-0_15).

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 , pp. 184-194(Official URL: http://dx.doi.org/10.1007/978-3-540-31843-9_20).

F

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 , pp. 206-216(Official URL: http://dx.doi.org/10.1007/978-3-540-31843-9_22).

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 , pp. 37-49(Official URL: http://dx.doi.org/10.1007/978-3-540-77537-9_7).

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 , pp. 69-75(Official URL: http://dx.doi.org/10.1007/978-3-540-77537-9_10).

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 , pp. 169-183(Official URL: http://dx.doi.org/10.1007/3-540-62495-3_46).

G

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 , pp. 193-200(Official URL: http://dx.doi.org/10.1007/3-540-62495-3_48).

H

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 , pp. 62-68(Official URL: http://dx.doi.org/10.1007/978-3-540-77537-9_9).

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 , pp. 16-30(Official URL: http://dx.doi.org/10.1007/3-540-45848-4_2).

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 , pp. 251-261(Official URL: http://dx.doi.org/10.1007/11618058_23).

J

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 , 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]

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

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

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

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

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

M

McCreary, Carolyn and Shieh, Fwu-Shan and Gill, Helen (1995) CG: A Graph Drawing System Using Graph-Grammar Parsing. In: Graph Drawing DIMACS International Workshop, GD 1994, October 10–12, 1994 , pp. 270-273(Official URL: http://dx.doi.org/10.1007/3-540-58950-3_380).

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 , pp. 318-333(Official URL: http://dx.doi.org/10.1007/3-540-62495-3_57).

N

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

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

P

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 , pp. 431-434(Official URL: http://dx.doi.org/10.1007/BFb0021826).

Pich, Christian (2010) Drawing Directed Graphs Clockwise. In: Graph Drawing 17th International Symposium, GD 2009, September 22-25, 2009 , pp. 369-380(Official URL: http://dx.doi.org/10.1007/978-3-642-11805-0_35).

R

Rüegg, Ulf and Schulze, Christoph Daniel and Carstens, John Julian and von Hanxleden, Reinhard (2015) Size- and Port-Aware Horizontal Node Coordinate Assignment. In: Graph Drawing and Network Visualization: 23rd International Symposium, GD 2015, September 24-26, 2015 , pp. 139-150(Official URL: http://dx.doi.org/10.1007/978-3-319-27261-0_12).

S

Sander, Georg (2003) Layout of Directed Hypergraphs with Orthogonal Hyperedges. [Departmental Technical Report] (Unpublished)

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 , pp. 459-462(Official URL: http://dx.doi.org/10.1007/BFb0021829).

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 , pp. 225-231(Official URL: http://dx.doi.org/10.1007/3-540-46648-7_23).

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 , pp. 44-59(Official URL: http://dx.doi.org/10.1007/3-540-45848-4_4).

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

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 , pp. 500-503(Official URL: http://dx.doi.org/10.1007/BFb0021834).

T

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 , pp. 2-13(Official URL: http://dx.doi.org/10.1007/978-3-642-00219-9_2).

W

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

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 , pp. 59-71(Official URL: http://dx.doi.org/10.1007/3-540-46648-7_6).

X

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 , pp. 244-255(Official URL: http://dx.doi.org/10.1007/978-3-642-11805-0_24).

This list was generated on Thu Nov 23 00:08:33 2017 CET.