research
∙
09/05/2023
Online hitting set of d-dimensional fat objects
We consider an online version of the geometric minimum hitting set probl...
share
research
∙
07/20/2023
A parameterized approximation scheme for the 2D-Knapsack problem with wide items
We study a natural geometric variant of the classic Knapsack problem cal...
research
∙
02/23/2023
On price-induced minmax matchings
We study a natural combinatorial pricing problem for sequentially arrivi...
research
∙
10/13/2022
Online matching with delays and stochastic arrival times
This paper presents a new research direction for the Min-cost Perfect Ma...
research
∙
06/01/2021
A (2+ε)-Approximation Algorithm for Maximum Independent Set of Rectangles
We study the Maximum Independent Set of Rectangles (MISR) problem, where...
research
∙
05/01/2020
Approximating maximum integral multiflows on bounded genus graphs
We devise the first constant-factor approximation algorithm for finding ...
research
∙
01/31/2020
Ultimate greedy approximation of independent sets in subcubic graphs
We study the approximability of the maximum size independent set (MIS) p...
research
∙
01/06/2020