| Publication | Date of Publication | Type |
|---|
| Parameterized algorithms for block-structured integer programs with large entries | 2024-11-28 | Paper |
| Characterization of matrices with bounded Graver bases and depth parameters and applications to integer programming | 2024-11-07 | Paper |
| Characterization of matrices with bounded graver bases and depth parameters and applications to integer programming | 2024-06-24 | Paper |
| Reducibility bounds of objective functions over the integers | 2024-06-17 | Paper |
| A polyhedral perspective on tropical convolutions | 2023-12-22 | Paper |
| Complexity of Scheduling Few Types of Jobs on Related and Unrelated Machines | 2023-11-14 | Paper |
| Heuristics for opinion diffusion via local elections | 2023-08-14 | Paper |
| High-multiplicity \(N\)-fold IP via configuration LP | 2023-05-25 | Paper |
| Correction to: Opinion diffusion and campaigning on society graphs | 2023-05-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5874501 | 2023-02-07 | Paper |
| Improved analysis of online balanced clustering | 2022-10-19 | Paper |
| A note on coloring \((4K_1, C_4, C_6)\)-free graphs with a \(C_7\) | 2022-09-12 | Paper |
| Opinion diffusion and campaigning on society graphs | 2022-09-08 | Paper |
| Integer programming in parameterized complexity: five miniatures | 2022-06-09 | Paper |
| Approximate separable multichoice optimization over monotone systems | 2022-06-09 | Paper |
| Matrices of optimal tree-depth and a row-invariant parameterized algorithm for integer programming | 2022-06-08 | Paper |
| Sparse integer programming is FPT | 2022-04-19 | Paper |
| Parameterized complexity of configuration integer programs | 2022-03-11 | Paper |
| A note on the approximability of deepest-descent circuit steps | 2021-12-13 | Paper |
| Integer programming in parameterized complexity: three miniatures | 2021-08-04 | Paper |
| A Parameterized Strongly Polynomial Algorithm for Block Structured Integer Programs | 2021-07-28 | Paper |
| Uniform and monotone line sum optimization | 2021-05-31 | Paper |
| Extension complexity, MSO logic, and treewidth | 2021-01-05 | Paper |
| Evaluating and tuning \(n\)-fold integer programming | 2020-12-16 | Paper |
| Combinatorial \(n\)-fold integer programming and applications | 2020-10-21 | Paper |
| A Note on the Approximability of Deepest-Descent Circuit Steps | 2020-10-21 | Paper |
| Combinatorial \(n\)-fold integer programming and applications | 2020-05-27 | Paper |
| Approximating max-cut under graph-MSO constraints | 2020-02-10 | Paper |
| Simplified algorithmic metatheorems beyond MSO: treewidth and neighborhood diversity | 2020-01-03 | Paper |
| Parameterized resiliency problems | 2019-10-18 | Paper |
| Scheduling meets \(n\)-fold integer programming | 2019-08-08 | Paper |
| Parameterized shifted combinatorial optimization | 2018-12-10 | Paper |
| Parameterized complexity of distance labeling and uniform channel assignment problems | 2018-09-17 | Paper |
| Voting and bribing in single-exponential time | 2018-04-19 | Paper |
| Simplified algorithmic metatheorems beyond MSO: treewidth and neighborhood diversity | 2018-01-04 | Paper |
| Parameterized shifted combinatorial optimization | 2017-10-23 | Paper |
| Extension complexity, MSO logic, and treewidth | 2017-10-17 | Paper |
| Parameterized resiliency problems via integer linear programming | 2017-07-21 | Paper |
| Fixed Parameter Complexity of Distance Constrained Labeling and Uniform Channel Assignment Problems | 2016-09-02 | Paper |
| Extended formulation for CSP that is compact for instances of bounded treewidth | 2016-01-25 | Paper |
