| No. |
Title |
Author |
Year |
| 1 |
A Graph-Theoretic Formulation of Exploratory Blockmodeling |
Bille, Alexander et al. |
2023 |
| 2 |
On the Complexity of Computing Time Series Medians Under the Move-Split-Merge Metric |
Holznigenkemper, Jana et al. |
2023 |
| 3 |
On the Complexity of Parameterized Local Search for the Maximum Parsimony Problem |
Komusiewicz, Christian et al. |
2023 |
| 4 |
Finding 3-Swap-Optimal Independent Sets and Dominating Sets Is Hard |
Komusiewicz, Christian et al. |
2022 |
| 5 |
Parameterized Local Search for Vertex Cover: When Only the Search Radius Is Crucial |
Komusiewicz, Christian et al. |
2022 |
| 6 |
A Timecop’s Chase Around the Table |
Morawietz, Nils et al. |
2021 |
| 7 |
A Timecop’s Work Is Harder Than You Think |
Morawietz, Nils et al. |
2020 |
| 8 |
Colored Cut Games |
Morawietz, Nils et al. |
2020 |
| 9 |
Maximum Edge-Colorable Subgraph and Strong Triadic Closure Parameterized by Distance to Low-Degree Graphs |
Grüttemeier, Niels et al. |
2020 |
| 10 |
String Factorizations Under Various Collision Constraints |
Grüttemeier, Niels et al. |
2020 |
