research
∙
06/20/2023
Online Vector Bin Packing and Hypergraph Coloring Illuminated: Simpler Proofs and New Connections
This paper studies the online vector bin packing (OVBP) problem and the ...
share
research
∙
07/26/2022
Maximum Weight Convex Polytope
We study the maximum weight convex polytope problem, in which the goal i...
research
∙
12/15/2021
Advice Complexity of Online Non-Crossing Matching
We study online matching in the Euclidean 2-dimesional plane with non-cr...
research
∙
09/26/2021
Group Evacuation on a Line by Agents with Different Communication Abilities
We consider evacuation of a group of n ≥ 2 autonomous mobile agents (or ...
research
∙
08/27/2021
Renting Servers in the Cloud: The Case of Equal Duration Jobs
Renting servers in the cloud is a generalization of the bin packing prob...
research
∙
05/01/2021
Online Domination: The Value of Getting to Know All your Neighbors
We study the dominating set problem in an online setting. An algorithm i...
research
∙
06/23/2020
The Bike Sharing Problem
Assume that m ≥ 1 autonomous mobile agents and 0 ≤ b ≤ m single-agent tr...
research
∙
05/21/2020
Online Coloring and a New Type of Adversary for Online Graph Problems
We introduce a new type of adversary for online graph problems. The new ...
research
∙
10/02/2019
Advice Complexity of Adaptive Priority Algorithms
The priority model was introduced by Borodin, Rackoff and Nielsen to cap...
research
∙
02/11/2019
Exploration of High-Dimensional Grids by Finite State Machines
We consider the problem of finding a treasure at an unknown point of an ...
research
∙
08/14/2018
An Experimental Study of Algorithms for Online Bipartite Matching
We perform an experimental study of algorithms for online bipartite matc...
research
∙
06/16/2018
Advice Complexity of Priority Algorithms
The priority model of "greedy-like" algorithms was introduced by Borodin...
research
∙
05/02/2018
Greedy Bipartite Matching in Random Type Poisson Arrival Model
We introduce a new random input model for bipartite matching which we ca...
research
∙
10/09/2017
