On simultaneous planar graph embeddings

From MaRDI portal
Publication:857060

DOI10.1016/j.comgeo.2006.05.006zbMath1105.05015OpenAlexW1999600491WikidataQ56689314 ScholiaQ56689314MaRDI QIDQ857060

Cesim Erten, Stephen G. Kobourov, Joseph S. B. Mitchell, Alon Efrat, Dan P. Ismailescu, Anna Lubiw, Peter Brass, Eowyn Cenek, Christian A. Duncan

Publication date: 14 December 2006

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comgeo.2006.05.006




Related Items

Simultaneous visibility representations of plane \(st\)-graphs using L-shapesCharacterizing Simultaneous Embedding with Fixed EdgesUniversal sets of \(n\) points for one-bend drawings of planar graphs with \(n\) verticesUpward Straight-Line Embeddings of Directed Graphs into Point SetsCharacterizations of Restricted Pairs of Planar Graphs Allowing Simultaneous Embedding with Fixed EdgesSIMULTANEOUS EMBEDDING OF EMBEDDED PLANAR GRAPHSAtomic Embeddability, Clustered Planarity, and ThickenabilityRelating Graph Thickness to Planar Layers and Bend ComplexityOrthogeodesic Point-Set Embedding of TreesOn Point-Sets That Support Planar GraphsCombining Problems on RAC Drawings and Simultaneous Graph DrawingsAn exponential bound for simultaneous embeddings of planar graphsSynchronized Planarity with Applications to Constrained Planarity ProblemsOn graph thickness, geometric thickness, and separator theoremsPartial and simultaneous transitive orientations via modular decompositionsSmall Point-Sets Supporting Graph StoriesBeyond Level PlanarityMonotone Simultaneous Embeddings of Paths in d DimensionsSmall point-sets supporting graph storiesCharacterizations of restricted pairs of planar graphs allowing simultaneous embedding with fixed edgesA Note on Universal Point Sets for Planar GraphsGraph Stories in Small AreaThe QuaSEFE problemA note on universal point sets for planar graphsGraph stories in small areaOn the curve complexity of 3-colored point-set embeddingsTesting the simultaneous embeddability of two graphs whose intersection is a biconnected or a connected graphCompatible spanning treesCharacterization of unlabeled level planar treesComputing Upward Topological Book Embeddings of Upward Planar DigraphsConstrained Simultaneous and Near-Simultaneous EmbeddingsSimultaneous visibility representations of undirected pairs of graphsTesting the Simultaneous Embeddability of Two Graphs Whose Intersection Is a Biconnected Graph or a TreeComputing upward topological book embeddings of upward planar digraphsSimultaneous Embeddings with Few Bends and CrossingsRelaxing the constraints of clustered planarityColored simultaneous geometric embeddings and universal pointsetsUnnamed ItemMatched drawability of graph pairs and of graph triplesHierarchical partial planarityMatched Drawability of Graph Pairs and of Graph TriplesBeyond level planarity: cyclic, torus, and simultaneous level planarityVisual Analysis of One-to-Many Matched GraphsSimultaneous embedding of colored graphsSEFE without Mapping via Large Induced Outerplane Graphs in Plane GraphsThe Simultaneous Representation Problem for Chordal, Comparability and Permutation GraphsBounded Embeddings of Graphs in the PlaneSimultaneous Visibility Representations of Plane st-graphs Using L-shapesRight Angle Crossing Drawings of GraphsBeyond Clustered Planar GraphsPlane 3-Trees: Embeddability and ApproximationOn the Complexity of Some Geometric Problems With Fixed Parameters



Cites Work