I agree that this site is using cookies. You can find further informations here.
X
Kratsch, Stefan
220  results:
Search for persons X
?
1

Flow-augmentation II: Undirected Graphs:

Kim, Eun Jung ; Kratsch, Stefan ; Pilipczuk, Marcin.
ACM Transactions on Algorithms.  20 (2024)  2 - p. 1-26 , 2024
Link: https://doi.org/10.1145/..
 
?
2

Fine-Grained Parameterized Algorithms on Width Parameters a..:

Hegerfeld, Falko , 2023
Link: https://nbn-resolving.de..
 
?
3

Efficient parameterized algorithms on structured graphs:

Nelles, Florian , 2023
Link: https://nbn-resolving.de..
 
?
4

Efficient parameterized algorithms for computing all-pairs ..:

Kratsch, Stefan ; Nelles, Florian
Discrete Applied Mathematics.  341 (2023)  - p. 102-119 , 2023
Link: https://doi.org/10.1016/..
 
?
5

Tight Algorithms for Connectivity Problems Parameterized by..:

, In: Graph-Theoretic Concepts in Computer Science; Lecture Notes in Computer Science,
Hegerfeld, Falko ; Kratsch, Stefan - p. 388-402 , 2023
Link: https://doi.org/10.1007/..
 
?
6

Directed flow-augmentation:

, In: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing,
Kim, Eun Jung ; Kratsch, Stefan ; Pilipczuk, Marcin. - p. 938-947 , 2022
Link: https://dl.acm.org/doi/1..
 
?
7

Elimination Distances, Blocking Sets, and Kernels for Verte..:

Hols, Eva-Maria C. ; Kratsch, Stefan ; Pieterse, Astrid
SIAM Journal on Discrete Mathematics.  36 (2022)  3 - p. 1955-1990 , 2022
Link: https://doi.org/10.1137/..
 
?
8

Solving hard cut problems via flow-augmentation:

, In: Proceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms,
Kim, Eun Jung ; Kratsch, Stefan ; Pilipczuk, Marcin. - p. 149-168 , 2021
Link: https://dl.acm.org/doi/1..
 
?
9

Solving hard cut problems via flow-augmentation:

, In: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA),
Kim, Eun Jung ; Kratsch, Stefan ; Pilipczuk, Marcin. - p. 149-168 , 2021
Link: https://doi.org/10.1137/..
 
?
10

Optimal Discretization is Fixed-parameter Tractable:

, In: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA),
Kratsch, Stefan ; Masařík, Tomáš ; Muzi, Irene.. - p. 1702-1719 , 2021
Link: https://doi.org/10.1137/..
 
?
11

Optimal discretization is fixed-parameter tractable:

, In: Proceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms,
Kratsch, Stefan ; Masařík, Tomáš ; Muzi, Irene.. - p. 1702-1719 , 2021
Link: https://dl.acm.org/doi/1..
 
?
12

Answering Conjunctive Queries and FO+MOD Queries under Upda..:

Keppeler, Jens , 2020
Link: https://nbn-resolving.de..
 
?
13

Preprocessing to Deal with Hard Problems:

Hols, Eva-Maria Christiana , 2020
Link: https://nbn-resolving.de..
 
?
14

Revenue maximization in Stackelberg Pricing Games: beyond t..:

Böhnlein, Toni ; Kratsch, Stefan ; Schaudt, Oliver
Mathematical Programming.  187 (2020)  1-2 - p. 653-695 , 2020
Link: https://doi.org/10.1007/..
 
?
15

Representative Sets and Irrelevant Vertices: New Tools for ..:

Kratsch, Stefan ; WahlströM, Magnus
Journal of the ACM.  67 (2020)  3 - p. 1-50 , 2020
Link: https://doi.org/10.1145/..
 
1-15