| Publication | Date of Publication | Type |
|---|
| Sampling with a black box: faster parameterized approximation algorithms for vertex deletion problems | 2026-09-10 | Paper |
| Unsplittable flow on a short path | 2026-05-29 | Paper |
| Lower bounds for matroid optimization problems with a linear constraint | 2026-01-14 | Paper |
| An EPTAS for cardinality constrained multiple knapsack via iterative randomized rounding | 2025-10-06 | Paper |
| Approximate monotone local search for weighted problems | 2025-09-24 | Paper |
| Budgeted matroid maximization: a parameterized viewpoint | 2025-09-24 | Paper |
| Improved approximations for vector bin packing via iterative randomized rounding | 2025-08-15 | Paper |
| Analysis of two-variable recurrence relations with application to parameterized approximations | 2025-08-12 | Paper |
| Improved approximation for two-dimensional vector multiple knapsack | 2025-07-24 | Paper |
| Computing generalized convolutions faster than brute force | 2025-06-23 | Paper |
| Faster exponential-time approximation algorithms using approximate monotone local search | 2025-06-19 | Paper |
| An AFPTAS for bin packing with partition matroid via a new method for LP rounding | 2025-01-14 | Paper |
| Optimally repurposing existing algorithms to obtain exponential-time approximations | 2024-11-28 | Paper |
Improved approximation for two-dimensional vector multiple knapsack
Computational Geometry | 2024-11-15 | Paper |
| An EPTAS for budgeted matching and budgeted matroid intersection via representative sets | 2024-11-14 | Paper |
An FPTAS for budgeted laminar matroid independent set
Operations Research Letters | 2024-06-17 | Paper |
| An EPTAS for budgeted matroid independent set | 2024-05-14 | Paper |
Computing generalized convolutions faster than brute force
Algorithmica | 2024-01-09 | Paper |
General Knapsack Problems in a Dynamic Setting
(available as arXiv preprint) | 2023-11-20 | Paper |
Modular and Submodular Optimization with Multiple Knapsack Constraints via Fractional Grouping
(available as arXiv preprint) | 2023-09-20 | Paper |
| A (1-e^{-1}-ε)-Approximation for the Monotone Submodular Multiple Knapsack Problem | 2023-02-07 | Paper |
Generalized assignment via submodular optimization with reserved capacity
(available as arXiv preprint) | 2022-05-11 | Paper |
An APTAS for bin packing with clique-graph conflicts
(available as arXiv preprint) | 2022-03-25 | Paper |
An almost optimal approximation algorithm for monotone submodular multiple knapsack
Journal of Computer and System Sciences | 2022-01-31 | Paper |
A refined analysis of submodular greedy
Operations Research Letters | 2021-12-13 | Paper |
On Lagrangian relaxation for constrained maximization and reoptimization problems
Discrete Applied Mathematics | 2021-04-20 | Paper |
| Maximizing submodular set functions subject to multiple linear constraints | 2019-05-06 | Paper |
Parameterized approximation via fidelity preserving transformations
Journal of Computer and System Sciences | 2017-12-21 | Paper |
Approximations for Monotone and Nonmonotone Submodular Maximization with Knapsack Constraints
Mathematics of Operations Research | 2014-07-11 | Paper |
Parameterized approximation via fidelity preserving transformations
Automata, Languages, and Programming | 2013-08-12 | Paper |
There is no EPTAS for two-dimensional knapsack
Information Processing Letters | 2012-03-19 | Paper |
Approximation schemes for deal splitting and covering integer programs with multiplicity constraints
Theoretical Computer Science | 2012-01-04 | Paper |
On Lagrangian Relaxation and Subset Selection Problems
Approximation and Online Algorithms | 2009-02-12 | Paper |
