Items where Subject is "M Methods > M.600 Planar"

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 | M | N | P | R | S | T | V | W
Number of items at this level: 75.

A

Aggarwal, Alok and Kosaraju, Rao and Pop, Mihai (1998) Drawing of Two-Dimensional Irregular Meshes. In: Graph Drawing 6th International Symposium, GD’ 98, August 13-15, 1998 , pp. 1-14(Official URL: http://dx.doi.org/10.1007/3-540-37623-2_1).

Alam, Muhammed Jawaherul and Biedl, Therese and Felsner, Stefan and Kaufmann, Michael and Kobourov, Stephen G. (2012) Proportional Contact Representations of Planar Graphs. In: Graph Drawing 19th International Symposium, GD 2011, September 21-23, 2011 , pp. 26-38(Official URL: http://dx.doi.org/10.1007/978-3-642-25878-7_4).

Alzohairi, Mohammad and Rival, Ivan (1997) Series-Parallel Planar Ordered Sets Have Pagenumber Two (Extended Abstract). In: Symposium on Graph Drawing, GD '96, September 18-20, 1996 , pp. 11-24(Official URL: http://dx.doi.org/10.1007/3-540-62495-3_34).

Angelini, Patrizio and Cortese, Pier Francesco and Di Battista, Giuseppe and Patrignani, Maurizio (2009) Topological Morphing of Planar Graphs. In: Graph Drawing 16th International Symposium, GD 2008, September 21- 24, 2008 , pp. 145-156(Official URL: http://dx.doi.org/10.1007/978-3-642-00219-9_15).

Angelini, Patrizio and Di Battista, Giuseppe and Kaufmann, Michael and Mchedlidze, Tamara and Roselli, Vincenzo and Squarcella, Claudio (2012) Small Point Sets for Simply-Nested Planar Graphs. In: Graph Drawing 19th International Symposium, GD 2011, September 21-23, 2011 , pp. 75-85(Official URL: http://dx.doi.org/ 10.1007/978-3-642-25878-7_8).

Auber, David and Bonichon, Nicolas and Dorbec, Paul and Pennarun, Claire (2015) Rook-Drawing for Plane Graphs. In: Graph Drawing and Network Visualization: 23rd International Symposium, GD 2015, September 24-26, 2015 , pp. 180-191(Official URL: http://dx.doi.org/10.1007/978-3-319-27261-0_15).

B

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

Barrera-Cruz, Fidel and Haxell, Penny and Lubiw, Anna (2014) Morphing Schnyder Drawings of Planar Triangulations. In: Graph Drawing 22nd International Symposium, GD 2014, September 24-26, 2014 , pp. 294-305(Official URL: http://dx.doi.org/10.1007/978-3-662-45803-7_25).

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

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

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

Biedl, Therese and Bretscher, Anna and Meijer, Henk (1999) Rectangle of Influence Drawings of Graphs without Filled 3-Cycles. In: Graph Drawing 7th International Symposium, GD’99, September 15-19, 1999 , pp. 359-368(Official URL: http://dx.doi.org/10.1007/3-540-46648-7_37).

Bläsius, Thomas and Karrer, Annette and Rutter, Ignaz (2013) Simultaneous Embedding: Edge Orderings, Relative Positions, Cutvertices. In: 21st International Symposium, GD 2013, September 23-25, 2013 , pp. 220-231(Official URL: http://dx.doi.org/10.1007/978-3-319-03841-4_20).

Bose, Prosenjit (1998) On Embedding an Outer-Planar Graph in a Point Set. In: Graph Drawing 5th International Symposium, GD '97, September 18-20, 1997 , pp. 25-36(Official URL: http://dx.doi.org/10.1007/3-540-63938-1_47).

Boyer, John M. (2006) A New Method for Efficiently Generating Planar Graph Visibility Representations. In: Graph Drawing 13th International Symposium, GD 2005, September 12-14, 2005 , pp. 508-511(Official URL: http://dx.doi.org/10.1007/11618058_47).

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

C

Cano, Javier and Tóth, Csaba D. and Urrutia, Jorge (2012) Upper Bound Constructions for Untangling Planar Geometric Graphs. In: Graph Drawing 19th International Symposium, GD 2011, September 21-23, 2011 , pp. 290-295(Official URL: http://dx.doi.org/ 10.1007/978-3-642-25878-7_28).

Chanda, Amrita and Garg, Ashim (2002) Compact Encodings of Planar Orthogonal Drawings. In: Graph Drawing 10th International Symposium, GD 2002, August 26-28, 2002 , pp. 174-185(Official URL: http://dx.doi.org/10.1007/3-540-36151-0_17).

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

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

Chimani, Markus and Klein, Karsten and Wiedera, Tilo (2016) A Note on the Practicality of Maximal Planar Subgraph Algorithms. In: Graph Drawing and Network Visualization. GD 2016, September, 19. - 21., 2016 , pp. 357-364(Official URL: http://dx.doi.org/10.1007/978-3-319-50106-2_28).

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 , pp. 104-110(Official URL: http://dx.doi.org/10.1007/3-540-58950-3_361).

D

De Castro, Natalia and Cobos, F. J. and Dana, J. C. and Márquez, Alberto and Noy, M. (1999) Triangle-Free Planar Graphs as Segments Intersection Graphs. In: Graph Drawing 7th International Symposium, GD’99, September 15-19, 1999 , pp. 341-350(Official URL: http://dx.doi.org/10.1007/3-540-46648-7_35).

De Fraysseix, Hubert and Ossona de Mendez, Patrice (1995) Regular Orientations, Arboricity, and Augmentation. In: Graph Drawing DIMACS International Workshop, GD 1994, October 10–12, 1994 , pp. 111-118(Official URL: http://dx.doi.org/10.1007/3-540-58950-3_362).

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

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 , pp. 89-100(Official URL: http://dx.doi.org/10.1007/11618058_9).

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 , pp. 111-116(Official URL: http://dx.doi.org/10.1007/11618058_11).

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

Djidjev, Hristo (1995) On Drawing a Graph Convexly in the Plane (Extended Abstract). In: Graph Drawing DIMACS International Workshop, GD 1994, October 10–12, 1994 , pp. 76-83(Official URL: http://dx.doi.org/10.1007/3-540-58950-3_358).

Dujmović, Vida (2015) The Utility of Untangling. In: Graph Drawing and Network Visualization: 23rd International Symposium, GD 2015, September 24-26, 2015 , pp. 321-332(Official URL: http://dx.doi.org/10.1007/978-3-319-27261-0_27).

Dujmović, Vida and Evans, William S. and Lazard, Sylvain and Lenhart, William J. and Liotta, Giuseppe and Rappaport, David and Wismath, Stephen (2012) On Point-Sets That Support Planar Graphs. In: Graph Drawing 19th International Symposium, GD 2011, September 21-23, 2011 , pp. 64-74(Official URL: http://dx.doi.org/ 10.1007/978-3-642-25878-7_7).

Duncan, Christian A. and Efrat, Alon and Kobourov, Stephen G. and Wenk, Carola (2002) Drawing with Fat Edges. In: Graph Drawing 9th International Symposium, GD 2001, September 23-26, 2001 , pp. 162-177(Official URL: http://dx.doi.org/10.1007/3-540-45848-4_14).

Duncan, Christian A. and Goodrich, Michael T. and Kobourov, Stephen G. (1999) Planarity-Preserving Clustering and Embedding for Large Planar Graphs. In: Graph Drawing 7th International Symposium, GD’99, September 15-19, 1999 , pp. 186-196(Official URL: http://dx.doi.org/10.1007/3-540-46648-7_19).

Duncan, Christian A. and Kobourov, Stephen G. (2002) Polar Coordinate Drawing of Planar Graphs with Good Angular Resolution. In: Graph Drawing 9th International Symposium, GD 2001, September 23-26, 2001 , pp. 407-421(Official URL: http://dx.doi.org/10.1007/3-540-45848-4_32).

Duncan, Christian A. and Eppstein, David and Goodrich, Michael T. and Kobourov, Stephen G. and Löffler, Maarten (2012) Planar and Poly-arc Lombardi Drawings. In: Graph Drawing 19th International Symposium, GD 2011, September 21-23, 2011 , pp. 308-319(Official URL: http://dx.doi.org/ 10.1007/978-3-642-25878-7_30).

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

Edwards, Keith and Farr, Graham (2002) An Algorithm for Finding Large Induced Planar Subgraphs. In: Graph Drawing 9th International Symposium, GD 2001, September 23-26, 2001 , pp. 75-83(Official URL: http://dx.doi.org/10.1007/3-540-45848-4_6).

Efrat, Alon and Erten, Cesim and Kobourov, Stephen G. (2004) Fixed-Location Circular-Arc Drawing of Planar Graphs. In: Graph Drawing 11th International Symposium, GD 2003, September 21-24, 2003 , pp. 147-158(Official URL: http://dx.doi.org/10.1007/978-3-540-24595-7_14).

Eppstein, David (2013) Planar Lombardi Drawings for Subcubic Graphs. In: 20th International Symposium, GD 2012, September 19-21, 2012 , pp. 126-137(Official URL: http://link.springer.com/chapter/10.1007/978-3-642...).

Estrella-Balderrama, Alejandro and Fowler, J. Joseph and Kobourov, Stephen G. (2010) On the Characterization of Level Planar Trees by Minimal Patterns. In: Graph Drawing 17th International Symposium, GD 2009, September 22-25, 2009 , pp. 69-80(Official URL: http://dx.doi.org/10.1007/978-3-642-11805-0_9).

F

Felsner, Stefan and Liotta, Giuseppe and Wismath, Stephen (2002) Straight-Line Drawings on Restricted Integer Grids in Two and Three Dimensions (Extended Abstract). In: Graph Drawing 9th International Symposium, GD 2001, September 23-26, 2001 , pp. 328-342(Official URL: http://dx.doi.org/10.1007/3-540-45848-4_26).

Felsner, Stefan and Zickfeld, Florian (2007) Schnyder Woods and Orthogonal Surfaces. In: Graph Drawing 14th International Symposium, GD 2006, September 18-20, 2006 , pp. 417-429(Official URL: http://dx.doi.org/10.1007/978-3-540-70904-6_40).

Fowler, J. Joseph and Gutwenger, Carsten and Jünger, Michael and Mutzel, Petra and Schulz, Michael (2009) An SPQR-Tree Approach to Decide Special Cases of Simultaneous Embedding with Fixed Edges. In: Graph Drawing 16th International Symposium, GD 2008, September 21- 24, 2008 , pp. 157-168(Official URL: http://dx.doi.org/10.1007/978-3-642-00219-9_16).

Fowler, J. Joseph and Kobourov, Stephen G. (2013) Planar Preprocessing for Spring Embedders. In: 20th International Symposium, GD 2012, September 19-21, 2012 , pp. 388-399(Official URL: http://link.springer.com/chapter/10.1007/978-3-642...).

G

Garg, Ashim (1995) On Drawing Angle Graphs (Extended Abstract). In: Graph Drawing DIMACS International Workshop, GD 1994, October 10–12, 1994 , pp. 84-95(Official URL: http://dx.doi.org/10.1007/3-540-58950-3_359).

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

Goodrich, Michael T. and Pszona, Paweł (2013) Streamed Graph Drawing and the File Maintenance Problem. In: 21st International Symposium, GD 2013, September 23-25, 2013 , pp. 256-267(Official URL: http://dx.doi.org/10.1007/978-3-319-03841-4_23).

Gutwenger, Carsten and Jünger, Michael and Leipert, Sebastian and Mutzel, Petra and Percan, Merijam and Weiskircher, René (2002) Advances in C-Planarity Testing of Clustered Graphs (Extended Abstract). In: Graph Drawing 10th International Symposium, GD 2002, August 26-28, 2002 , pp. 220-235(Official URL: http://dx.doi.org/10.1007/3-540-36151-0_21).

Gutwenger, Carsten and Mutzel, Petra (2001) A Linear Time Implementation of SPQR-Trees. In: Graph Drawing 8th International Symposium, GD 2000, September 20–23, 2000 , pp. 77-90(Official URL: http://dx.doi.org/10.1007/3-540-44541-2_8).

Gutwenger, Carsten and Mutzel, Petra (2004) Graph Embedding with Minimum Depth and Maximum External Face (Extended Abstract). In: Graph Drawing 11th International Symposium, GD 2003, September 21-24, 2003 , pp. 259-272(Official URL: http://dx.doi.org/10.1007/978-3-540-24595-7_24).

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

H

He, Xin and Kao, Ming-Yang (1995) Regular Edge Labelings and Drawings of Planar Graphs. In: Graph Drawing DIMACS International Workshop, GD 1994, October 10–12, 1994 , pp. 96-103(Official URL: http://dx.doi.org/10.1007/3-540-58950-3_360).

Healy, Patrick and Kuusik, Ago (1999) The Vertex-Exchange Graph: A New Concept for Multi-level Crossing Minimisation. In: Graph Drawing 7th International Symposium, GD’99, September 15-19, 1999 , pp. 205-216(Official URL: http://dx.doi.org/10.1007/3-540-46648-7_21).

Heath, Lenwood S. and Pemmaraju, Sriram V. (1996) Recognizing Leveled-Planar Dags in Linear Time. In: Symposium on Graph Drawing, GD 1995, September 20-22, 1995 , pp. 300-311(Official URL: http://dx.doi.org/10.1007/BFb0021813).

Hliněný, Petr (1996) Contact Graphs of Curves. In: Symposium on Graph Drawing, GD 1995, September 20-22, 1995 , pp. 312-323(Official URL: http://dx.doi.org/10.1007/BFb0021814).

Hutchinson, Joan P. and Shermer, Thomas and Vince, Andrew (1996) On Representations of Some Thickness-Two Graphs. In: Symposium on Graph Drawing, GD 1995, September 20-22, 1995 , pp. 324-332(Official URL: http://dx.doi.org/10.1007/BFb0021815).

J

Jünger, Michael and Leipert, Sebastian and Mutzel, Petra (1998) Level Planarity Testing in Linear Time. In: Graph Drawing 6th International Symposium, GD’ 98, August 13-15, 1998 , pp. 224-237(Official URL: http://dx.doi.org/10.1007/3-540-37623-2_17).

Jünger, Michael and Mutzel, Petra (1994) The Polyhedral Approach to the Maximum Planar Subgraph Problem: New Chances for Related Problems. [Preprint]

K

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

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

M

Miura, Kazuyuki and Azuma, Machiko and Nishizeki, Takao (2006) Convex Drawings of Plane Graphs of Minimum Outer Apices. In: Graph Drawing 13th International Symposium, GD 2005, September 12-14, 2005 , pp. 297-308(Official URL: http://dx.doi.org/10.1007/11618058_27).

Miura, Kazuyuki and Miyazawa, Ayako and Nishizeki, Takao (2002) Extended Rectangular Drawings of Plane Graphs with Designated Corners (Extended Abstract). In: Graph Drawing 10th International Symposium, GD 2002, August 26-28, 2002 , pp. 256-267(Official URL: http://dx.doi.org/10.1007/3-540-36151-0_24).

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

Mutzel, Petra and Ziegler, Thomas (1999) The Constrained Crossing Minimization Problem. In: Graph Drawing 7th International Symposium, GD’99, September 15-19, 1999 , pp. 175-185(Official URL: http://dx.doi.org/10.1007/3-540-46648-7_18).

N

Nakano, Shin-Ichi and Uno, Takeaki (2004) More Efficient Generation of Plane Triangulations. In: Graph Drawing 11th International Symposium, GD 2003, September 21-24, 2003 , pp. 273-282(Official URL: http://dx.doi.org/10.1007/978-3-540-24595-7_25).

Nöllenburg, Martin and Wolff, Alexander (2006) A Mixed-Integer Program for Drawing High-Quality Metro Maps. In: Graph Drawing 13th International Symposium, GD 2005, September 12-14, 2005 , pp. 321-333(Official URL: http://dx.doi.org/10.1007/11618058_29).

P

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 , pp. 40-51(Official URL: http://dx.doi.org/10.1007/3-540-58950-3_355).

R

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

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

Rahman, Md. Saidur and Nishizeki, Takao and Ghosh, Shubhashis (2002) Rectangular Drawings of Planar Graphs (Extended Abstract). In: Graph Drawing 10th International Symposium, GD 2002, August 26-28, 2002 , pp. 244-255(Official URL: http://dx.doi.org/10.1007/3-540-36151-0_23).

S

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

Suk, Andrew (2012) k-Quasi-Planar Graphs. In: Graph Drawing 19th International Symposium, GD 2011, September 21-23, 2011 , pp. 266-277(Official URL: http://dx.doi.org/10.1007/978-3-642-25878-7_26).

T

Thomas, Robin (1999) Graph Planarity and Related Topics. In: Graph Drawing 7th International Symposium, GD’99, September 15-19, 1999 , pp. 137-144(Official URL: http://dx.doi.org/10.1007/3-540-46648-7_14).

V

Van Kreveld, Marc (2011) The Quality Ratio of RAC Drawings and Planar Drawings of Planar Graphs. In: Graph Drawing 18th International Symposium, GD 2010, September 21-24, 2010 , pp. 371-376(Official URL: http://dx.doi.org/10.1007/978-3-642-18469-7_34).

W

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 , pp. 318-329(Official URL: http://dx.doi.org/10.1007/978-3-540-70904-6_31).

This list was generated on Mon Dec 11 10:28:48 2017 CET.