| Publication | Date of Publication | Type |
|---|
| Separable convex mixed-integer optimization: improved algorithms and lower bounds | 2026-05-26 | Paper |
Tight lower bounds for block-structured integer programs
Mathematical Programming. Series A. Series B | 2026-05-08 | Paper |
| Matrices of optimal tree-depth and row-invariant parameterized algorithm for integer programming | 2026-03-18 | Paper |
| (Near)-optimal algorithms for sparse separable convex integer programs | 2025-12-22 | Paper |
Parameterized algorithms for block-structured integer programs with large entries
TheoretiCS | 2025-10-22 | Paper |
Sparse integer programming is fixed-parameter tractable
Mathematics of Operations Research | 2025-09-30 | Paper |
| Scheduling kernels via configuration LP | 2025-06-19 | Paper |
Complexity of scheduling few types of jobs on related and unrelated machines
Journal of Scheduling | 2025-05-12 | Paper |
| Tight lower bounds for block-structured integer programs | 2025-02-07 | Paper |
| 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
Mathematical Programming. Series A. Series B | 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
Operations Research Letters | 2024-06-17 | Paper |
A polyhedral perspective on tropical convolutions
Lecture Notes in Computer Science | 2023-12-22 | Paper |
Complexity of Scheduling Few Types of Jobs on Related and Unrelated Machines
(available as arXiv preprint) | 2023-11-14 | Paper |
Heuristics for opinion diffusion via local elections
Lecture Notes in Computer Science | 2023-08-14 | Paper |
High-multiplicity \(N\)-fold IP via configuration LP
Mathematical Programming. Series A. Series B | 2023-05-25 | Paper |
Correction to: Opinion diffusion and campaigning on society graphs
Journal Of Logic And Computation | 2023-05-16 | Paper |
scientific article; zbMATH DE number 7651172 (Why is no real title available?)
(available as arXiv preprint) | 2023-02-07 | Paper |
Improved analysis of online balanced clustering
(available as arXiv preprint) | 2022-10-19 | Paper |
A note on coloring \((4K_1, C_4, C_6)\)-free graphs with a \(C_7\)
Graphs and Combinatorics | 2022-09-12 | Paper |
Opinion diffusion and campaigning on society graphs
Journal Of Logic And Computation | 2022-09-08 | Paper |
Integer programming in parameterized complexity: five miniatures
Discrete Optimization | 2022-06-09 | Paper |
Approximate separable multichoice optimization over monotone systems
Discrete Optimization | 2022-06-09 | Paper |
Matrices of optimal tree-depth and a row-invariant parameterized algorithm for integer programming
SIAM Journal on Computing | 2022-06-08 | Paper |
| Sparse integer programming is FPT | 2022-04-19 | Paper |
Parameterized complexity of configuration integer programs
Operations Research Letters | 2022-03-11 | Paper |
A note on the approximability of deepest-descent circuit steps
Operations Research Letters | 2021-12-13 | Paper |
Integer programming in parameterized complexity: three miniatures
(available as arXiv preprint) | 2021-08-04 | Paper |
A Parameterized Strongly Polynomial Algorithm for Block Structured Integer Programs
(available as arXiv preprint) | 2021-07-28 | Paper |
Uniform and monotone line sum optimization
Discrete Applied Mathematics | 2021-05-31 | Paper |
| Extension complexity, MSO logic, and treewidth | 2021-01-05 | Paper |
Evaluating and tuning n-fold integer programming
(available as arXiv preprint) | 2020-12-16 | Paper |
A Note on the Approximability of Deepest-Descent Circuit Steps
(available as arXiv preprint) | 2020-10-21 | Paper |
Combinatorial \(n\)-fold integer programming and applications
Mathematical Programming. Series A. Series B | 2020-10-21 | Paper |
| Combinatorial \(n\)-fold integer programming and applications | 2020-05-27 | Paper |
Approximating max-cut under graph-MSO constraints
Operations Research Letters | 2020-02-10 | Paper |
Simplified algorithmic metatheorems beyond MSO: treewidth and neighborhood diversity
Logical Methods in Computer Science | 2020-01-03 | Paper |
Parameterized resiliency problems
Theoretical Computer Science | 2019-10-18 | Paper |
Scheduling meets n-fold integer programming
Journal of Scheduling | 2019-08-08 | Paper |
Parameterized shifted combinatorial optimization
Journal of Computer and System Sciences | 2018-12-10 | Paper |
Parameterized complexity of distance labeling and uniform channel assignment problems
Discrete Applied Mathematics | 2018-09-17 | Paper |
Voting and bribing in single-exponential time
(available as arXiv preprint) | 2018-04-19 | Paper |
Simplified algorithmic metatheorems beyond MSO: treewidth and neighborhood diversity
Lecture Notes in Computer Science | 2018-01-04 | Paper |
Parameterized shifted combinatorial optimization
Lecture Notes in Computer Science | 2017-10-23 | Paper |
Extension complexity, MSO logic, and treewidth
(available as arXiv preprint) | 2017-10-17 | Paper |
Parameterized resiliency problems via integer linear programming
Lecture Notes in Computer Science | 2017-07-21 | Paper |
Fixed Parameter Complexity of Distance Constrained Labeling and Uniform Channel Assignment Problems
Lecture Notes in Computer Science | 2016-09-02 | Paper |
Extended formulation for CSP that is compact for instances of bounded treewidth
The Electronic Journal of Combinatorics | 2016-01-25 | Paper |
Extended formulation for CSP that is compact for instances of bounded treewidth
The Electronic Journal of Combinatorics | 2016-01-25 | Paper |
