7 citations · 11 across the 16 of their papers we have counts for
23 papers
Online Interval Selection on a Simple Chain
Yaqiao Li, Ali Mohammad Lavasani, Denis Pankratov
A set of intervals forms a simple chain if, for every , interval overlaps only with and . We show that a…
Renting Servers for Multi-Parameter Jobs in the Cloud
Yaqiao Li, Mahtab Masoori, Lata Narayanan +1
We study the Renting Servers in the Cloud problem (RSiC) in multiple dimensions. In this problem, a sequence of multi-parameter jobs must be scheduled on servers that can be rented…
The En Route Truck-Drone Delivery Problem
Danny Krizanc, Lata Narayanan, Jaroslav Opatrny +1
We study the truck-drone cooperative delivery problem in a setting where a single truck carrying a drone travels at constant speed on a straight-line trajectory/street. Delivery to…
Temporal Separators with Deadlines
Hovhannes A. Harutyunyan, Kamran Koupayi, Denis Pankratov
We study temporal analogues of the Unrestricted Vertex Separator problem from the static world. An -temporal separator is a set of vertices whose removal disconnects vertex…
Online Vector Bin Packing and Hypergraph Coloring Illuminated: Simpler Proofs and New Connections
Yaqiao Li, Denis Pankratov
This paper studies the online vector bin packing (OVBP) problem and the related problem of online hypergraph coloring (OHC). Firstly, we use a double counting argument to prove an…
Maximum Weight Convex Polytope
Mohammad Ali Abam, Ali Mohammad Lavasani, Denis Pankratov
We study the maximum weight convex polytope problem, in which the goal is to find a convex polytope maximizing the total weight of enclosed points. Prior to this work, the only kno…