research
∙
02/23/2023
On price-induced minmax matchings
We study a natural combinatorial pricing problem for sequentially arrivi...
share
research
∙
10/01/2021
Online Primal-Dual Algorithms with Predictions for Packing Problems
The domain of online algorithms with predictions has been extensively st...
research
∙
07/01/2021
Orienting (hyper)graphs under explorable stochastic uncertainty
Given a hypergraph with uncertain node weights following known probabili...
research
∙
05/07/2020
Scheduling with a processing time oracle
In this paper we study a single machine scheduling problem on a set of i...
research
∙
04/30/2020
Randomized Two-Valued Bounded Delay Online Buffer Management
In the bounded delay buffer management problem unit size packets arrive ...
research
∙
05/23/2019
Non-monotone DR-submodular Maximization: Approximation and Regret Guarantees
Diminishing-returns (DR) submodular optimization is an important field w...
research
∙
05/14/2019
Online Computation with Untrusted Advice
The advice model of online computation captures the setting in which the...
research
∙
10/18/2018
Best-of-two-worlds analysis of online search
In search problems, a mobile searcher seeks to locate a target that hide...
research
∙
05/29/2018
Scheduling under dynamic speed-scaling for minimizing weighted completion time and energy consumption
Since a few years there is an increasing interest in minimizing the ener...
research
∙
01/10/2018
