Segment intersection representations, level planarity and constrained ordering problems

DOI10.1007/978-3-032-11835-6_15MaRDI QIDQ7294431zbMATH OpenFDO

Authors Simon D. Fink, Peter Stumpf

Publication date 10 July 2026

Full work available at URL https://doi.org/10.1007/978-3-032-11835-6_15

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Cites work

• A special planar satisfiability problem and a consequence of its NP- completeness
• Beyond level planarity: cyclic, torus, and simultaneous level planarity
• Complexity of some geometric and topological problems
• Generalized \(k\)-ary tanglegrams on level graphs: a satisfiability-based approach and its evaluation
• Grid intersection graphs and boxicity
• Hanani-Tutte, monotone drawings, and level-planarity
• scientific article; zbMATH DE number 4142090 (Why is no real title available?)
• scientific article; zbMATH DE number 125506 (Why is no real title available?)
• scientific article; zbMATH DE number 1377359 (Why is no real title available?)
• Intersection graphs of segments
• Level Planar Embedding in Linear Time
• Level planarity: transitivity vs. even crossings
• Level-planarity: transitivity vs. even crossings
• On grid intersection graphs
• Simultaneous PQ-ordering with applications to constrained embedding problems
• String graphs. II: Recognizing string graphs is NP-hard
• Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
• The importance of being proper
• The importance of being proper (in clustered-level planarity and T-level planarity)
• Total Ordering Problem
• Toward a theory of planarity: Hanani-Tutte and planarity variants

This page was built for publication: Segment intersection representations, level planarity and constrained ordering problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7294431)