Ariel Kulik

Available identifiers

List of research outcomes

Publication	Date of Publication	Type
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	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	2024-06-17	Paper
An EPTAS for budgeted matroid independent set	2024-05-14	Paper
Computing generalized convolutions faster than brute force	2024-01-09	Paper
General Knapsack Problems in a Dynamic Setting	2023-11-20	Paper
Modular and Submodular Optimization with Multiple Knapsack Constraints via Fractional Grouping	2023-09-20	Paper
A (1-e^{-1}-ε)-Approximation for the Monotone Submodular Multiple Knapsack Problem	2023-02-07	Paper
https://portal.mardi4nfdi.de/entity/Q5075815	2022-05-11	Paper
An APTAS for bin packing with clique-graph conflicts	2022-03-25	Paper
An almost optimal approximation algorithm for monotone submodular multiple knapsack	2022-01-31	Paper
A refined analysis of submodular greedy	2021-12-13	Paper
On Lagrangian relaxation for constrained maximization and reoptimization problems	2021-04-20	Paper
https://portal.mardi4nfdi.de/entity/Q4633865	2019-05-06	Paper
Parameterized approximation via fidelity preserving transformations	2017-12-21	Paper
Approximations for Monotone and Nonmonotone Submodular Maximization with Knapsack Constraints	2014-07-11	Paper
Parameterized Approximation via Fidelity Preserving Transformations	2013-08-12	Paper
There is no EPTAS for two-dimensional knapsack	2012-03-19	Paper
Approximation schemes for deal splitting and covering integer programs with multiplicity constraints	2012-01-04	Paper
On Lagrangian Relaxation and Subset Selection Problems	2009-02-12	Paper

Research outcomes over time

This page was built for person: Ariel Kulik