SOFSEM 2004: Theory and Practice of Computer Science
From MaRDI portal
Publication:5902004
DOI10.1007/b95046zbMath1202.05093OpenAlexW2916538296MaRDI QIDQ5902004
Christian Bachmaier, Michael Forster
Publication date: 4 June 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b95046
Analysis of algorithms and problem complexity (68Q25) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items (7)
Beyond Level Planarity ⋮ Ordered Level Planarity, Geodesic Planarity and Bi-Monotonicity ⋮ Strip planarity testing for embedded planar graphs ⋮ Beyond level planarity: cyclic, torus, and simultaneous level planarity ⋮ The importance of being proper ⋮ C-planarity testing of embedded clustered graphs with bounded dual carving-width ⋮ Multilevel Planarity
This page was built for publication: SOFSEM 2004: Theory and Practice of Computer Science
