Subject: P.540 Planar
Number of records: 61.
Fößmeier, Ulrich and Kant, Goos and Kaufmann, Michael (1997) 2-Visibility Drawings of Planar Graphs. In North, Stephen, Eds. Proceedings Graph Drawing, pages pp. 155-168, Berkeley, California, USA.
Goodrich, Michael T. and Wagner, Cristopher G. (1998) A Framework for Drawing Planar Graphs with Curves and Polylines. In Whitesides, Sue H., Eds. Proceedings Graph Drawing, pages pp. 153-166, Montréal, Canada.
Nakano, Shin-ichi and Rahman, Md. Saidur and Nishizeki, Takao (1997) A Linear-Time Algorithm for Four-Partitioning Four-Connected Planar Graphs. In North, Stephen, Eds. Proceedings Graph Drawing, pages pp. 334-344, Berkeley, California,.
Nöllenburg, Martin and Wolff, Alexander (2006) A Mixed-Integer Program for Drawing High-Quality Metro Maps. In Healy, Patrick and Nikolov, Nikola S., Eds. Proceedings Graph Drawing, pages pp. 321-333, Limerick, Ireland.
Boyer, John M. (2006) A New Method for Efficiently Generating Planar Graph Visibility Representations. In Healy, Patrick and Nikolov, Nikola S., Eds. Proceedings Graph Drawing, pages pp. 508-511, Limerick, Ireland.
Garg, Ashim and Tamassia, Roberto (1997) A New Minimum Cost Flow Algorithm with Applications to Graph Drawing. In North, Stephen, Eds. Proceedings Graph Drawing, pages pp. 201-216, Berkeley, California, USA.
Jünger, Michael and Leipert, Sebastian and Mutzel, Petra (1998) A Note on Computing a Maximal Planar Subgraph using PQ-Trees.
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.
Eppstein, David (2004) Algorithms for Drawing Media. In Pach, János, Eds. Proceedings Graph Drawing, pages pp. 173-183, New York.
Garg, Ashim and Liotta, Giuseppe (1999) Almost Bend-Optimal Planar Orthogonal Drawings of Biconnected Degree-3 Planar Graphs in Quadratic Time. In Kratochvíl, Jan, Eds. Proceedings September 15-19, 1999, pages pp. 38-48, Stirín Castle, Czech Republic.
Klau, Gunnar W. and Klein, Karsten and Mutzel, Petra (2001) An Experimental Comparison of Orthogonal Compaction Algorithms (Extended Abstract). In Marks, Joe, Eds. Proceedings Graph Drawing, pages pp. 37-51, Colonial Williamsburg.
Lin, Xuemin and Eades, Peter (1998) Area Requirements for Drawing Hierarchically Planar Graphs. In Di Battista, Giuseppe, Eds. Proceedings Graph Drawing, pages pp. 219-229, Rome, Italy.
Garg, Ashim and Rusu, Adrian (2004) Area-Efficient Drawings of Outerplanar Graphs. In Liotta, Giuseppe, Eds. Proceedings Graph Drawing, pages pp. 129-134, Perugia.
Healy, Patrick and Lynch, Karol (2004) Building Blocks of Upward Planar Digraphs. In Pach, János, Eds. Proceedings Graph Drawing, pages pp. 296-306, New York.
Chanda, Amrita and Garg, Ashim (2002) Compact Encodings of Planar Orthogonal Drawings. In Goodrich, Michael T. and Kobourov, Stephen G., Eds. Proceedings Graph Drawing, pages pp. 174-185, Irvine, CA, USA.
Di Giacomo, Emilio and Didimo, Walter and Liotta, Giuseppe and Meijer, Henk (2004) Computing Radial Drawings on the Minimum Number of Circles. In Pach, János, Eds. Proceedings Graph Drawing, pages pp. 250-261, New York.
Dickerson, Matthew and Eppstein, David and Goodrich, Michael T. and Meng, Jeremy Yu (2004) Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way. In Liotta, Giuseppe, Eds. Proceedings Graph Drawing, pages pp. 1-12, Perugia, Italy.
Miura, Kazuyuki and Azuma, Machiko and Nishizeki, Takao (2006) Convex Drawings of Plane Graphs of Minimum Outer Apices. In Healy, Patrick and Nikolov, Nikola S., Eds. Proceedings Graph Drawing, pages pp. 297-308, Limerick, Ireland.
Eppstein, David and Goodrich, Michael T. and Meng, Jeremy Yu (2006) Delta-confluent Drawings. In Healy, Patrick and Nikolov, Nikola S., Eds. Proceedings Graph Drawing, pages pp. 165-176, Limerick, Ireland.
Aggarwal, Alok and Kosaraju, Rao and Pop, Mihai (1998) Drawing of Two-Dimensional Irregular Meshes. In Whitesides, Sue H., Eds. Proceedings Graph Drawing, pages pp. 1-14, Montréal, Canada.
Biedl, Therese (2002) Drawing Outer-Planar Graphs in O(n log n) Area. In Goodrich, Michael T. and Kobourov, Stephen G., Eds. Proceedings Graph Drawing, pages pp. 54-65, Irvine, CA, USA.
Miura, Kazuyuki and Miyazawa, Ayako and Nishizeki, Takao (2002) Extended Rectangular Drawings of Plane Graphs with Designated Corners (Extended Abstract). In Goodrich, Michael T. and Kobourov, Stephen G., Eds. Proceedings Graph Drawing, pages pp. 256-267, Irvine, CA, USA.
Miura, Kazuyuki and Nakano, Shin-ichi and Nishizeki, Takao (1999) Grid Drawings of Four-Connected Plane Graphs. In Kratochvíl, Jan, Eds. Proceedings Graph Drawing, pages pp. 145-154, Stirín Castle, Czech Republic.
Di Giacomo, Emilio and Didimo, Walter and Liotta, Giuseppe and Suderman, Matthew (2004) Hamiltonian-with-Handles Graphs and the k-Spine Drawability Problem. In Pach, János, Eds. Proceedings Graph Drawing, pages pp. 262-272, New York.
Lenhart, William and Liotta, Giuseppe (1996) How to Draw Outerplanar Minimum Weight Triangulations. In Brandenburg, Franz J., Eds. Proceedings Graph Drawing, pages pp. 373-384, Passau, Germany.
Brandes, Ulrik and Cornelsen, Sabine and Wagner, Dorothea (2001) How to Draw the Minimum Cuts of a Planar Graph
(Extended Abstract). In Marks, Joe, Eds. Proceedings Graph Drawing, pages pp. 103-114, Colonial Williamsburg.
Di Giacomo, Emilio and Liotta, Giuseppe and Trotta, Francesco (2006) How to Embed a Path onto Two Sets of Points. In Healy, Patrick and Nikolov, Nikola S., Eds. Proceedings Graph Drawing, pages pp. 111-116, Limerick, Ireland.
Papakostas, Achilleas and Tollis, Ioannis G. (1995) Improved Algorithms and Bounds for Orthogonal Drawings. In Tamassia, Roberto and Tollis, Ioannis G., Eds. Proceedings Graph Drawing, pages pp. 40-51, Princeton.
Kratochvíl, Jan (1997) Intersection Graphs of Noncrossing Arc-Connected Sets in the Plane. In North, Stephen, Eds. Proceedings Symposium on Graph Drawing, GD '96, pages pp. 268-270, Berkeley, California,.
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 Kaufmann, Michael and Wagner, Dorothea, Eds. Proceedings Graph Drawing, pages pp. 318-329, Karlsruhe, Germany.
Jünger, Michael and Leipert, Sebastian (1999) Level Planar Embedding in linear Time.
Jünger, Michael and Leipert, Sebastian (2002) Level Planar Embedding in linear Time. Journal of Graph Algorithms and Applications 6(1).
Jünger, Michael and Leipert, Sebastian and Mutzel, Petra (1998) Level Planarity Testing in Linear Time.
Jünger, Michael and Mutzel, Petra (1993) Maximum Planar Subgraphs and Nice Embeddings: Practical Layout Tools.
Krug, Marcus and Wagner, Dorothea (2008) Minimizing the Area for Planar Straight-Line Grid Drawings. In Hong, Seok-Hee and Nishizeki, Takao and Quan, Wu, Eds. Proceedings Graph Drawing, pages pp. 207-212, Sidney, Australia.
Chrobak, Marek and Nakano, Shin-ichi (1995) Minimum-Width Grid Drawings of Plane Graphs (Extended Abstract). In Tamassia, Roberto and Tollis, Ioannis G., Eds. Proceedings Graph Drawing, pages pp. 104-110, Princeton.
Goaoc, Xavier and Kratochvíl, Jan and Okamoto, Yoshio and Shin, Chan-Su and Wolff, Alexander (2008) Moving Vertices to Make Drawings Plane. In Hong, Seok-Hee and Nishizeki, Takao and Quan, Wu, Eds. Proceedings Graph Drawing, pages pp. 101-112, Sidney, Australia.
Djidjev, Hristo (1995) On Drawing a Graph Convexly in the Plane (Extended Abstract). In Tamassia, Roberto and Tollis, Ioannis G., Eds. Proceedings Graph Drawing, pages pp. 76-83, Princeton.
Garg, Ashim (1995) On Drawing Angle Graphs (Extended Abstract). In Tamassia, Roberto and Tollis, Ioannis G., Eds. Proceedings Graph Drawing, pages pp. 84-95, Princeton.
García, A. and Hernando, C. and Hurtado, F. and Noy, M. and Tejel, J. (1998) Packing Trees into Planar Graphs. In DiBattista, Giuseppe, Eds. Proceedings Graph Drawing, pages pp. 383-390, Rome, Italy.
Jünger, Michael and Leipert, Sebastian and Mutzel, Petra (1997) Pitfalls of using PQ-Trees in Automatic Graph Drawing.
Gutwenger, Carsten and Mutzel, Petra (1998) Planar Polyline Drawings with Good Angular Resolution
. In Whitesides, Sue H., Eds. Proceedings Graph Drawing, pages pp. 167-182, Montréal, Canada.
Gutwenger, Carsten and Klein, Karsten and Mutzel, Petra (2007) Planarity Testing and Optimal Edge Insertion with Embedding Constraints. In Kaufmann, Michael and Wagner, Dorothea, Eds. Proceedings Graph Drawing, pages pp. 126-137, Karlsruhe, Germany.
Duncan, Christian A. and Goodrich, Michael T. and Kobourov, Stephen G. (1999) Planarity-Preserving Clustering and Embedding for Large Planar Graphs. In Kratochvíl, Jan, Eds. Proceedings Graph Drawing, pages pp. 186-196, Stirín Castle, Czech Republic.
Suderman, Matthew (2006) Proper and Planar Drawings of Graphs on Three Layers. In Healy, Patrick and Nikolov, Nikola S., Eds. Proceedings Graph Drawing, pages pp. 434-445, Limerick, Ireland.
Lenhart, William and Liotta, Giuseppe (1997) Proximity Drawings of Outerplanar Graphs (extended abstract). In North, Stephen, Eds. Proceedings Graph Drawing, pages pp. 286-302, Berkeley, California, USA.
Bertolazzi, Paola and Di Battista, Giuseppe and Didimo, Walter (1998) Quasi-Upward planarity (extended abstract). In Whitesides, Sue H., Eds. Proceedings Graph Drawing, pages pp. 15-29, Montréal, Canada.
Rahman, Md. Saidur and Nishizeki, Takao and Ghosh, Shubhashis (2002) Rectangular Drawings of Planar Graphs (Extended Abstract). In Goodrich, Michael T. and Kobourov, Stephen G., Eds. Proceedings Graph Drawing, pages pp. 244-255, Irvine, CA, USA.
He, Xin and Kao, Ming-Yang (1995) Regular Edge Labelings and Drawings of Planar Graphs. In Tamassia, Roberto and Tollis, Ioannis G., Eds. Proceedings Graph Drawing, pages pp. 96-103, Princeton.
Bachl, Walter (2002) Semi-dynamic Orthogonal Drawings of Planar Graphs (Extended Abstract). In Goodrich, Michael T. and Kobourov, Stephen G., Eds. Proceedings Graph Drawing, pages pp. 354-361, Irvine, CA, USA.
Di Battista, Giuseppe and Frati, Fabrizio (2006) Small Area Drawings of Outerplanar Graphs. In Healy, Patrick and Nikolov, Nikola S., Eds. Proceedings Graph Drawing, pages pp. 89-100, Limerick, Ireland.
Jünger, Michael and Mutzel, Petra (1993) Solving the Maximum Weight Planar Subgraph Problem by Branch-and-Cut.
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 Goodrich, Michael T. and Kobourov, Stephen G., Eds. Proceedings Graph Drawing, pages pp. 332-343, Irvine, CA, USA.
Garg, Ashim and Rusu, Adrian (2002) Straight-Line Drawings of Binary Trees with Linear Area and Arbitrary Aspect Ratio (Extended Abstract). In Goodrich, Michael T. and Kobourov, Stephen G., Eds. Proceedings Graph Drawing, pages pp. 320-331, Irvine, CA, USA.
Jünger, Michael and Mutzel, Petra (1994) The Polyhedral Approach to the Maximum Planar Subgraph Problem: New Chances for Related Problems.
Healy, Patrick and Kuusik, Ago (1999) The Vertex-Exchange Graph: A New Concept for Multi-level Crossing Minimisation. In Kratochvíl, Jan, Eds. Proceedings Graph Drawing, pages pp. 205-216, Stirín Castle, Czech Republic.
Hlinený, Petr (1998) Touching Graphs of Unit Balls. In DiBattista, Giuseppe, Eds. Proceedings Graph Drawing, pages pp. 350-358, Rome, Italy.
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 Kratochvíl, Jan, Eds. Proceedings Graph Drawing, pages pp. 8-26, Stirín Castle, Czech Republic.
Chandramouli, M. and Diwan, A. A. (1996) Upward Numbering Testing for Triconnected Graphs. In Brandenburg, Franz J., Eds. Proceedings Graph Drawing, pages pp. 140-151, Passau, Germany.
Di Battista, Giuseppe and Liotta, Giuseppe (1998) Upward Planarity Checking: "Faces Are More than Polygons"
(Extended Abstract). In Whitesides, Sue H., Eds. Proceedings Graph Drawing, pages pp. 72-86, Montréal, Canada.
Kuchem, Ruth and Wagner, Dorothea (1997) Wiring Edge-Disjoint Layouts. In North, Stephen, Eds. Proceedings Graph Drawing, pages pp. 271-285, Berkeley, California, USA.
This list was generated on Fri Jun 27 09:36:49 CEST 2008.
