Stefan Kratsch
Humboldt-Universität zu Berlin
H-index: 30
Europe-Germany
Top articles of Stefan Kratsch
Title | Journal | Author(s) | Publication Date |
|---|---|---|---|
Tight Algorithm for Connected Odd Cycle Transversal Parameterized by Clique-width | arXiv preprint arXiv:2402.08046 | Narek Bojikian Stefan Kratsch | 2024/2/12 |
ACM Transactions on | ACM Transactions on | Edith Cohen Susanne Albers Glencora Borradaile Andrei A Bulatov Keren Censor-Hillel | 2023 |
Flow-augmentation II: Undirected graphs | ACM Transactions on Algorithms | Eun Jung Kim Stefan Kratsch Marcin Pilipczuk Magnus Wahlström | 2024/3/13 |
Approximate Turing kernelization and lower bounds for domination problems | arXiv preprint arXiv:2307.02241 | Stefan Kratsch Pascal Kunz | 2023/7/5 |
Tight algorithms for connectivity problems parameterized by modular-treewidth | Falko Hegerfeld Stefan Kratsch | 2023/6/28 | |
Flow-augmentation III: Complexity dichotomy for Boolean CSPs parameterized by the number of unsatisfied constraints | Eun Jung Kim Stefan Kratsch Marcin Pilipczuk Magnus Wahlström | 2023 | |
Efficient parameterized algorithms for computing all-pairs shortest paths | Discrete Applied Mathematics | Stefan Kratsch Florian Nelles | 2023/12/31 |
A tight Monte-Carlo algorithm for Steiner Tree parameterized by clique-width | arXiv preprint arXiv:2307.14264 | Narek Bojikian Stefan Kratsch | 2023/7/26 |
Tight algorithmic applications of clique-width generalizations | arXiv preprint arXiv:2307.04628 | Vera Chekan Stefan Kratsch | 2023/7/10 |
Directed flow-augmentation | Eun Jung Kim Stefan Kratsch Marcin Pilipczuk Magnus Wahlström | 2022/6/9 | |
On triangle counting parameterized by twin-width | arXiv preprint arXiv:2202.06708 | Stefan Kratsch Florian Nelles Alexandre Simon | 2022/2/14 |
Elimination distances, blocking sets, and kernels for vertex cover | SIAM Journal on Discrete Mathematics | Eva-Maria C Hols Stefan Kratsch Astrid Pieterse | 2022 |
Tight bounds for connectivity problems parameterized by cutwidth | arXiv preprint arXiv:2212.12385 | Narek Bojikian Vera Chekan Falko Hegerfeld Stefan Kratsch | 2022/12/23 |
Efficient parameterized algorithms on graphs with heterogeneous structure: Combining tree-depth and modular-width | arXiv preprint arXiv:2209.14429 | Stefan Kratsch Florian Nelles | 2022/9/28 |
Revenue maximization in Stackelberg Pricing Games: Beyond the combinatorial setting | Mathematical Programming | Toni Böhnlein Stefan Kratsch Oliver Schaudt | 2021/5 |
Solving hard cut problems via flow-augmentation | Eun Jung Kim Stefan Kratsch Marcin Pilipczuk Magnus Wahlström | 2021 | |
Optimal discretization is fixed-parameter tractable | Stefan Kratsch Tomáš Masařík Irene Muzi Marcin Pilipczuk Manuel Sorge | 2021 | |
Flow-augmentation I: Directed graphs | arXiv preprint arXiv:2111.03450 | Eun Jung Kim Stefan Kratsch Marcin Pilipczuk Magnus Wahlström | 2021/11/5 |
Towards exact structural thresholds for parameterized complexity | arXiv preprint arXiv:2107.06111 | Falko Hegerfeld Stefan Kratsch | 2021/7/13 |
Bipartite graphs of small readability | Theoretical Computer Science | Rayan Chikhi Vladan Jovičić Stefan Kratsch Paul Medvedev Martin Milanič | 2020/2/2 |
Co-Authors
