Items where Subject is "G Algorithms and Complexity > G.210 Bends"

Up a level
Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Number of items at this level: 60.

Chaplick, Steven and Ueckerdt, Torsten (2013) Planar Graphs as VPG-Graphs. In: 20th International Symposium, GD 2012, September 19-21, 2012, Redmond, WA, USA , pp. 174-186 (Official URL: http://link.springer.com/chapter/10.1007/978-3-642-36763-2_16).

Cornelsen, Sabine and Karrenbauer, Andreas (2012) Accelerated Bend Minimization. In: Graph Drawing 19th International Symposium, GD 2011, September 21-23, 2011, Eindhoven, The Netherlands , pp. 111-122 (Official URL: http://dx.doi.org/ 10.1007/978-3-642-25878-7_12).

Di Giacomo, Emilio and Didimo, Walter and Liotta, Giuseppe and Meijer, Henk (2010) Area, Curve Complexity, and Crossing Resolution of Non-planar Graph Drawings. In: Graph Drawing 17th International Symposium, GD 2009, September 22-25, 2009, Chicago, IL, USA , pp. 15-20 (Official URL: http://dx.doi.org/10.1007/978-3-642-11805-0_4).

Di Giacomo, Emilio and Liotta, Giuseppe and Trotta, Francesco (2008) Drawing Colored Graphs with Contrained Vertex Positions and Few Bends per Edge. In: Graph Drawing 15th International Symposium, GD 2007, September 24-26, 2007, Sydney, Australia , pp. 315-326 (Official URL: http://dx.doi.org/10.1007/978-3-540-77537-9_31).

Everett, Hazel and Lazard, Sylvain and Liotta, Giuseppe and Wismath, Stephen (2008) Universal Sets of n Points for 1-bend Drawings of Planar Graphs with n Vertices. In: Graph Drawing 15th International Symposium, GD 2007, September 24-26, 2007, Sydney, Australia , pp. 345-351 (Official URL: http://dx.doi.org/10.1007/978-3-540-77537-9_34).

Yildiz, Canan and Mutzel, Petra and Barth, Wilhelm (2007) A New Approximation Algorithm for Bend Minimization in the Kandinsky Model. In: Graph Drawing 14th International Symposium, GD 2006, September 18-20, 2006, Karlsruhe, Germany , pp. 343-354 (Official URL: http://dx.doi.org/10.1007/978-3-540-70904-6_33).

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, Karlsruhe, Germany , pp. 66-76 (Official URL: http://dx.doi.org/10.1007/978-3-540-70904-6_8).

Wismath, Stephen K. and Di Giacomo, Emilio and Didimo, Walter and Liotta, Giuseppe and Meijer, Henk and Trotta, Francesco (2007) k-colored point-set embeddability of outerplanar graphs. In: Graph Drawing 14th International Symposium, GD 2006, September 18-20, 2006, Karlsruhe, Germany , pp. 318-329 (Official URL: http://dx.doi.org/10.1007/978-3-540-70904-6_31).

Devillers, Olivier and Everett, Hazel and Lazard, Sylvain and Pentcheva, Maria and Wismath, Stephen (2006) Drawing K_n in Three Dimensions with One Bend per Edge. In: Graph Drawing 13th International Symposium, GD 2005, September 12-14, 2005, Limerick, Ireland , pp. 83-88 (Official URL: http://dx.doi.org/10.1007/11618058_8).

Di Giacomo, Emilio and Liotta, Giuseppe and Trotta, Francesco (2006) How to Embed a Path onto Two Sets of Points. In: Graph Drawing 13th International Symposium, GD 2005, September 12-14, 2005, Limerick, Ireland , pp. 111-116 (Official URL: http://dx.doi.org/10.1007/11618058_11).

Aziza, Shabnam and Biedl, Therese (2004) Hexagonal Grid Drawings: Algorithms and Lower Bounds. In: Graph Drawing 12th International Symposium, GD 2004, September 29-October 2, 2004, New York, NY, USA , pp. 18-24 (Official URL: http://dx.doi.org/10.1007/978-3-540-31843-9_3).

Rahman, Md. Saidur and Egi, Noritsugu and Nishizeki, Takao (2004) No-Bend Orthogonal Drawings of Subdivisions of Planar Triconnected Cubic Graphs (Extended Abstract). In: Graph Drawing 11th International Symposium, GD 2003, September 21-24, 2003, Perugia, Italy , pp. 387-392 (Official URL: http://dx.doi.org/10.1007/978-3-540-24595-7_36).

Dujmovic, Vida and Suderman, Matthew and Wood, David R. (2004) Really Straight Graph Drawings. In: Graph Drawing 12th International Symposium, GD 2004, September 29-October 2, 2004, New York, NY, USA , pp. 122-132 (Official URL: http://dx.doi.org/10.1007/978-3-540-31843-9_14).

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, New York, NY, USA , pp. 195-205 (Official URL: http://dx.doi.org/10.1007/978-3-540-31843-9_21).

Wood, David R. (2002) Bounded Degree Book Embeddings and Three-Dimensional Orthogonal Graph Drawing. In: Graph Drawing 9th International Symposium, GD 2001, September 23-26, 2001, Vienna, Austria , pp. 312-327 (Official URL: http://dx.doi.org/10.1007/3-540-45848-4_25).

Biedl, Therese (2002) Drawing Outer-Planar Graphs in O(n log n) Area. In: Graph Drawing 10th International Symposium, GD 2002, August 26-28, 2002, Irvine, CA, USA , pp. 54-65 (Official URL: http://dx.doi.org/10.1007/3-540-36151-0_6).

Rahman, Md. Saidur and Naznin, Mahmuda and Nishizeki, Takao (2002) Orthogonal Drawings of Plane Graphs without Bends. In: Graph Drawing 9th International Symposium, GD 2001, September 23-26, 2001, Vienna, Austria , pp. 392-406 (Official URL: http://dx.doi.org/10.1007/3-540-45848-4_31).

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, Vienna, Austria , pp. 297-311 (Official URL: http://dx.doi.org/10.1007/3-540-45848-4_24).

Bachl, Walter (2002) Semi-dynamic Orthogonal Drawings of Planar Graphs (Extended Abstract). In: Graph Drawing 10th International Symposium, GD 2002, August 26-28, 2002, Irvine, CA, USA , pp. 354-361 (Official URL: http://dx.doi.org/10.1007/3-540-36151-0_33).

Brandes, Ulrik and Eiglsperger, Markus and Kaufmann, Michael and Wagner, Dorothea (2002) Sketch-Driven Orthogonal Graph Drawing. In: Graph Drawing 10th International Symposium, GD 2002, August 26-28, 2002, Irvine, CA, USA , pp. 131-148 (Official URL: http://dx.doi.org/10.1007/3-540-36151-0_1).

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

Nakano, Shin-Ichi and Yoshikawa, Makiko (2001) A Linear-Time Algorithm for Bend-Optimal Orthogonal Drawings of Biconnected Cubic Plane Graphs (Extended Abstract). In: Graph Drawing 8th International Symposium, GD 2000, September 20–23, 2000, Colonial Williamsburg, VA, USA , pp. 296-307 (Official URL: http://dx.doi.org/10.1007/3-540-44541-2_28).

Brandes, Ulrik and Cornelsen, Sabine and Wagner, Dorothea (2001) How to Draw the Minimum Cuts of a Planar Graph (Extended Abstract). In: Graph Drawing 8th International Symposium, GD 2000, September 20–23, 2000, Colonial Williamsburg, VA, USA , pp. 103-114 (Official URL: http://dx.doi.org/10.1007/3-540-44541-2_10).

Lynn, Benjamin Y. S. and Symvonis, Antonios and Wood, David R. (2001) Refinement of Three-Dimensional Orthogonal Graph Drawings. In: Graph Drawing 8th International Symposium, GD 2000, September 20–23, 2000, Colonial Williamsburg, VA, USA , pp. 308-320 (Official URL: http://dx.doi.org/10.1007/3-540-44541-2_29).

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

Garg, Ashim and Liotta, Giuseppe (1999) Almost Bend-Optimal Planar Orthogonal Drawings of Biconnected Degree-3 Planar Graphs in Quadratic Time. In: September 15-19, 1999, September 15-19, 1999, Štirín Castle, Czech Republic , pp. 38-48 (Official URL: http://dx.doi.org/10.1007/3-540-46648-7_4).

Cheng, C. C. and Duncan, Christian A. and Goodrich, Michael T. and Kobourov, Stephen G. (1999) Drawing Planar Graphs with Circular Arcs. In: Graph Drawing 7th International Symposium, GD’99, September 15-19, 1999, Štirín Castle, Czech Republic , pp. 117-126 (Official URL: http://dx.doi.org/10.1007/3-540-46648-7_12).

Kaufmann, Michael and Wiese, Roland (1999) Embedding Vertices at Points: Few Bends Suffice for Planar Graphs. In: Graph Drawing 7th International Symposium, GD’99, September 15-19, 1999, Štirín Castle, Czech Republic , pp. 165-174 (Official URL: http://dx.doi.org/10.1007/3-540-46648-7_17).

Closson, M. and Gartshore, S. and Johansen, John and Wismath, Stephen (1999) Fully Dynamic 3-Dimensional Orthogonal Graph Drawing. In: Graph Drawing 7th International Symposium, GD’99, September 15-19, 1999, Štirín Castle, Czech Republic , pp. 49-58 (Official URL: http://dx.doi.org/10.1007/3-540-46648-7_5).

Brandes, Ulrik and Wagner, Dorothea (1998) A Bayesian Paradigm for Dynamic Graph Layout. In: Graph Drawing 5th International Symposium, GD '97, September 18-20, 1997, Rome, Italy , pp. 236-247 (Official URL: http://dx.doi.org/10.1007/3-540-63938-1_66).

Goodrich, Michael T. and Wagner, Cristopher G. (1998) A Framework for Drawing Planar Graphs with Curves and Polylines. In: Graph Drawing 6th International Symposium, GD’ 98, August 13-15, 1998, Montréal, Canada , pp. 153-166 (Official URL: http://dx.doi.org/10.1007/3-540-37623-2_12).

Rahman, Md. Saidur and Nakano, Shin-Ichi and Nishizeki, Takao (1998) A Linear Algorithm for Optimal Orthogonal Drawings of Triconnected Cubic Plane Graphs. In: Graph Drawing 5th International Symposium, GD '97, September 18-20, 1997, Rome, Italy , pp. 99-110 (Official URL: http://dx.doi.org/10.1007/3-540-63938-1_54).

Fößmeier, Ulrich and Kaufmann, Michael (1998) Algorithms and Area Bounds for Nonplanar Orthogonal Drawings. In: Graph Drawing 5th International Symposium, GD '97, September 18-20, 1997, Rome, Italy , pp. 134-145 (Official URL: http://dx.doi.org/10.1007/3-540-63938-1_57).

Wood, David R. (1998) An Algorithm for Three-Dimensional Orthogonal Graph Drawing. In: Graph Drawing 6th International Symposium, GD’ 98, August 13-15, 1998, Montréal, Canada , pp. 332-346 (Official URL: http://dx.doi.org/10.1007/3-540-37623-2_25).

Eades, Peter and Feng, Qing-Wen (1998) Drawing Clustered Graphs on an Orthogonal Grid. In: Graph Drawing 5th International Symposium, GD '97, September 18-20, 1997, Rome, Italy , pp. 146-157 (Official URL: http://dx.doi.org/10.1007/3-540-63938-1_58).

Pach, János and Wenger, Rephael (1998) Embedding Planar Graphs at Fixed Vertex Locations. In: Graph Drawing 6th International Symposium, GD’ 98, August 13-15, 1998, Montréal, Canada , pp. 263-274 (Official URL: http://dx.doi.org/10.1007/3-540-37623-2_20).

Garrido, M. Ángeles and Márquez, Alberto (1998) Embedding a Graph in the Grid of a Surface with the Minimum Number of Bends Is NP-hard. In: Graph Drawing 5th International Symposium, GD '97, September 18-20, 1997, Rome, Italy , pp. 124-133 (Official URL: http://dx.doi.org/10.1007/3-540-63938-1_56).

Didimo, Walter and Leonforte, Antonio (1998) GRID: An Intercative Tool for Computing Orthogonal Drawings with the Minimum Number of Bends. In: Graph Drawing 5th International Symposium, GD '97, September 18-20, 1997, Rome, Italy , pp. 309-316 (Official URL: http://dx.doi.org/10.1007/3-540-63938-1_74).

Papakostas, Achilleas and Tollis, Ioannis G. (1998) Incremental Orthogonal Graph Drawing in Three Dimensions. In: Graph Drawing 5th International Symposium, GD '97, September 18-20, 1997, Rome, Italy , pp. 52-63 (Official URL: http://dx.doi.org/10.1007/3-540-63938-1_50).

Fößmeier, Ulrich (1998) Interactive Orthogonal Graph Drawing: Algorithms and Bounds. In: Graph Drawing 5th International Symposium, GD '97, September 18-20, 1997, Rome, Italy , pp. 111-123 (Official URL: http://dx.doi.org/10.1007/3-540-63938-1_55).

Bridgeman, Stina and Fanto, Jody and Garg, Ashim and Tamassia, Roberto and Vismara, Luca (1998) InteractiveGiotto: An Algorithm for Interactive Orthogonal Graph Drawing. In: Graph Drawing 5th International Symposium, GD '97, September 18-20, 1997, Rome, Italy , pp. 303-308 (Official URL: http://dx.doi.org/10.1007/3-540-63938-1_73).

Fößmeier, Ulrich and Heß, Carsten and Kaufmann, Michael (1998) On Improving Orthogonal Drawings: The 4M-Algorithm. In: Graph Drawing 6th International Symposium, GD’ 98, August 13-15, 1998, Montréal, Canada , pp. 125-137 (Official URL: http://dx.doi.org/10.1007/3-540-37623-2_10).

Biedl, Therese and Shermer, Thomas and Whitesides, Sue and Wismath, Stephen (1998) Orthogonal 3-D Graph Drawing. In: Graph Drawing 5th International Symposium, GD '97, September 18-20, 1997, Rome, Italy , pp. 76-86 (Official URL: http://dx.doi.org/10.1007/3-540-63938-1_52).

Gutwenger, Carsten and Mutzel, Petra (1998) Planar Polyline Drawings with Good Angular Resolution. In: Graph Drawing 6th International Symposium, GD’ 98, August 13-15, 1998, Montréal, Canada , pp. 167-182 (Official URL: http://dx.doi.org/10.1007/3-540-37623-2_13).

Bertolazzi, Paola and Di Battista, Giuseppe and Didimo, Walter (1998) Quasi-Upward planarity (extended abstract). In: Graph Drawing 6th International Symposium, GD’ 98, August 13-15, 1998, Montréal, Canada , pp. 15-29 (Official URL: http://dx.doi.org/10.1007/3-540-37623-2_2).

Six, Janet M. and Kakoulis, Konstantinos G. and Tollis, Ioannis G. (1998) Refinement of Orthogonal Graph Drawings. In: Graph Drawing 6th International Symposium, GD’ 98, August 13-15, 1998, Montréal, Canada , pp. 302-315 (Official URL: http://dx.doi.org/10.1007/3-540-37623-2_23).

Fößmeier, Ulrich and Kant, Goos and Kaufmann, Michael (1997) 2-Visibility Drawings of Planar Graphs. In: Symposium on Graph Drawing, GD '96 , September 18-20, 1996, Berkeley, California, USA , pp. 155-168 (Official URL: http://dx.doi.org/10.1007/3-540-62495-3_45).

Garg, Ashim and Tamassia, Roberto (1997) A New Minimum Cost Flow Algorithm with Applications to Graph Drawing. In: Symposium on Graph Drawing, GD '96, September 18-20, 1996, Berkeley, California, USA , pp. 201-216 (Official URL: http://dx.doi.org/10.1007/3-540-62495-3_49).

Papakostas, Achilleas and Tollis, Ioannis G. (1997) A Pairing Technique for Area-Efficient Orthogonal Drawings. In: Symposium on Graph Drawing, GD '96, September 18-20, 1996, Berkeley, California, USA , pp. 355-370 (Official URL: http://dx.doi.org/10.1007/3-540-62495-3_60).

Di Battista, Giuseppe and Garg, Ashim and Liotta, Giuseppe and Parise, Armando and Tamassia, Roberto and Tassinari, Emanuele and Vargiu, Francesco and Vismara, Luca (1997) Drawing Directed Acyclic Graphs: An Experimantal Study. In: Symposium on Graph Drawing, GD '96, September 18-20, 1996, Berkeley, California, USA , pp. 76-91 (Official URL: http://dx.doi.org/10.1007/3-540-62495-3_39).

Papakostas, Achilleas and Six, Janet M. and Tollis, Ioannis G. (1997) Experimental and Theoretical Results in Interactive Orthogonal Graph Drawing. In: Symposium on Graph Drawing, GD '96, September 18-20, 1996, Berkeley, California, USA , pp. 371-386 (Official URL: http://dx.doi.org/10.1007/3-540-62495-3_61).

Eades, Peter and Symvonis, Antonios and Whitesides, Sue (1997) Two Algorithms for Three Dimensional Orthogonal Graph Drawing. In: Symposium on Graph Drawing, GD '96, September 18-20, 1996, Berkeley, California, USA , pp. 139-154 (Official URL: http://dx.doi.org/10.1007/3-540-62495-3_44).

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

Fößmeier, Ulrich and Kaufmann, Michael (1996) Drawing High Degree Graphs with Low Bend Numbers. In: Symposium on Graph Drawing, GD 1995, September 20-22, 1995, Passau, Germany , pp. 254-266 (Official URL: http://dx.doi.org/10.1007/BFb0021809).

Biedl, Therese (1996) New Lower Bounds for Orthogonal Graph Drawings. In: Symposium on Graph Drawing, GD 1995, September 20-22, 1995, Passau, Germany , pp. 28-39 (Official URL: http://dx.doi.org/10.1007/BFb0021788).

Purchase, Helen C. and Cohen, Robert F. and James, Murray (1996) Validating Graph Drawing Aesthetics. In: Symposium on Graph Drawing, GD 1995, September 20-22, 1995 , Passau, Germany , pp. 435-446 (Official URL: http://dx.doi.org/10.1007/BFb0021827).

Even, S. and Granot, G. (1995) Grid Layouts of Block Diagrams - Bounding the Number of Bends in Each Connection (Extended Abstract). In: Graph Drawing DIMACS International Workshop, GD 1994, October 10–12, 1994, Princeton, New Jersey, USA , pp. 64-75 (Official URL: http://dx.doi.org/10.1007/3-540-58950-3_357).

Papakostas, Achilleas and Tollis, Ioannis G. (1995) Improved Algorithms and Bounds for Orthogonal Drawings. In: Graph Drawing DIMACS International Workshop, GD 1994, October 10–12, 1994, Princeton, New Jersey, USA , pp. 40-51 (Official URL: http://dx.doi.org/10.1007/3-540-58950-3_355).

Fößmeier, Ulrich and Kaufmann, Michael (1995) On Bend-Minimum Orthogonal Upward Drawing of Directed Planar Graphs. In: Graph Drawing DIMACS International Workshop, GD 1994, October 10–12, 1994, Princeton, New Jersey, USA , pp. 52-63 (Official URL: http://dx.doi.org/10.1007/3-540-58950-3_356).

This list was generated on Thu Apr 17 04:04:36 2014 CEST.