Items where Subject is "M Methods > M.900 Tree"

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 | K | L | M | P | S | T
Number of items at this level: 55.

A

Abellanas, Manuel and Garcìa, J. and Hernández, Gregorio and Noy, M. and Ramos, Pedro (1997) Bipartite Embeddings of Trees in the Plane. In: Symposium on Graph Drawing, GD '96, September 18-20, 1996 , pp. 1-10(Official URL: http://dx.doi.org/10.1007/3-540-62495-3_33).

B

Babilon, Robert and Matoušek, Jiří and Maxová, Jana and Valtr, Pavel (2002) Low-Distortion Embeddings of Trees. In: Graph Drawing 9th International Symposium, GD 2001, September 23-26, 2001 , pp. 343-351(Official URL: http://dx.doi.org/10.1007/3-540-45848-4_27).

Bachmaier, Christian and Brandenburg, Franz J. and Brunner, Wolfgang and Hofmeier, Andreas and Matzeder, Marco and Unfried, Thomas (2009) Tree Drawings on the Hexagonal Grid. In: Graph Drawing 16th International Symposium, GD 2008, September 21- 24, 2008 , pp. 372-383(Official URL: http://dx.doi.org/10.1007/978-3-642-00219-9_36).

Bekos, Michael A. and Cornelsen, Sabine and Grilli, Luca and Hong, Seok-Hee and Kaufmann, Michael (2014) On the Recognition of Fan-Planar and Maximal Outer-Fan-Planar Graphs. In: Graph Drawing 22nd International Symposium, GD 2014, September 24-26, 2014 , pp. 198-209(Official URL: http://dx.doi.org/10.1007/978-3-662-45803-7_17).

Biedl, Therese and Brandenburg, Franz J. (2007) Partitions of Graphs into Trees. In: Graph Drawing 14th International Symposium, GD 2006, September 18-20, 2006 , pp. 430-439(Official URL: http://dx.doi.org/10.1007/978-3-540-70904-6_41).

Bläsius, Thomas and Rutter, Ignaz (2014) A New Perspective on Clustered Planarity as a Combinatorial Embedding Problem. In: Graph Drawing 22nd International Symposium, GD 2014, September 24-26, 2014 , pp. 440-451(Official URL: http://dx.doi.org/10.1007/978-3-662-45803-7_37).

Boissonnat, J.D. and Cazals, F. and Flötotto, J. (2001) 2D-Structure Drawings of Similar Molecules. In: Graph Drawing 8th International Symposium, GD 2000, September 20–23, 2000 , pp. 115-126(Official URL: http://dx.doi.org/10.1007/3-540-44541-2_11).

Bose, Prosenjit and McAllister, Michael and Snoeyink, Jack (1996) Optimal Algorithms to Embed Trees in a Point Set. In: Symposium on Graph Drawing, GD 1995, September 20-22, 1995 , pp. 64-75(Official URL: http://dx.doi.org/10.1007/BFb0021791).

Bose, Prosenjit and Di Battista, Giuseppe and Lenhart, William J. and Liotta, Giuseppe (1995) Proximity Constraints and Representable Trees (extended abstract). In: Graph Drawing DIMACS International Workshop, GD 1994, October 10–12, 1994 , pp. 340-351(Official URL: http://dx.doi.org/10.1007/3-540-58950-3_389).

Brunner, Wolfgang and Matzeder, Marco (2011) Drawing Ordered (k - 1)-Ary Trees on k-Grids. In: Graph Drawing 18th International Symposium, GD 2010, September 21-24, 2010 , pp. 105-116(Official URL: http://dx.doi.org/10.1007/978-3-642-18469-7_10).

Buchheim, Christoph and Jünger, Michael and Leipert, Sebastian (2002) Improving Walker's Algorithm to Run in Linear Time. [Preprint]

Buchheim, Christoph and Jünger, Michael and Leipert, Sebastian (2002) Improving Walker's Algorithm to Run in Linear Time. In: Graph Drawing 10th International Symposium, GD 2002, August 26-28, 2002 , pp. 344-353(Official URL: http://dx.doi.org/10.1007/3-540-36151-0_32).

C

Carlson, Josiah and Eppstein, David (2007) Trees with Convex Faces and Optimal Angles. In: Graph Drawing 14th International Symposium, GD 2006, September 18-20, 2006 , pp. 77-88(Official URL: http://dx.doi.org/10.1007/978-3-540-70904-6_9).

Chan, Timothy M. and Goodrich, Michael T. and Kosaraju, Rao and Tamassia, Roberto (1997) Optimizing Area and Aspect Ratio in Straight-Line Orthogonal Tree Drawings. In: Symposium on Graph Drawing, GD '96, September 18-20, 1996 , pp. 63-75(Official URL: http://dx.doi.org/10.1007/3-540-62495-3_38).

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: Graph Drawing 10th International Symposium, GD 2002, August 26-28, 2002 , pp. 332-343(Official URL: http://dx.doi.org/10.1007/3-540-36151-0_31).

Crescenzi, P. and Penna, Paolo (1998) Minimum-Area h-v Drawings of Complete Binary Trees. In: Graph Drawing 5th International Symposium, GD '97, September 18-20, 1997 , pp. 371-382(Official URL: http://dx.doi.org/10.1007/3-540-63938-1_82).

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

De Fraysseix, Hubert and Ossona de Mendez, Patrice and Rosenstiehl, Pierre (2006) Trémaux trees and planarity. [Journal (Paginated)]

Demetrescu, Camil and Di Battista, Giuseppe and Finocchi, Irene and Liotta, Giuseppe and Patrignani, Maurizio and Pizzonia, Maurizio (1999) Infinite Trees and the Future (Extended Abstract). In: Graph Drawing 7th International Symposium, GD’99, September 15-19, 1999 , pp. 379-391(Official URL: http://dx.doi.org/10.1007/3-540-46648-7_39).

Devroye, Luc and Kruszewski, Paul (1996) The Botanical Beauty of Random Binary Trees. In: Symposium on Graph Drawing, GD 1995, September 20-22, 1995 , pp. 166-177(Official URL: http://dx.doi.org/10.1007/BFb0021801).

Di Giacomo, Emilio and Didimo, Walter and Liotta, Giuseppe and Meijer, Henk and Wismath, Stephen (2008) Point-Set Embedding of Trees with Edge Constraints. In: Graph Drawing 15th International Symposium, GD 2007, September 24-26, 2007 , pp. 113-124(Official URL: http://dx.doi.org/10.1007/978-3-540-77537-9_14).

Di Giacomo, Emilio and Frati, Fabrizio and Fulek, Radoslav and Grilli, Luca and Krug, Marcus (2012) Orthogeodesic Point-Set Embedding of Trees. In: Graph Drawing 19th International Symposium, GD 2011, September 21-23, 2011 , pp. 52-63(Official URL: http://dx.doi.org/ 10.1007/978-3-642-25878-7_6).

Di Giacomo, Emilio and Liotta, Giuseppe and Montecchiani, Fabrizio (2014) Drawing Outer 1-planar Graphs with Few Slopes. In: Graph Drawing 22nd International Symposium, GD 2014, September 24-26, 2014 , pp. 174-185(Official URL: http://dx.doi.org/10.1007/978-3-662-45803-7_15).

Didimo, Walter and Liotta, Giuseppe and Patrignani, Maurizio (2014) On the Complexity of HV-rectilinear Planarity Testing. In: Graph Drawing 22nd International Symposium, GD 2014, September 24-26, 2014 , pp. 343-354(Official URL: http://dx.doi.org/10.1007/978-3-662-45803-7_29).

Durocher, Stephane and Mondal, Debajyoti and Nishat, Rahnuma Islam and Rahman, Md. Saidur and Whitesides, Sue (2012) Embedding Plane 3-Trees in ℝ2 and ℝ3. In: Graph Drawing 19th International Symposium, GD 2011, September 21-23, 2011 , pp. 39-51(Official URL: http://dx.doi.org/ 10.1007/978-3-642-25878-7_5).

E

Efrat, Alon and Hu, Yifan and Kobourov, Stephen G. and Pupyrev, Sergey (2014) MapSets: Visualizing Embedded and Clustered Graphs. In: Graph Drawing 22nd International Symposium, GD 2014, September 24-26, 2014 , pp. 452-463(Official URL: http://dx.doi.org/10.1007/978-3-662-45803-7_38).

Eppstein, David and Goodrich, Michael T. and Meng, Jeremy Yu (2006) Delta-confluent Drawings. In: Graph Drawing 13th International Symposium, GD 2005, September 12-14, 2005 , pp. 165-176(Official URL: http://dx.doi.org/10.1007/11618058_16).

Erten, Cesim and Kobourov, Stephen G. (2004) Simultaneous Embedding of Planar Graphs with Few Bends. In: Graph Drawing 12th International Symposium, GD 2004, September 29-October 2, 2004 , pp. 195-205(Official URL: http://dx.doi.org/10.1007/978-3-540-31843-9_21).

Estrella-Balderrama, Alejandro and Fowler, J. Joseph and Kobourov, Stephen G. (2007) Characterization of Unlabeled Level Planar (ULP) Trees. In: Graph Drawing 14th International Symposium, GD 2006, September 18-20, 2006 , pp. 367-379(Official URL: http://dx.doi.org/10.1007/978-3-540-70904-6_35).

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

Frati, Fabrizio (2008) Straight-Line Orthogonal Drawings of Binary and Ternary Trees. In: Graph Drawing 15th International Symposium, GD 2007, September 24-26, 2007 , pp. 76-87(Official URL: http://dx.doi.org/10.1007/978-3-540-77537-9_11).

Frati, Fabrizio and Di Battista, Giuseppe (2007) Three Dimensional Drawings of Bounded Degree Trees. In: Graph Drawing 14th International Symposium, GD 2006, September 18-20, 2006 , pp. 89-94(Official URL: http://dx.doi.org/10.1007/978-3-540-70904-6_10).

G

García, A. and Hernando, C. and Hurtado, Ferran and Noy, M. and Tejel, J. (1998) Packing Trees into Planar Graphs. In: Graph Drawing 5th International Symposium, GD '97, September 18-20, 1997 , pp. 383-390(Official URL: http://dx.doi.org/10.1007/3-540-63938-1_83).

Garg, Ashim and Rusu, Adrian (2004) A More Practical Algorithm for Drawing Binary Trees in Linear Area with Arbitrary Aspect Ratio. In: Graph Drawing 11th International Symposium, GD 2003, September 21-24, 2003 , pp. 159-165(Official URL: http://dx.doi.org/10.1007/978-3-540-24595-7_15).

Garg, Ashim and Rusu, Adrian (2002) Straight-Line Drawings of Binary Trees with Linear Area and Arbitrary Aspect Ratio (Extended Abstract). In: Graph Drawing 10th International Symposium, GD 2002, August 26-28, 2002 , pp. 320-331(Official URL: http://dx.doi.org/10.1007/3-540-36151-0_30).

Ghassemi Toosi, Farshad and Nikolov, Nikola S. (2014) Circular Tree Drawing by Simulating Network Synchronisation Dynamics and Scaling. In: Graph Drawing 22nd International Symposium, GD 2014, September 24-26, 2014 , pp. 511-512.

Gronemann, Martin and Jünger, Michael (2012) Drawing Clustered Graphs as Topographic Maps. [Preprint]

Gudmundsson, Joachim and Van Kreveld, Marc and Merrick, Damian (2007) Schematisation of Tree Drawings. In: Graph Drawing 14th International Symposium, GD 2006, September 18-20, 2006 , pp. 66-76(Official URL: http://dx.doi.org/10.1007/978-3-540-70904-6_8).

H

Herman, Ivan and Melançon, Guy and De Ruiter, Maurice M. and Delest, Maylis (1999) Latour - A Tree Visualisation System. In: Graph Drawing 7th International Symposium, GD’99, September 15-19, 1999 , pp. 392-399(Official URL: http://dx.doi.org/10.1007/3-540-46648-7_40).

Hong, Seok-Hee and Eades, Peter (2001) An Algorithm for Finding Three Dimensional Symmetry in Trees. In: Graph Drawing 8th International Symposium, GD 2000, September 20–23, 2000 , pp. 360-371(Official URL: http://dx.doi.org/10.1007/3-540-44541-2_34).

K

Kaufmann, Michael (2008) Polynomial Area Bounds for MST embeddings of trees. In: Graph Drawing 15th International Symposium, GD 2007, September 24-26, 2007 , pp. 88-100(Official URL: http://dx.doi.org/10.1007/978-3-540-77537-9_12).

Kaufmann, Michael and Vrt'o, Imrich and Geyer, Markus (2006) Two trees which are self-intersecting when drawn simultaneously. In: Graph Drawing 13th International Symposium, GD 2005, September 12-14, 2005 , pp. 201-210(Official URL: http://dx.doi.org/10.1007/11618058_19).

L

Lee, Bongshin and Sims Parr, Cynthia and Plaisant, Catherine and Bederson, Benjamin B. (2006) Visualizing Graphs as Trees: Plant a Seed and Watch It Grow. In: Graph Drawing 13th International Symposium, GD 2005, September 12-14, 2005 , pp. 516-518(Official URL: http://dx.doi.org/10.1007/11618058_50).

Liao, Chien-Chih and Lu, Hsueh-I. and Yen, Hsu-Chun (2002) Floor-Planning via Orderly Spanning Trees. In: Graph Drawing 9th International Symposium, GD 2001, September 23-26, 2001 , pp. 367-377(Official URL: http://dx.doi.org/10.1007/3-540-45848-4_29).

Lin, Chun-Cheng and Yen, Hsu-Chun (2006) On Balloon Drawings of Rooted Trees. In: Graph Drawing 13th International Symposium, GD 2005, September 12-14, 2005 , pp. 285-296(Official URL: http://dx.doi.org/10.1007/11618058_26).

Liotta, Giuseppe and Meijer, Henk (1999) Voronoi Drawings of Trees. In: Graph Drawing 7th International Symposium, GD’99, September 15-19, 1999 , pp. 369-378(Official URL: http://dx.doi.org/10.1007/3-540-46648-7_38).

M

Merrick, Damian and Gudmundsson, Joachim (2007) Path Simplification for Metro Map Layout. In: Graph Drawing 14th International Symposium, GD 2006, September 18-20, 2006 , pp. 258-269(Official URL: http://dx.doi.org/10.1007/978-3-540-70904-6_26).

Meyer, Bernd (1998) Self-Organizing Graphs - A Neural Network Perspective of Graph Layout. In: Graph Drawing 6th International Symposium, GD’ 98, August 13-15, 1998 , pp. 246-262(Official URL: http://dx.doi.org/10.1007/3-540-37623-2_19).

P

Penna, Paolo and Vocca, Paola (1998) Proximity Drawings: Three Dimensions Are Better than Two (Extended Abstract). In: Graph Drawing 6th International Symposium, GD’ 98, August 13-15, 1998 , pp. 275-287(Official URL: http://dx.doi.org/10.1007/3-540-37623-2_21).

Poon, Sheung-Hung (2006) On Straightening Low-Diameter Unit Trees. In: Graph Drawing 13th International Symposium, GD 2005, September 12-14, 2005 , pp. 519-521(Official URL: http://dx.doi.org/10.1007/11618058_51).

S

Sarkar , Rik (2012) Low Distortion Delaunay Embedding of Trees in Hyperbolic Plane. In: Graph Drawing 19th International Symposium, GD 2011, September 21-23, 2011 , pp. 355-366(Official URL: http://dx.doi.org/10.1007/978-3-642-25878-7_34).

Schreiber, Falk and Skodinis, Konstantinos (1998) NP-Completeness of Some Tree-Clustering Problems. In: Graph Drawing 6th International Symposium, GD’ 98, August 13-15, 1998 , pp. 288-301(Official URL: http://dx.doi.org/10.1007/3-540-37623-2_22).

Shieh, Fwu-Shan and McCreary, Carolyn (2001) Clan-Based Incremental Drawing. In: Graph Drawing 8th International Symposium, GD 2000, September 20–23, 2000 , pp. 384-396(Official URL: http://dx.doi.org/10.1007/3-540-44541-2_36).

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

Teoh, Soon Tee and Ma, Kwan-Liu (2002) RINGS: A Technique for Visualizing Large Hierarchies. In: Graph Drawing 10th International Symposium, GD 2002, August 26-28, 2002 , pp. 268-275(Official URL: http://dx.doi.org/10.1007/3-540-36151-0_25).

This list was generated on Fri Oct 20 23:25:59 2017 CEST.