Ariel Kulik

About Ariel Kulik

Ariel Kulik, With an exceptional h-index of 9 and a recent h-index of 8 (since 2020), a distinguished researcher at Technion - Israel Institute of Technology, specializes in the field of Algorithms.

His recent articles reflect a diverse array of research interests and contributions to the field:

Optimally Repurposing Existing Algorithms to Obtain Exponential-Time Approximations

Computing Generalized Convolutions Faster Than Brute Force

Improved approximations for vector bin packing via iterative randomized rounding

An FPTAS for budgeted laminar matroid independent set

Approximate Monotone Local Search for Weighted Problems

An EPTAS for Cardinality Constrained Multiple Knapsack via Iterative Randomized Rounding

Tight lower bounds for weighted matroid problems

Budgeted matroid maximization: a parameterized viewpoint

Ariel Kulik Information

University

Position

___

Citations(all)

564

Citations(since 2020)

280

Cited By

716

hIndex(all)

9

hIndex(since 2020)

8

i10Index(all)

9

i10Index(since 2020)

7

Email

University Profile Page

Google Scholar

Ariel Kulik Skills & Research Interests

Algorithms

Top articles of Ariel Kulik

Optimally Repurposing Existing Algorithms to Obtain Exponential-Time Approximations

2024

Ariel Kulik
Ariel Kulik

H-Index: 9

Computing Generalized Convolutions Faster Than Brute Force

Algorithmica

2024/1

Ariel Kulik
Ariel Kulik

H-Index: 9

Karol Węgrzycki
Karol Węgrzycki

H-Index: 6

Improved approximations for vector bin packing via iterative randomized rounding

2023/11/6

Ariel Kulik
Ariel Kulik

H-Index: 9

An FPTAS for budgeted laminar matroid independent set

Operations Research Letters

2023/11/1

Ilan Doron-Arad
Ilan Doron-Arad

H-Index: 0

Ariel Kulik
Ariel Kulik

H-Index: 9

Approximate Monotone Local Search for Weighted Problems

arXiv preprint arXiv:2308.15306

2023/8/29

Ariel Kulik
Ariel Kulik

H-Index: 9

An EPTAS for Cardinality Constrained Multiple Knapsack via Iterative Randomized Rounding

arXiv preprint arXiv:2308.12622

2023/8/24

Ilan Doron-Arad
Ilan Doron-Arad

H-Index: 0

Ariel Kulik
Ariel Kulik

H-Index: 9

Tight lower bounds for weighted matroid problems

arXiv preprint arXiv:2307.07773

2023/7/15

Ilan Doron-Arad
Ilan Doron-Arad

H-Index: 0

Ariel Kulik
Ariel Kulik

H-Index: 9

Budgeted matroid maximization: a parameterized viewpoint

arXiv preprint arXiv:2307.04173

2023/7/9

Ilan Doron-Arad
Ilan Doron-Arad

H-Index: 0

Ariel Kulik
Ariel Kulik

H-Index: 9

Improved approximation for two-dimensional vector multiple knapsack

arXiv preprint arXiv:2307.02137

2023/7/5

Ariel Kulik
Ariel Kulik

H-Index: 9

An AFPTAS for bin packing with partition matroid via a new method for LP rounding

2023

Ilan Doron-Arad
Ilan Doron-Arad

H-Index: 0

Ariel Kulik
Ariel Kulik

H-Index: 9

An EPTAS for budgeted matching and budgeted matroid intersection via representative sets

arXiv preprint arXiv:2302.05681

2023/2/11

Ilan Doron-Arad
Ilan Doron-Arad

H-Index: 0

Ariel Kulik
Ariel Kulik

H-Index: 9

An EPTAS for budgeted matroid independent set

2023

Ilan Doron-Arad
Ilan Doron-Arad

H-Index: 0

Ariel Kulik
Ariel Kulik

H-Index: 9

Bin Packing with Partition Matroid can be Approximated within Bins

arXiv preprint arXiv:2212.01025

2022/12/2

Ilan Doron-Arad
Ilan Doron-Arad

H-Index: 0

Ariel Kulik
Ariel Kulik

H-Index: 9

Faster exponential-time approximation algorithms using approximate monotone local search

arXiv preprint arXiv:2206.13481

2022/6/27

Ariel Kulik
Ariel Kulik

H-Index: 9

An almost optimal approximation algorithm for monotone submodular multiple knapsack

Journal of Computer and System Sciences

2022/5/1

Data plane cooperative caching with dependencies

IEEE Transactions on Network and Service Management

2021/12/2

A refined analysis of submodular greedy

Operations Research Letters

2021/7/1

Ariel Kulik
Ariel Kulik

H-Index: 9

Roy Schwartz
Roy Schwartz

H-Index: 15

On Lagrangian relaxation for constrained maximization and reoptimization problems

Discrete Applied Mathematics

2021/6/15

Ariel Kulik
Ariel Kulik

H-Index: 9

General knapsack problems in a dynamic setting

arXiv preprint arXiv:2105.00882

2021/5/3

Submodular Maximization with Assignment Constraints and Parameterized Approximations.

2021

Ariel Kulik
Ariel Kulik

H-Index: 9

See List of Professors in Ariel Kulik University(Technion - Israel Institute of Technology)