| Maximizing submodular set functions subject to multiple linear constraints A Kulik, H Shachnai, T Tamir Proceedings of the twentieth annual ACM-SIAM symposium on Discrete …, 2009 | 214 | 2009 |
| Approximations for monotone and nonmonotone submodular maximization with knapsack constraints A Kulik, H Shachnai, T Tamir Mathematics of Operations Research 38 (4), 729-739, 2013 | 107 | 2013 |
| There is no EPTAS for two-dimensional knapsack A Kulik, H Shachnai Information Processing Letters 110 (16), 707-710, 2010 | 89 | 2010 |
| Parameterized approximation via fidelity preserving transformations MR Fellows, A Kulik, F Rosamond, H Shachnai Automata, Languages, and Programming: 39th International Colloquium, ICALP …, 2012 | 27 | 2012 |
| Parameterized approximation via fidelity preserving transformations MR Fellows, A Kulik, F Rosamond, H Shachnai Journal of Computer and System Sciences 93, 30-40, 2018 | 25 | 2018 |
| A refined analysis of submodular greedy A Kulik, R Schwartz, H Shachnai Operations Research Letters 49 (4), 507-514, 2021 | 12* | 2021 |
| On Lagrangian relaxation and subset selection problems A Kulik, H Shachnai International Workshop on Approximation and Online Algorithms, 160-173, 2008 | 11 | 2008 |
| Analysis of two-variable recurrence relations with application to parameterized approximations A Kulik, H Shachnai 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS …, 2020 | 10 | 2020 |
| Cooperative rule caching for SDN switches O Rottenstreich, A Kulik, A Joshi, J Rexford, G Rétvári, DS Menasché 2020 IEEE 9th International Conference on Cloud Networking (CloudNet), 1-7, 2020 | 9 | 2020 |
| Modular and submodular optimization with multiple knapsack constraints via fractional grouping Y Fairstein, A Kulik, H Shachnai arXiv preprint arXiv:2007.10470, 2020 | 9 | 2020 |
| A (1-e^{-1}-ε)-Approximation for the Monotone Submodular Multiple Knapsack Problem Y Fairstein, A Kulik, JS Naor, D Raz, H Shachnai 28th Annual European Symposium on Algorithms (ESA 2020), 2020 | 9 | 2020 |
| An EPTAS for budgeted matching and budgeted matroid intersection I Doron-Arad, A Kulik, H Shachnai arXiv preprint arXiv:2302.05681, 2023 | 8 | 2023 |
| An EPTAS for budgeted matroid independent set I Doron-Arad, A Kulik, H Shachnai Symposium on Simplicity in Algorithms (SOSA), 69-83, 2023 | 8 | 2023 |
| An FPTAS for budgeted laminar matroid independent set I Doron-Arad, A Kulik, H Shachnai Operations Research Letters 51 (6), 632-637, 2023 | 6 | 2023 |
| Data plane cooperative caching with dependencies O Rottenstreich, A Kulik, A Joshi, J Rexford, G Rétvári, DS Menasché IEEE Transactions on Network and Service Management 19 (3), 2092-2106, 2021 | 6 | 2021 |
| Improved approximations for vector bin packing via iterative randomized rounding A Kulik, M Mnich, H Shachnai 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS …, 2023 | 5* | 2023 |
| Budgeted matroid maximization: a parameterized viewpoint I Doron-Arad, A Kulik, H Shachnai arXiv preprint arXiv:2307.04173, 2023 | 5 | 2023 |
| On Lagrangian relaxation for constrained maximization and reoptimization problems A Kulik, H Shachnai, G Tamir Discrete Applied Mathematics 296, 164-178, 2021 | 5* | 2021 |
| An APTAS for bin packing with clique-graph conflicts I Doron-Arad, A Kulik, H Shachnai Algorithms and Data Structures: 17th International Symposium, WADS 2021 …, 2021 | 5 | 2021 |
| Lower bounds for matroid optimization problems with a linear constraint I Doron-Arad, A Kulik, H Shachnai 51st International Colloquium on Automata, Languages, and Programming (ICALP …, 2024 | 4* | 2024 |
