A fixed-parameter algorithm for dominance drawings of DAGs
From MaRDI portal
Publication:6634372
DOI10.1016/j.tcs.2024.114819MaRDI QIDQ6634372
Ioannis G. Tollis, Giacomo Ortali
Publication date: 7 November 2024
Published in: Theoretical Computer Science (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Area requirement and symmetry display of planar upward drawings
- The dimension of planar posets
- Modular decomposition and transitive orientation
- Maximal dimensional partially ordered sets. I: Hiraguchi's theorem
- A decomposition theorem for partially ordered sets
- Diametral pairs of linear extensions
- Parameterized Algorithms for Modular-Width
- Inequalities in Dimension Theory for Posets
- Fully Polynomial FPT Algorithms for Some Classes of Bounded Clique-width Graphs
- Efficient and Adaptive Parameterized Algorithms on Modular Decompositions
- Better bounds for poset dimension and boxicity
- Partially ordered sets.
- Dominance drawings for DAGs with bounded modular width
This page was built for publication: A fixed-parameter algorithm for dominance drawings of DAGs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6634372)
