The PACE 2024 parameterized algorithms and computational experiments challenge: one-sided crossing minimization

DOI10.4230/LIPICS.IPEC.2024.26MaRDI QIDQ7255464zbMATH OpenFDO

Authors Philipp Kindermann, Fabian Klute, Soeren Terziadis

Publication date 29 May 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.IPEC.2024.26

zbMATH Keywords

algorithm engineeringFPTheuristicsone-sided crossing minimization

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Parameterized complexity, tractability and kernelization (68Q27) Algorithms in computer science (68Wxx)

Cites work

• 2-Layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms
• A Cutting Plane Algorithm for the Linear Ordering Problem
• A efficient fixed parameter tractable algorithm for 1-sided crossing minimzation
• A fast and simple subexponential fixed parameter algorithm for one-sided crossing minimization
• An exact method for the minimum feedback arc set problem
• Crossing Numbers and Cutwidths
• Cutwidth: obstructions and algorithmic aspects
• Drawing graphs in two layers
• Edge crossings in drawings of bipartite graphs
• Exact and heuristic methods in combinatorial optimization. A study on the linear ordering and the maximum diversity problem
• Facets of the linear ordering polytope
• Fixed parameter algorithms for one-sided crossing minimization revisited
• scientific article; zbMATH DE number 2084271 (Why is no real title available?)
• New bounds on the barycenter heuristic for bipartite graph drawing.
• PACE solver description: CIMAT_-team
• PACE solver description: CRGone
• PACE solver description: exact solution of the one-sided crossing minimization problem by the MPPEG team
• PACE solver description: lunch -- linear uncrossing heuristics
• PACE solver description: Martin_-J_-Geiger
• PACE solver description: OCMu64, a solver for one-sided crossing minimization
• PACE solver description: the PACE 2023 parameterized algorithms and computational experiments challenge: twinwidth
• PACE solver description: UzL exact solver for one-sided crossing minimization
• The PACE 2017 parameterized algorithms and computational experiments challenge: the second iteration
• The PACE 2018 parameterized algorithms and computational experiments challenge: the third iteration
• The PACE 2019 Parameterized Algorithms and Computational Experiments Challenge: The Fourth Iteration (Invited Paper)
• The PACE 2020 Parameterized Algorithms and Computational Experiments Challenge: Treedepth.
• The PACE 2021 parameterized algorithms and computational experiments challenge: cluster editing
• The PACE 2022 parameterized algorithms and computational experiments challenge: directed feedback vertex set

This page was built for publication: The PACE 2024 parameterized algorithms and computational experiments challenge: one-sided crossing minimization

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