Items where Subject is "G Algorithms and Complexity > G.070 Area / Edge Length"

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

Eppstein, David (2013) Drawing Arrangement Graphs in Small Grids, or How to Play Planarity. In: 21st International Symposium, GD 2013, September 23-25, 2013, Bordeaux, France , pp. 436-447 (Official URL: http://dx.doi.org/10.1007/978-3-319-03841-4_38).

Balko, Martin (2013) Grid Drawings and the Chromatic Number. In: 20th International Symposium, GD 2012, September 19-21, 2012, Redmond, WA, USA , pp. 315-326 (Official URL: http://link.springer.com/chapter/10.1007/978-3-642-36763-2_28).

Chan, Timothy M. and Hoffmann, Hella-Franziska and Kiazyk, Stephen and Lubiw, Anna (2013) Minimum Length Embedding of Planar Graphs at Fixed Vertex Locations. In: 21st International Symposium, GD 2013, September 23-25, 2013, Bordeaux, France , pp. 376-387 (Official URL: http://dx.doi.org/10.1007/978-3-319-03841-4_33).

Igamberdiev, Alexander and Nielsen, Finn and Schulz, André (2013) Small Grid Embeddings of Prismatoids and the Platonic Solids. In: 21st International Symposium, GD 2013, September 23-25, 2013, Bordeaux, France , pp. 530-531 .

Di Giacomo, Emilio and Liotta, Giuseppe and Meijer, Henk (2013) The Approximate Rectangle of Influence Drawability Problem. In: 20th International Symposium, GD 2012, September 19-21, 2012, Redmond, WA, USA , pp. 114-125 (Official URL: http://link.springer.com/chapter/10.1007/978-3-642-36763-2_11).

Bannister, Michael J. and Eppstein, David (2012) Hardness of Approximate Compaction for Nonplanar Orthogonal Graph Drawings. In: Graph Drawing 19th International Symposium, GD 2011, September 21-23, 2011, Eindhoven, The Netherlands , pp. 367-378 (Official URL: http://dx.doi.org/10.1007/978-3-642-25878-7_35).

Halupczok, Immanual and Schulz, André (2012) Pinning Balloons with Perfect Angles and Optimal Area. In: Graph Drawing 19th International Symposium, GD 2011, September 21-23, 2011, Eindhoven, The Netherlands , pp. 154-165 (Official URL: http://dx.doi.org/10.1007/978-3-642-25878-7_16).

Chambers, Erin and Eppstein, David and Goodrich, Michael T. and Löffler, Maarten (2011) Drawing Graphs in the Plane with a Prescribed Outer Face and Polynomial Area. In: Graph Drawing 18th International Symposium, GD 2010, September 21-24, 2010, Konstanz, Germany , pp. 129-140 (Official URL: http://dx.doi.org/10.1007/978-3-642-18469-7_12).

Barriére, Lali and Huemer, Clemens (2010) 4-Labelings and Grid Embeddings of Plane Quadrangulations. In: Graph Drawing 17th International Symposium, GD 2009, September 22-25, 2009, Chicago, IL, USA , pp. 413-414 (Official URL: http://dx.doi.org/10.1007/978-3-642-11805-0_41).

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

Schulz , André (2010) Drawing 3-Polytopes with Good Vertex Resolution. In: Graph Drawing 17th International Symposium, GD 2009, September 22-25, 2009, Chicago, IL, USA , pp. 33-44 (Official URL: http://dx.doi.org/10.1007/978-3-642-11805-0_6).

Kaufmann, Michael and Kottler, Stephan (2010) Proving or Disproving Planar Straight-Line Embeddability onto Given Rectangles. In: Graph Drawing 17th International Symposium, GD 2009, September 22-25, 2009, Chicago, IL, USA , pp. 419-420 (Official URL: http://dx.doi.org/10.1007/978-3-642-11805-0_44).

Biedl, Therese (2010) Small Drawings of Series-Parallel Graphs and Other Subclasses of Planar Graphs. In: Graph Drawing 17th International Symposium, GD 2009, September 22-25, 2009, Chicago, IL, USA , pp. 280-291 (Official URL: http://dx.doi.org/10.1007/978-3-642-11805-0_27).

Brandes, Ulrik and Pich, Christian (2009) An Experimental Study on Distance-Based Graph Drawing. In: Graph Drawing 16th International Symposium, GD 2008, September 21- 24, 2008, Heraklion, Crete, Greece , pp. 218-229 (Official URL: http://dx.doi.org/10.1007/978-3-642-00219-9_21).

Bachmaier, Christian and Brandenburg, Franz J. and Brunner, Wolfgang and Lovász, Gergö (2009) Cyclic Leveling of Directed Graphs. In: Graph Drawing 16th International Symposium, GD 2008, September 21- 24, 2008, Heraklion, Crete, Greece , pp. 348-359 (Official URL: http://dx.doi.org/10.1007/978-3-642-00219-9_34).

Frati, Fabrizio and Patrignani, Maurizio (2008) A Note on Minimum-Area Straight-line Drawings of Planar Graphs. In: Graph Drawing 15th International Symposium, GD 2007, September 24-26, 2007, Sydney, Australia , pp. 339-344 (Official URL: http://dx.doi.org/10.1007/978-3-540-77537-9_33).

Krug, Marcus and Wagner, Dorothea (2008) Minimizing the Area for Planar Straight-Line Grid Drawings. In: Graph Drawing 15th International Symposium, GD 2007, September 24-26, 2007, Sydney, Australia , pp. 207-212 (Official URL: http://dx.doi.org/10.1007/978-3-540-77537-9_21).

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

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

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 Battista, Giuseppe and Frati, Fabrizio (2006) Small Area Drawings of Outerplanar Graphs. In: Graph Drawing 13th International Symposium, GD 2005, September 12-14, 2005, Limerick, Ireland , pp. 89-100 (Official URL: http://dx.doi.org/10.1007/11618058_9).

Di Giacomo, Emilio and Liotta, Giuseppe and Meijer, Henk and Wismath, Stephen, K. (2006) Volume Requirements of 3D Upward Drawings. In: Graph Drawing 13th International Symposium, GD 2005, September 12-14, 2005, Limerick, Ireland , pp. 101-110 (Official URL: http://dx.doi.org/10.1007/11618058_10).

Biedl, Therese and Brandenburg, Franz J. (2005) Drawing Planar Bipartite Graphs With Small Area. In: Canadian Conference on Computational Geometry, August 10-12, 2005, Windsor, Ontario, Canada , pp. 105-108 . (In Press)

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, Perugia, Italy , pp. 159-165 (Official URL: http://dx.doi.org/10.1007/978-3-540-24595-7_15).

Garg, Ashim and Rusu, Adrian (2004) Area-Efficient Drawings of Outerplanar Graphs. In: Graph Drawing 11th International Symposium, GD 2003, September 21-24, 2003, Perugia, Italy , pp. 129-134 (Official URL: http://dx.doi.org/10.1007/978-3-540-24595-7_12).

Chow, Stirling and Ruskey, Frank (2004) Drawing Area-Proportional Venn and Euler Diagrams. In: Graph Drawing 11th International Symposium, GD 2003, September 21-24, 2003, Perugia, Italy , pp. 466-477 (Official URL: http://dx.doi.org/10.1007/978-3-540-24595-7_44).

Hasunuma, Toru (2004) Laying Out Iterated Line Digraphs Using Queues. In: Graph Drawing 11th International Symposium, GD 2003, September 21-24, 2003, Perugia, Italy , pp. 202-213 (Official URL: http://dx.doi.org/10.1007/978-3-540-24595-7_19).

Calamoneri, Tiziana and Massini, Annalisa (2004) Nearly Optimal Three Dimensional Layout of Hypercube Networks. In: Graph Drawing 11th International Symposium, GD 2003, September 21-24, 2003, Perugia, Italy , pp. 247-258 (Official URL: http://dx.doi.org/10.1007/978-3-540-24595-7_23).

Akkerman, Thorsten and Buchheim, Christoph and Jünger, Michael and Teske, Daniel (2004) On the complexity of drawing trees nicely: corrigendum. [Journal (Paginated)]

De Verdière, Éric Colin and Lazarus, Francis (2004) Optimal Pants Decompositions and Shortest Homotopic Cycles on an Orientable Surface. In: Graph Drawing 11th International Symposium, GD 2003, September 21-24, 2003, Perugia, Italy , pp. 478-490 (Official URL: http://dx.doi.org/10.1007/978-3-540-24595-7_45).

Cabello, Sergio and Demaine, Erik D. and Rote, Günter (2004) Planar Embeddings of Graphs with Specified Edge Lengths. In: Graph Drawing 11th International Symposium, GD 2003, September 21-24, 2003, Perugia, Italy , pp. 283-294 (Official URL: http://dx.doi.org/10.1007/978-3-540-24595-7_26).

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

Dujmovic, Vida and Wood, David R. (2004) Three-Dimensional Grid Drawings with Sub-quadratic Volume. In: Graph Drawing 11th International Symposium, GD 2003, September 21-24, 2003, Perugia, Italy , pp. 190-201 (Official URL: http://dx.doi.org/10.1007/978-3-540-24595-7_18).

Streinu, Ileana and Tosun, Elif (2002) Camera Position Reconstruction and Tight Direction Networks. In: Graph Drawing 10th International Symposium, GD 2002, August 26-28, 2002, Irvine, CA, USA , pp. 372-373 (Official URL: http://dx.doi.org/10.1007/3-540-36151-0_39).

Binucci, Carla and Didimo, Walter and Liotta, Giuseppe and Nonato, Maddalena (2002) Computing Labeled Orthogonal Drawings. In: Graph Drawing 10th International Symposium, GD 2002, August 26-28, 2002, Irvine, CA, USA , pp. 66-73 (Official URL: http://dx.doi.org/10.1007/3-540-36151-0_7).

Mutton, Paul and Rodgers, Peter (2002) Demonstration of a Preprocessor for the Spring Embedder. In: Graph Drawing 10th International Symposium, GD 2002, August 26-28, 2002, Irvine, CA, USA , pp. 374-375 (Official URL: http://dx.doi.org/10.1007/3-540-36151-0_40).

Freivalds, Karlis and Dogrusoz, Ugur and Kikusts, Paulis (2002) Disconnected Graph Layout and the Polyomino Packing Approach. In: Graph Drawing 9th International Symposium, GD 2001, September 23-26, 2001, Vienna, Austria , pp. 378-391 (Official URL: http://dx.doi.org/10.1007/3-540-45848-4_30).

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

Eiglsperger, Markus and Kaufmann, Michael (2002) Fast Compaction for Orthogonal Drawings with Vertices of Prescribed Size. In: Graph Drawing 9th International Symposium, GD 2001, September 23-26, 2001, Vienna, Austria , pp. 124-138 (Official URL: http://dx.doi.org/10.1007/3-540-45848-4_11).

Dujmovic, Vida and Morin, Pat and Wood, David R. (2002) Path-Width and Three-Dimensional Straight-Line Grid Drawings of Graphs. In: Graph Drawing 10th International Symposium, GD 2002, August 26-28, 2002, Irvine, CA, USA , pp. 42-53 (Official URL: http://dx.doi.org/10.1007/3-540-36151-0_5).

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, Irvine, CA, USA , pp. 320-331 (Official URL: http://dx.doi.org/10.1007/3-540-36151-0_30).

Castelló, Rodolfo and Mili, Rym and Tollis, Ioannis G. (2001) An Algorithmic Framework for Visualizing Statecharts. In: Graph Drawing 8th International Symposium, GD 2000, September 20–23, 2000, Colonial Williamsburg, VA, USA , pp. 139-149 (Official URL: http://dx.doi.org/10.1007/3-540-44541-2_13).

Klau, Gunnar W. and Klein, Karsten and Mutzel, Petra (2001) An Experimental Comparison of Orthogonal Compaction Algorithms (Extended Abstract). In: Graph Drawing 8th International Symposium, GD 2000, September 20–23, 2000, Colonial Williamsburg, VA, USA , pp. 37-51 (Official URL: http://dx.doi.org/10.1007/3-540-44541-2_5).

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

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

Miura, Kazuyuki and Nakano, Shin-Ichi and Nishizeki, Takao (1999) Grid Drawings of Four-Connected Plane Graphs. In: Graph Drawing 7th International Symposium, GD’99, September 15-19, 1999, Štirín Castle, Czech Republic , pp. 145-154 (Official URL: http://dx.doi.org/10.1007/3-540-46648-7_15).

Bridgeman, Stina and Di Battista, Giuseppe and Didimo, Walter and Liotta, Giuseppe and Tamassia, Roberto and Vismara, Luca (1999) Turn-Regularity and Planar Orthogonal Drawings (Extended Abstract). In: Graph Drawing 7th International Symposium, GD’99, September 15-19, 1999, Štirín Castle, Czech Republic , pp. 8-26 (Official URL: http://dx.doi.org/10.1007/3-540-46648-7_2).

Barouni, Ala Eddine and Jaoua, Ali and Zaguia, Nejib (1999) Visualizing Algorithms for the Design and Analysis of Survivable Networks. In: Graph Drawing 7th International Symposium, GD’99, September 15-19, 1999, Štirín Castle, Czech Republic , pp. 232-241 (Official URL: http://dx.doi.org/10.1007/3-540-46648-7_24).

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

Hayashi, Kunihiko and Inoue, Michiko and Masuzawa, Toshimitsu and Fujiwara, Hideo (1998) A Layout Adjustment Problem for Disjoint Rectangles Preserving Orthogonal Order. In: Graph Drawing 6th International Symposium, GD’ 98, August 13-15, 1998, Montréal, Canada , pp. 183-197 (Official URL: http://dx.doi.org/10.1007/3-540-37623-2_14).

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

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

Duncan, Christian A. and Goodrich, Michael T. and Kobourov, Stephen G. (1998) Balanced Aspect Ratio Trees and Their Use for Drawing Very Large Graphs. In: Graph Drawing 6th International Symposium, GD’ 98, August 13-15, 1998, Montréal, Canada , pp. 111-124 (Official URL: http://dx.doi.org/10.1007/3-540-37623-2_9).

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

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, Rome, Italy , pp. 371-382 (Official URL: http://dx.doi.org/10.1007/3-540-63938-1_82).

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

Calamoneri, Tiziana and Massini, Annalisa (1998) On Three-Dimensional Layout of Interconnection Networks (Extended Abstract). In: Graph Drawing 5th International Symposium, GD '97, September 18-20, 1997, Rome, Italy , pp. 64-75 (Official URL: http://dx.doi.org/10.1007/3-540-63938-1_51).

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

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, Montréal, Canada , pp. 275-287 (Official URL: http://dx.doi.org/10.1007/3-540-37623-2_21).

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

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

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, Berkeley, California, USA , pp. 63-75 (Official URL: http://dx.doi.org/10.1007/3-540-62495-3_38).

Cobos, F. J. and Dana, J. C. and Hurtado, Ferran and Márquez, Alberto and Mateos, F. (1996) On a Visibility Representation of Graphs. In: Symposium on Graph Drawing, GD 1995, September 20-22, 1995, Passau, Germany , pp. 152-161 (Official URL: http://dx.doi.org/10.1007/BFb0021799).

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

Chrobak, Marek and Nakano, Shin-Ichi (1995) Minimum-Width Grid Drawings of Plane Graphs (Extended Abstract). In: Graph Drawing DIMACS International Workshop, GD 1994, October 10–12, 1994, Princeton, New Jersey, USA , pp. 104-110 (Official URL: http://dx.doi.org/10.1007/3-540-58950-3_361).

Crescenzi, P. and Piperno, A. (1995) Optimal-area upward drawings of AVL trees (Extended abstract). In: Graph Drawing DIMACS International Workshop, GD 1994, October 10–12, 1994, Princeton, New Jersey, USA , pp. 307-317 (Official URL: http://dx.doi.org/10.1007/3-540-58950-3_386).

Cohen, Robert F. and Eades, Peter and Lin, Tao and Ruskey, Frank (1995) Three-Dimensional Graph Drawing. In: Graph Drawing DIMACS International Workshop, GD 1994, October 10–12, 1994, Princeton, New Jersey, USA , pp. 1-11 (Official URL: http://dx.doi.org/10.1007/3-540-58950-3_351).

Jourdan, Guy-Vincent and Rival, Ivan and Zaguia, Nejib (1995) Upward Drawing on the Plane Grid Using Less Ink (Extended Abstract). In: Graph Drawing DIMACS International Workshop, GD 1994, October 10–12, 1994, Princeton, New Jersey, USA , pp. 318-327 (Official URL: http://dx.doi.org/10.1007/3-540-58950-3_387).

This list was generated on Thu Oct 23 04:04:56 2014 CEST.