Search results for "GD"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
1	Benjamin Albrecht, Philip Effinger, Markus Held, Michael Kaufmann 0001, Stephan Kottler	Visualization of Complex BPEL Models.	GD	2009	DBLP DOI BibTeX RDF
1	Philip Effinger, Gero Decker	Layout Techniques Coupled with Web2.0-Based Business Process Modeling.	GD	2009	DBLP DOI BibTeX RDF
1	Markus Chimani, Carsten Gutwenger, Petra Mutzel, Hoi-Ming Wong	Upward Planarization Layout.	GD	2009	DBLP DOI BibTeX RDF
1	Christian A. Duncan, Michael T. Goodrich, Stephen G. Kobourov	Planar Drawings of Higher-Genus Graphs.	GD	2009	DBLP DOI BibTeX RDF
1	Jerome Joubert, Stephane Lizeray, Romain Raugi, Georg Sander	IBM ILOG Graph Layout for Eclipse.	GD	2009	DBLP DOI BibTeX RDF
1	Stina S. Bridgeman	Using High Dimensions to Compare Drawings of Graphs.	GD	2009	DBLP DOI BibTeX RDF
1	Peter Eades, Seok-Hee Hong 0001, Sheung-Hung Poon	On Rectilinear Drawing of Graphs.	GD	2009	DBLP DOI BibTeX RDF
1	Ioannis G. Tollis, Maurizio Patrignani (eds.)	Graph Drawing, 16th International Symposium, GD 2008, Heraklion, Crete, Greece, September 21-24, 2008. Revised Papers	GD	2009	DBLP DOI BibTeX RDF
1	János Pach	Why Are String Graphs So Beautiful?	GD	2009	DBLP DOI BibTeX RDF
1	Melanie Badent, Michael Baur, Ulrik Brandes, Sabine Cornelsen	Leftist Canonical Ordering.	GD	2009	DBLP DOI BibTeX RDF
1	Tamara Mchedlidze, Antonios Symvonis	On rho-Constrained Upward Topological Book Embeddings.	GD	2009	DBLP DOI BibTeX RDF
1	André Schulz 0001	Drawing 3-Polytopes with Good Vertex Resolution.	GD	2009	DBLP DOI BibTeX RDF
1	Lali Barrière, Clemens Huemer	4-Labelings and Grid Embeddings of Plane Quadrangulations.	GD	2009	DBLP DOI BibTeX RDF
1	Kevin Buchin, Marc J. van Kreveld, Henk Meijer, Bettina Speckmann, Kevin Verbeek	On Planar Supports for Hypergraphs.	GD	2009	DBLP DOI BibTeX RDF
1	Tim Dwyer, George G. Robertson	Layout with Circular and Other Non-linear Constraints Using Procrustes Projection.	GD	2009	DBLP DOI BibTeX RDF
1	Markus Rohrschneider, Christian Heine 0002, André Reichenbach, Andreas Kerren, Gerik Scheuermann	A Novel Grid-Based Visualization Approach for Metabolic Networks with Advanced Focus&Context View.	GD	2009	DBLP DOI BibTeX RDF
1	Bastian Katz, Marcus Krug, Ignaz Rutter, Alexander Wolff 0001	Manhattan-Geodesic Embedding of Planar Graphs.	GD	2009	DBLP DOI BibTeX RDF
1	Christian Pich 0001	Drawing Directed Graphs Clockwise.	GD	2009	DBLP DOI BibTeX RDF
1	Ioannis Z. Emiris, Elias P. Tsigaridas, Antonios Varvitsiotis	Algebraic Methods for Counting Euclidean Embeddings of Rigid Graphs.	GD	2009	DBLP DOI BibTeX RDF
1	Martin Nöllenburg	An Improved Algorithm for the Metro-line Crossing Minimization Problem.	GD	2009	DBLP DOI BibTeX RDF
1	Vassilis Tsiaras, Ioannis G. Tollis	DAGmaps and epsilon-Visibility Representations of DAGs.	GD	2009	DBLP DOI BibTeX RDF
1	Patrizio Angelini, Fabrizio Frati, Maurizio Patrignani	Splitting Clusters to Get C-Planarity.	GD	2009	DBLP DOI BibTeX RDF
1	Carla Binucci, Ulrik Brandes, Giuseppe Di Battista, Walter Didimo, Marco Gaertler, Pietro Palladino, Maurizio Patrignani, Antonios Symvonis, Katharina Anna Zweig	Drawing Trees in a Streaming Model.	GD	2009	DBLP DOI BibTeX RDF
1	Christian A. Duncan, Carsten Gutwenger, Lev Nachmanson, Georg Sander	Graph Drawing Contest Report.	GD	2009	DBLP DOI BibTeX RDF
1	Patrizio Angelini, Giuseppe Di Battista, Fabrizio Frati	Succinct Greedy Drawings Do Not Always Exist.	GD	2009	DBLP DOI BibTeX RDF
1	Alejandro Estrella-Balderrama, J. Joseph Fowler, Stephen G. Kobourov	On the Characterization of Level Planar Trees by Minimal Patterns.	GD	2009	DBLP DOI BibTeX RDF
1	David Eppstein	The Topology of Bendless Three-Dimensional Orthogonal Graph Drawing.	GD	2008	DBLP DOI BibTeX RDF
1	Maarten Löffler, Elena Mumford	Connected Rectilinear Graphs on Point Sets.	GD	2008	DBLP DOI BibTeX RDF
1	Balázs Keszegh, János Pach, Dömötör Pálvölgyi, Géza Tóth 0001	Cubic Graphs Have Bounded Slope Parameter.	GD	2008	DBLP DOI BibTeX RDF
1	Md. Abul Hassan Samee, Md. Jawaherul Alam, Muhammad Abdullah Adnan, Md. Saidur Rahman 0001	Minimum Segment Drawings of Series-Parallel Graphs with the Maximum Degree Three.	GD	2008	DBLP DOI BibTeX RDF
1	Luca Cittadini, Tiziana Refice, Alessio Campisano, Giuseppe Di Battista, Claudio Sasso	Policy-Aware Visualization of Internet Dynamics.	GD	2008	DBLP DOI BibTeX RDF
1	Josef Cibulka, Jan Kyncl, Viola Mészáros, Rudolf Stolar, Pavel Valtr 0001	Hamiltonian Alternating Paths on Bicolored Double-Chains.	GD	2008	DBLP DOI BibTeX RDF
1	Vladimir P. Korzhik, Bojan Mohar	Minimal Obstructions for 1-Immersions and Hardness of 1-Planarity Testing.	GD	2008	DBLP DOI BibTeX RDF
1	Emden R. Gansner, Yifan Hu 0001	Efficient Node Overlap Removal Using a Proximity Stress Model.	GD	2008	DBLP DOI BibTeX RDF
1	Patrizio Angelini, Fabrizio Frati, Luca Grilli 0001	An Algorithm to Construct Greedy Drawings of Triangulations.	GD	2008	DBLP DOI BibTeX RDF
1	Vassilis Tsiaras, Ioannis G. Tollis	DAGmap View.	GD	2008	DBLP DOI BibTeX RDF
1	Ugur Dogrusöz, Christian A. Duncan, Carsten Gutwenger, Georg Sander	Graph Drawing Contest Report.	GD	2008	DBLP DOI BibTeX RDF
1	Jesper Tegnér	Networks in Biology - From Identification, Analysis to Interpretation.	GD	2008	DBLP DOI BibTeX RDF
1	Yehuda Koren, Ali Civril	The Binary Stress Model for Graph Drawing.	GD	2008	DBLP DOI BibTeX RDF
1	Allison P. Heath, George N. Bennett, Lydia E. Kavraki	Visualizing the Results of Metabolic Pathway Queries.	GD	2008	DBLP DOI BibTeX RDF
1	Seok-Hee Hong 0001, Takao Nishizeki, Wu Quan (eds.)	Graph Drawing, 15th International Symposium, GD 2007, Sydney, Australia, September 24-26, 2007. Revised Papers	GD	2008	DBLP DOI BibTeX RDF
1	Alejandro Estrella-Balderrama, J. Joseph Fowler, Stephen G. Kobourov	Graph Simultaneous Embedding Tool, GraphSET.	GD	2008	DBLP DOI BibTeX RDF
1	Michael Kaufmann 0001, Marc J. van Kreveld, Bettina Speckmann	Subdivision Drawings of Hypergraphs.	GD	2008	DBLP DOI BibTeX RDF
1	Sonja Maier, Steffen Mazanek, Mark Minas	Visual Specification of Layout.	GD	2008	DBLP DOI BibTeX RDF
1	Patrizio Angelini, Pier Francesco Cortese, Giuseppe Di Battista, Maurizio Patrignani	Topological Morphing of Planar Graphs.	GD	2008	DBLP DOI BibTeX RDF
1	Vassilis Tsiaras, Ioannis G. Tollis, Vangelis Sakkalis	Brain Network Analyzer.	GD	2008	DBLP DOI BibTeX RDF
1	Jan Stola	Unimaximal Sequences of Pairs in Rectangle Visibility Drawing.	GD	2008	DBLP DOI BibTeX RDF
1	Markus Chimani, Carsten Gutwenger, Mathias Jansen, Karsten Klein 0001, Petra Mutzel	Computing Maximum C-Planar Subgraphs.	GD	2008	DBLP DOI BibTeX RDF
1	Philip Effinger, Michael Kaufmann 0001, Martin Siebenhaller	Enhancing Visualizations of Business Processes.	GD	2008	DBLP DOI BibTeX RDF
1	J. Joseph Fowler, Carsten Gutwenger, Michael Jünger, Petra Mutzel, Michael Schulz 0001	An SPQR-Tree Approach to Decide Special Cases of Simultaneous Embedding with Fixed Edges.	GD	2008	DBLP DOI BibTeX RDF
1	David Eppstein, Michael T. Goodrich	Succinct Greedy Graph Drawing in the Hyperbolic Plane.	GD	2008	DBLP DOI BibTeX RDF
1	Sjoerd van Hagen, Marc J. van Kreveld	Placing Text Boxes on Graphs.	GD	2008	DBLP DOI BibTeX RDF
1	Apeksha Godiyal, Jared Hoberock, Michael Garland, John C. Hart	Rapid Multipole Graph Drawing on the GPU.	GD	2008	DBLP DOI BibTeX RDF
1	David Eppstein	Isometric Diamond Subgraphs.	GD	2008	DBLP DOI BibTeX RDF
1	Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer, Stephen K. Wismath	Constrained Point-Set Embeddability of Planar Graphs.	GD	2008	DBLP DOI BibTeX RDF
1	Cesim Erten, Melih Sözdinler	A Robust Biclustering Method Based on Crossing Minimization in Bipartite Graphs.	GD	2008	DBLP DOI BibTeX RDF
1	Chieh-Yu Chen, Ya-Fei Hung, Hsueh-I Lu	Visibility Representations of Four-Connected Plane Graphs with Near Optimal Heights.	GD	2008	DBLP DOI BibTeX RDF
1	Vít Jelínek, Eva Jelínková, Jan Kratochvíl, Bernard Lidický	Clustered Planarity: Embedded Clustered Graphs with Two-Component Clusters.	GD	2008	DBLP DOI BibTeX RDF
1	Vít Jelínek, Ondrej Suchý, Marek Tesar 0001, Tomás Vyskocil	Clustered Planarity: Clusters with Few Outgoing Edges.	GD	2008	DBLP DOI BibTeX RDF
1	Tim Dwyer, Kim Marriott, Michael Wybrow	Topology Preserving Constrained Graph Layout.	GD	2008	DBLP DOI BibTeX RDF
1	Ulrik Brandes, Christian Pich 0001	An Experimental Study on Distance-Based Graph Drawing.	GD	2008	DBLP DOI BibTeX RDF
1	Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Pietro Palladino	Visual Analysis of One-to-Many Matched Graphs.	GD	2008	DBLP DOI BibTeX RDF
1	Christian Bachmaier, Franz-Josef Brandenburg, Wolfgang Brunner, Gergö Lovász	Cyclic Leveling of Directed Graphs.	GD	2008	DBLP DOI BibTeX RDF
1	Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani	Non-convex Representations of Graphs.	GD	2008	DBLP DOI BibTeX RDF
1	Kevin Buchin, Maike Buchin, Jaroslaw Byrka, Martin Nöllenburg, Yoshio Okamoto, Rodrigo I. Silveira, Alexander Wolff 0001	Drawing (Complete) Binary Tanglegrams.	GD	2008	DBLP DOI BibTeX RDF
1	Takashi Imamichi, Yohei Arahori, Jaeseong Gim, Seok-Hee Hong 0001, Hiroshi Nagamochi	Removing Node Overlaps Using Multi-sphere Scheme.	GD	2008	DBLP DOI BibTeX RDF
1	Francesco Giordano, Giuseppe Liotta, Sue Whitesides	Embeddability Problems for Upward Planar Digraphs.	GD	2008	DBLP DOI BibTeX RDF
1	Tim Dwyer, Kim Marriott, Michael Wybrow	Dunnart: A Constraint-Based Network Diagram Authoring Tool.	GD	2008	DBLP DOI BibTeX RDF
1	Sergio Cabello, Bojan Mohar	Crossing and Weighted Crossing Number of Near-Planar Graphs.	GD	2008	DBLP DOI BibTeX RDF
1	Seok-Hee Hong 0001, Martin Mader	Generalizing the Shift Method for Rectangular Shaped Vertices with Visibility Constraints.	GD	2008	DBLP DOI BibTeX RDF
1	Tamara Mchedlidze, Antonios Symvonis	Spine Crossing Minimization in Upward Topological Book Embeddings.	GD	2008	DBLP DOI BibTeX RDF
1	Evmorfia N. Argyriou, Michael A. Bekos, Michael Kaufmann 0001, Antonios Symvonis	Two Polynomial Time Algorithms for the Metro-line Crossing Minimization Problem.	GD	2008	DBLP DOI BibTeX RDF
1	Martin Kochol	3-Regular Non 3-Edge-Colorable Graphs with Polyhedral Embeddings in Orientable Surfaces.	GD	2008	DBLP DOI BibTeX RDF
1	Roberto Tamassia, Bernardo Palazzi, Charalampos Papamanthou	Graph Drawing for Security Visualization.	GD	2008	DBLP DOI BibTeX RDF
1	Aimal Rextin, Patrick Healy	A Fully Dynamic Algorithm to Test the Upward Planarity of Single-Source Embedded Digraphs.	GD	2008	DBLP DOI BibTeX RDF
1	Ulrik Brandes, Barbara Pampel	On the Hardness of Orthogonal-Order Preserving Graph Drawing.	GD	2008	DBLP DOI BibTeX RDF
1	Markus Chimani, Petr Hlinený, Petra Mutzel	Approximating the Crossing Number of Apex Graphs.	GD	2008	DBLP DOI BibTeX RDF	apex graph, vertex insertion, Crossing number
1	Christian Bachmaier, Franz-Josef Brandenburg, Wolfgang Brunner, Andreas Hofmeier, Marco Matzeder, Thomas Unfried	Tree Drawings on the Hexagonal Grid.	GD	2008	DBLP DOI BibTeX RDF
1	Georg Sander	ILOG Elixir.	GD	2008	DBLP DOI BibTeX RDF
1	Michael A. Bekos, Michael Kaufmann 0001, Katerina Potika, Antonios Symvonis	Line Crossing Minimization on Metro Maps.	GD	2007	DBLP DOI BibTeX RDF	Metro Maps, Trees, Lines, Paths, Crossing Minimization
1	Hubert de Fraysseix, Patrice Ossona de Mendez, Pierre Rosenstiehl	Representation of Planar Hypergraphs by Contacts of Triangles.	GD	2007	DBLP DOI BibTeX RDF
1	Lev Nachmanson, George G. Robertson, Bongshin Lee	Drawing Graphs with GLEE.	GD	2007	DBLP DOI BibTeX RDF
1	Michael Baur, Ulrik Brandes	Multi-circular Layout of Micro/Macro Graphs.	GD	2007	DBLP DOI BibTeX RDF
1	Giuseppe Di Battista, Fabrizio Frati	Efficient C-Planarity Testing for Embedded Flat Clustered Graphs with Small Faces.	GD	2007	DBLP DOI BibTeX RDF
1	Fabrizio Frati	Straight-Line Orthogonal Drawings of Binary and Ternary Trees.	GD	2007	DBLP DOI BibTeX RDF
1	Michael Kaufmann 0001	Polynomial Area Bounds for MST Embeddings of Trees.	GD	2007	DBLP DOI BibTeX RDF
1	J. Joseph Fowler, Stephen G. Kobourov	Minimum Level Nonplanar Patterns for Trees.	GD	2007	DBLP DOI BibTeX RDF
1	Krists Boitmanis, Ulrik Brandes, Christian Pich 0001	Visualizing Internet Evolution on the Autonomous Systems Level.	GD	2007	DBLP DOI BibTeX RDF
1	Carla Binucci, Walter Didimo, Francesco Giordano	Maximum Upward Planar Subgraphs of Embedded Planar Digraphs.	GD	2007	DBLP DOI BibTeX RDF
1	Fabrizio Frati, Michael Kaufmann 0001, Stephen G. Kobourov	Constrained Simultaneous and Near-Simultaneous Embeddings.	GD	2007	DBLP DOI BibTeX RDF
1	Marcus Krug, Dorothea Wagner	Minimizing the Area for Planar Straight-Line Grid Drawings.	GD	2007	DBLP DOI BibTeX RDF
1	Jan Kyncl	The Complexity of Several Realizability Problems for Abstract Topological Graphs.	GD	2007	DBLP DOI BibTeX RDF
1	Martin Harrigan, Patrick Healy	Practical Level Planarity Testing and Layout with Embedding Constraints.	GD	2007	DBLP DOI BibTeX RDF
1	Michael J. Pelsmajer, Marcus Schaefer 0001, Daniel Stefankovic	Crossing Number of Graphs with Rotation Systems.	GD	2007	DBLP DOI BibTeX RDF	computational complexity, computational geometry, crossing number
1	Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer, Stephen K. Wismath	Point-Set Embedding of Trees with Edge Constraints.	GD	2007	DBLP DOI BibTeX RDF
1	Jakub Cerný, Jan Kyncl, Géza Tóth 0001	Improvement on the Decay of Crossing Numbers.	GD	2007	DBLP DOI BibTeX RDF
1	Michael J. Pelsmajer, Marcus Schaefer 0001, Daniel Stefankovic	Crossing Numbers and Parameterized Complexity.	GD	2007	DBLP DOI BibTeX RDF
1	Marc Benkert, Herman J. Haverkort, Moritz Kroll, Martin Nöllenburg	Algorithms for Multi-criteria One-Sided Boundary Labeling.	GD	2007	DBLP DOI BibTeX RDF
1	Huaming Zhang, Sadish Sadasivam	On Planar Polyline Drawings.	GD	2007	DBLP DOI BibTeX RDF
1	Xavier Goaoc, Jan Kratochvíl, Yoshio Okamoto, Chan-Su Shin, Alexander Wolff 0001	Moving Vertices to Make Drawings Plane.	GD	2007	DBLP DOI BibTeX RDF

Publications at "GD"( http://dblp.L3S.de/Venues/GD )