Items where Subject is "P Styles > P.480 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 | K | L | M | N | P | R | S | T | V | W | X
Number of items at this level: 77.

A

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

Angelini, Patrizio and Da Lozzo, Giordano and Di Battista, Giuseppe and Frati, Fabrizio (2013) Strip Planarity Testing. In: 21st International Symposium, GD 2013, September 23-25, 2013 , pp. 37-48(Official URL: http://dx.doi.org/10.1007/978-3-319-03841-4_4).

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).

Angelini, Patrizio and Da Lozzo, Giordano and Di Battista, Giuseppe and Frati, Fabrizio and Roselli, Vincenzo (2014) The Importance of Being Proper. In: Graph Drawing 22nd International Symposium, GD 2014, September 24-26, 2014 , pp. 246-258(Official URL: http://dx.doi.org/10.1007/978-3-662-45803-7_21).

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

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

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).

Ballweg, K. and Pohl, Mathias and Wallner, G. and von Landesberger, T. (2017) Visual Similarity Perception of Directed Acyclic Graphs: A Study on Influencing Factors. In: Graph Drawing and Network Visualization, GD 2017, September 25-27 , pp. 241-255(Official URL: https://doi.org/10.1007/978-3-319-73915-1_20).

Bannister, Michael J. and Brown, David A. and Eppstein, David (2015) Confluent Orthogonal Drawings of Syntax Diagrams. In: Graph Drawing and Network Visualization: 23rd International Symposium, GD 2015, September 24-26, 2015 , pp. 260-271(Official URL: http://dx.doi.org/10.1007/978-3-319-27261-0_22).

Bannister, Michael J. and Devanny, William E. and Dujmović, Vida and Eppstein, David and Wood, David R. (2016) Track Layout Is Hard. In: Graph Drawing and Network Visualization. GD 2016, September, 19. - 21., 2016 , pp. 499-510(Official URL: http://dx.doi.org/10.1007/978-3-319-50106-2_38).

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).

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

Binucci, Carla and Chimani, Markus and Didimo, Walter and Gronemann, Martin and Klein, Karsten and Kratochvíl, Jan and Montecchiani, Fabrizio and Tollis, Ioannis G. (2015) 2-Layer Fan-Planarity: From Caterpillar to Stegosaurus. In: Graph Drawing and Network Visualization: 23rd International Symposium, GD 2015, September 24-26, 2015 , pp. 281-294(Official URL: http://dx.doi.org/10.1007/978-3-319-27261-0_24).

Binucci, Carla and Di Giacomo, Emilio and Didimo, Walter and Montecchiani, Fabrizio and Patrignani, Maurizio and Tollis, Ioannis G. (2014) Fan-Planar Graphs: Combinatorial Properties and Complexity Results. In: Graph Drawing 22nd International Symposium, GD 2014, September 24-26, 2014 , pp. 186-197(Official URL: http://dx.doi.org/10.1007/978-3-662-45803-7_16).

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

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).

D

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

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).

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

Dujmović, 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 , pp. 332-344(Official URL: http://dx.doi.org/10.1007/978-3-540-24595-7_31).

Durocher, Stephane and Mondal, Debajyoti (2014) Drawing Planar Graphs with Reduced Height. In: Graph Drawing 22nd International Symposium, GD 2014, September 24-26, 2014 , pp. 392-403(Official URL: http://dx.doi.org/10.1007/978-3-662-45803-7_33).

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 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).

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

Evans, William S. and Kusters, Vincent and Saumell, Maria and Speckmann, Bettina (2014) Column Planarity and Partial Simultaneous Geometric Embedding. In: Graph Drawing 22nd International Symposium, GD 2014, September 24-26, 2014 , pp. 259-271(Official URL: http://dx.doi.org/10.1007/978-3-662-45803-7_22).

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).

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

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).

Fulek, Radoslav and Pelsmajer, Michael J. and Schaefer, Marcus (2015) Hanani-Tutte for Radial Planarity. In: Graph Drawing and Network Visualization: 23rd International Symposium, GD 2015, September 24-26, 2015 , pp. 99-110(Official URL: http://dx.doi.org/10.1007/978-3-319-27261-0_9).

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).

Gronemann, Martin (2016) Bitonic st-orderings for Upward Planar Graphs. In: Graph Drawing and Network Visualization. GD 2016, September, 19. - 21., 2016 , pp. 222-235(Official URL: http://dx.doi.org/10.1007/978-3-319-50106-2_18).

Gronemann, Martin and Jünger, Michael and Liers, Frauke and Mambelli, Francesco (2016) Crossing Minimization in Storyline Visualization. In: Graph Drawing and Network Visualization. GD 2016, September, 19. - 21., 2016 , pp. 367-381(Official URL: http://dx.doi.org/10.1007/978-3-319-50106-2_28).

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

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]

K

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 , pp. 169-180(Official URL: http://dx.doi.org/10.1007/3-540-63938-1_60).

Klemz, Boris and Rote, Günter (2017) Ordered Level Planarity, Geodesic Planarity and Bi-Monotonicity. In: Graph Drawing and Network Visualization. GD 2017, September 25-27 , pp. 440-454(Official URL: https://doi.org/10.1007/978-3-319-73915-1_34).

Klute, Fabian (2016) Robust Genealogy Drawings. In: Graph Drawing and Network Visualization. GD 2016, September, 19. - 21., 2016 , pp. 637-639.

Kostitsyna, Irina and Nöllenburg, Martin and Polishchuk, Valentin and Schulz, André and Strash, Darren (2015) On Minimizing Crossings in Storyline Visualizations. In: Graph Drawing and Network Visualization: 23rd International Symposium, GD 2015, September 24-26, 2015 , pp. 192-198(Official URL: http://dx.doi.org/10.1007/978-3-319-27261-0_16).

L

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 , pp. 219-229(Official URL: http://dx.doi.org/10.1007/3-540-63938-1_64).

M

Mařík, Radek (2016) Tree-Based Genealogical Graph Layout. In: Graph Drawing and Network Visualization. GD 2016, September, 19. - 21., 2016 , pp. 613-616.

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

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

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).

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 , pp. 329-340(Official URL: http://dx.doi.org/10.1007/978-3-642-18469-7_30).

R

Rüegg, Ulf and Kieffer, Steve and Dwyer, Tim and Marriott, Kim and Wybrow, Michael (2014) Stress-Minimizing Orthogonal Layout of Data Flow Diagrams with Ports. In: Graph Drawing 22nd International Symposium, GD 2014, September 24-26, 2014 , pp. 319-330(Official URL: http://dx.doi.org/10.1007/978-3-662-45803-7_27).

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 (1996) A Fast Heuristic for Hierarchical Manhattan Layout. In: Symposium on Graph Drawing, GD 1995, September 20-22, 1995 , pp. 447-458(Official URL: http://dx.doi.org/10.1007/BFb0021828).

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).

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 , pp. 415-424(Official URL: http://dx.doi.org/10.1007/3-540-63938-1_86).

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).

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 , pp. 345-356(Official URL: http://dx.doi.org/10.1007/978-3-540-24595-7_32).

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).

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

V

van Dijk, Thomas C. and Fink, Martin and Fischer, Norbert and Lipp, Fabian and Markfelder, Peter and Ravsky, Alexander and Suri, Subhash and Wolff, Alexander (2016) Block Crossings in Storyline Visualizations. In: Graph Drawing and Network Visualization. GD 2016, September, 19. - 21., 2016 , pp. 382-398(Official URL: http://dx.doi.org/10.1007/978-3-319-50106-2_30).

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 Fri Oct 19 13:21:30 2018 CEST.