On Reachable Assignments in Cycles

von Müller, Luis
Veröffentlicht in ADT (7. : 2021 : Toulouse) Algorithmic decision theory (2021)

The Complexity of Gerrymandering over Graphs: Paths and Trees

von Bentert, Matthias
Veröffentlicht in WG (47. : 2021 : Online) Graph-Theoretic Concepts in Computer Science (2021)

Inductive k-independent graphs and c-colorable subgraphs in scheduling : a review

von Bentert, Matthias
Veröffentlicht in Journal of scheduling (2019)

Stable Matching with Multilayer Approval Preferences: Approvals Can Be Harder Than Strict Preferences

von Bentert, Matthias
Veröffentlicht in SAGT (15. : 2022 : Colchester) Algorithmic game theory (2022)

Stable matching with multilayer approval preferences : approvals can be harder than strict preferences

von Bentert, Matthias
Veröffentlicht in Games and economic behavior (2023)

Elements of dynamic and 2-SAT programming : paths, trees, and cuts

von Bentert, Matthias
Veröffentlicht 2021

Efficient Computation of Optimal Temporal Walks Under Waiting-Time Constraints

von Himmel, Anne-Sophie
Veröffentlicht in International Conference on Complex Networks and their Applications (8. : 2019 : Lissabon) Complex networks and their applications VIII ; Volume 2 (2020)