Exact combinatorial algorithms and experiments for finding maximum k-plexes

von Moser, Hannes
Veröffentlicht in Journal of combinatorial optimization (2012)

On (Coalitional) Exchange-Stable Matching

von Chen, Jiehua
Veröffentlicht in SAGT (14. : 2021 : Aarhus) Algorithmic Game Theory (2021)

Be sparse! Be dense! Be robust! : elements of parameterized algorithmics

von Sorge, Manuel
Veröffentlicht 2017

Constant-factor approximations for capacitated arc routing without triangle inequality

Veröffentlicht in Operations research letters (2014)

Optimal Discretization is Fixed-parameter Tractable

von Kratsch, Stefan
Veröffentlicht in ACM-SIAM Symposium on Discrete Algorithms (32. : 2021 : Online) Thirty-second Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2021) ; Volume 3 of 4 (2021)

The Complexity of Cluster Vertex Splitting and Company

von Firbas, Alexander
Veröffentlicht in SOFSEM (49. : 2024 : Cochem) SOFSEM 2024: theory and practice of computer science (2024)

Fixed-Parameter Tractability of Directed Multicut with Three Terminal Pairs Parameterized by the Size of the Cutset: Twin-Width Meets Flow-Augmentation

von Hatzel, Meike
Veröffentlicht in ACM-SIAM Symposium on Discrete Algorithms (34. : 2023 : Florenz; Online) Thirty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2023) ; Volume 5 of 7 (2023)

Efficient Fully Dynamic Elimination Forests with Applications to Detecting Long Paths and Cycles

von Chen, Jiehua
Veröffentlicht in ACM-SIAM Symposium on Discrete Algorithms (32. : 2021 : Online) Thirty-second Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2021) ; Volume 2 of 4 (2021)