
A Hitting Set Relaxation for kServer and an Extension to TimeWindows
We study the kserver problem with timewindows. In this problem, each r...
read it

Minimum Cuts in Directed Graphs via Partial Sparsification
We give an algorithm to find a minimum cut in an edgeweighted directed ...
read it

GomoryHu Tree in Subcubic Time
In 1961, Gomory and Hu showed that the maxflow values of all n 2 pairs ...
read it

Augmenting Edge Connectivity via Isolating Cuts
We give an algorithm for augmenting the edge connectivity of an undirect...
read it

Approximate GomoryHu Tree Is Faster Than n1 MaxFlows
The GomoryHu tree or cut tree (Gomory and Hu, 1961) is a classic data s...
read it

Deterministic Mincut in Polylogarithmic Maxflows
We give a deterministic algorithm for finding the minimum (weight) cut o...
read it

A Nearly Optimal AllPairs MinCuts Algorithm in Simple Graphs
We give an n^2+o(1)time algorithm for finding st mincuts for all pair...
read it

Universal Algorithms for Clustering
This paper presents universal algorithms for clustering problems, includ...
read it

Minimum Cuts in Directed Graphs via √(n) MaxFlows
We give an algorithm to find a mincut in an nvertex, medge weighted di...
read it

Vertex Connectivity in Polylogarithmic Maxflows
The vertex connectivity of an medge nvertex undirected graph is the sm...
read it

Aggregated Deletion Propagation for Counting Conjunctive Query Answers
We investigate the computational complexity of minimizing the source sid...
read it

Caching with Time Windows and Delays
We consider two generalizations of the classical weighted paging problem...
read it

Online Algorithms for Weighted Paging with Predictions
In this paper, we initiate the study of the weighted paging problem with...
read it

Sparsification of Balanced Directed Graphs
Sparsification, where the cut values of an input graph are approximately...
read it

Robust Algorithms for TSP and Steiner Tree
Robust optimization is a widely studied area in operations research, whe...
read it

Generalized Deletion Propagation on Counting Conjunctive Query Answers
We investigate the computational complexity of minimizing the source sid...
read it

Retracting Graphs to Cycles
We initiate the algorithmic study of retracting a graph into a cycle in ...
read it

Faster Algorithms for the Geometric Transportation Problem
Let R and B be two point sets in R^d, with R+ B = n and where d is a...
read it

Pacing Equilibrium in FirstPrice Auction Markets
In ad auctionsthe prevalent monetization mechanism of Internet compani...
read it

Minimizing Latency in Online Ride and Delivery Services
Motivated by the popularity of online ride and delivery services, we stu...
read it
Debmalya Panigrahi
is this you? claim profile