265 citations · 336 across the 22 of their papers we have counts for
3 papers · 1 filter
Fully Dynamic -Coloring in Constant Update Time
Sayan Bhattacharya, Fabrizio Grandoni, Janardhan Kulkarni +2
The problem of (vertex) -coloring a graph of maximum degree has been extremely well-studied over the years in various settings and models. Surprisingly, for the dynamic…
Online Geometric Discrepancy for Stochastic Arrivals with Applications to Envy Minimization
Haotian Jiang, Janardhan Kulkarni, Sahil Singla
Consider a unit interval in which points arrive one-by-one independently and uniformly at random. On arrival of a point, the problem is to immediately and irrevocably c…
Parallel Batch-Dynamic Graphs: Algorithms and Lower Bounds
David Durfee, Laxman Dhulipala, Janardhan Kulkarni +3
In this paper we study the problem of dynamically maintaining graph properties under batches of edge insertions and deletions in the massively parallel model of computation. In thi…