The importance of being proper

DOI10.1016/j.tcs.2014.12.019zbMath1312.68154OpenAlexW195262813WikidataQ62046558 ScholiaQ62046558MaRDI QIDQ2512653

Patrizio Angelini, Giordano Da Lozzo, Vincenzo Roselli, Fabrizio Frati, Giuseppe Di Battista

Publication date: 30 January 2015

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2014.12.019

zbMATH Keywords

clustered planaritylevel planaritysimultaneous embedding

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (7)

Computing NodeTrix Representations of Clustered Graphs ⋮ Crossing Minimization in Storyline Visualization ⋮ Beyond Level Planarity ⋮ Extending upward planar graph drawings ⋮ Beyond level planarity: cyclic, torus, and simultaneous level planarity ⋮ Computing k-modal embeddings of planar digraphs ⋮ Multilevel Planarity

Cites Work

• Testing the simultaneous embeddability of two graphs whose intersection is a biconnected or a connected graph
• Generalized \(k\)-ary tanglegrams on level graphs: a satisfiability-based approach and its evaluation
• Advancements on SEFE and partitioned book embedding problems
• Straight-line drawing algorithms for hierarchical graphs and clustered graphs
• Toward a Theory of Planarity: Hanani-Tutte and Planarity Variants
• Total Ordering Problem
• Disconnectivity and Relative Positions in Simultaneous Embeddings
• Simultaneous PQ-Ordering with Applications to Constrained Embedding Problems
• SOFSEM 2004: Theory and Practice of Computer Science

This page was built for publication: The importance of being proper