This paper studies the online vector bin packing (OVBP) problem and the
...
We study the maximum weight convex polytope problem, in which the goal i...
We study online matching in the Euclidean 2-dimesional plane with
non-cr...
We consider evacuation of a group of n ≥ 2 autonomous mobile agents (or
...
Renting servers in the cloud is a generalization of the bin packing prob...
We study the dominating set problem in an online setting. An algorithm i...
Assume that m ≥ 1 autonomous mobile agents and 0 ≤ b ≤ m
single-agent tr...
We introduce a new type of adversary for online graph problems. The new
...
The priority model was introduced by Borodin, Rackoff and Nielsen to cap...
We consider the problem of finding a treasure at an unknown point of an
...
We perform an experimental study of algorithms for online bipartite matc...
The priority model of "greedy-like" algorithms was introduced by Borodin...
We introduce a new random input model for bipartite matching which we ca...
We introduce and develop a new semi-algebraic proof system, called Stabb...