5 citations · 28 across the 23 of their papers we have counts for
5 papers · 1 filter
Distributed Vertex Cover Reconfiguration
Keren Censor-Hillel, Yannic Maus, Shahar Romem-Peled +1
Reconfiguration schedules, i.e., sequences that gradually transform one solution of a problem to another while always maintaining feasibility, have been extensively studied. Most r…
Locally Checkable Labelings with Small Messages
Alkida Balliu, Keren Censor-Hillel, Yannic Maus +2
A rich line of work has been addressing the computational complexity of locally checkable labelings (LCLs), illustrating the landscape of possible complexities. In this paper, we s…
Fault Tolerant Max-Cut
Keren Censor-Hillel, Noa Marelly, Roy Schwartz +1
In this work, we initiate the study of fault tolerant Max Cut, where given an edge-weighted undirected graph , the goal is to find a cut that maximizes the…
Near-Optimal Scheduling in the Congested Clique
Keren Censor-Hillel, Yannic Maus, Volodymyr Polosukhin
This paper provides three nearly-optimal algorithms for scheduling jobs in the model. First, we present a deterministic scheduling algorithm that runs in $O(\…
Fast Distributed Algorithms for Girth, Cycles and Small Subgraphs
Keren Censor-Hillel, Orr Fischer, Tzlil Gonen +3
In this paper we give fast distributed graph algorithms for detecting and listing small subgraphs, and for computing or approximating the girth. Our algorithms improve upon the sta…