Exact and parameterized algorithms for window width minimization in bipartite arrangement

DOI10.1007/978-3-031-92935-9_22MaRDI QIDQ6902096zbMATH OpenFDO

Authors Shashank Chauhan, Tanmay Inamdar, Lawqueen Kanesh, Sanjukta Roy

Publication date 11 November 2025

Full work available at URL https://doi.org/10.1007/978-3-031-92935-9_22

zbMATH Keywords

bandwidthbipartite arrangementgraph drawinglinear arrangementwindow width minimization

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites work

• A fast and simple subexponential fixed parameter algorithm for one-sided crossing minimization
• A faster fixed parameter algorithm for two-layer crossing minimization
• A note on exact algorithms for vertex ordering problems on graphs
• A partial k-arboretum of graphs with bounded treewidth
• Beyond NP-completeness for problems of bounded width: hardness for the W hierarchy (extended abstract)
• Cutwidth I: A linear time fixed parameter algorithm
• Even faster exact bandwidth
• Exact and approximate bandwidth
• Faster Exact Bandwidth
• scientific article; zbMATH DE number 1617243 (Why is no real title available?)
• Kernelization. Theory of parameterized preprocessing
• On the 2-layer window width minimization problem

This page was built for publication: Exact and parameterized algorithms for window width minimization in bipartite arrangement

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