7 citations · 11 across the 16 of their papers we have counts for
5 papers · 1 filter
Advice Complexity of Online Non-Crossing Matching
Ali Mohammad Lavasani, Denis Pankratov
We study online matching in the Euclidean -dimesional plane with non-crossing constraint. The offline version was introduced by Atallah in 1985 and the online version was introd…
Group Evacuation on a Line by Agents with Different Communication Abilities
Jurek Czyzowicz, Ryan Killick, Evangelos Kranakis +5
We consider evacuation of a group of autonomous mobile agents (or robots) from an unknown exit on an infinite line. The agents are initially placed at the origin of the…
Renting Servers in the Cloud: The Case of Equal Duration Jobs
Mahtab Masoori, Lata Narayanan, Denis Pankratov
Renting servers in the cloud is a generalization of the bin packing problem, motivated by job allocation to servers in cloud computing applications. Jobs arrive in an online manner…
Online Domination: The Value of Getting to Know All your Neighbors
Hovhannes Harutyunyan, Denis Pankratov, Jesse Racicot
We study the dominating set problem in an online setting. An algorithm is required to guarantee competitiveness against an adversary that reveals the input graph one node at a time…
Graph Exploration by Energy-Sharing Mobile Agents
J. Czyzowicz, S. Dobrev, R. Killick +6
We consider the problem of collective exploration of a known -node edge-weighted graph by mobile agents that have limited energy but are capable of energy transfers. The age…