ENGINEERING DATA REDUCTION FOR NESTED DISSECTION

von Ost, Wolfgang
Veröffentlicht in SIAM Symposium on Algorithm Engineering and Experiments (2021 : Online) Symposium on Algorithm Engineering and Experiments (ALENEX21) (2021)

Efficiently enumerating all maximal cliques with bit-parallelism

von San Segundo, Pablo
Veröffentlicht in Computers & operations research (2018)

WEGOTYOUCOVERED: THE WINNING SOLVER FROM THE PACE 2019 CHALLENGE, VERTEX COVER TRACK

von Hespe, Demian
Veröffentlicht in SIAM Workshop on Combinatorial Scientific Computing (2020 : Seattle, Wash.) SIAM Workshop on Combinatorial Scientific Computing (CSC20) (2021)

BOOSTING DATA REDUCTION FOR THE MAXIMUM WEIGHT INDEPENDENT SET PROBLEM USING INCREASING TRANSFORMATIONS

von Gellner, Alexander
Veröffentlicht in SIAM Symposium on Algorithm Engineering and Experiments (2021 : Online) Symposium on Algorithm Engineering and Experiments (ALENEX21) (2021)

Engineering Kernelization for Maximum Cut

von Ferizovic, Damir
Veröffentlicht in ALENEX (2020 : Salt Lake City, Utah) Symposium on Algorithm Engineering and Experiments (ALENEX20) (2020)