5 citations · 14 across the 15 of their papers we have counts for
Showing 2026 · cs.DSShow all
3 papers · 2 filters
cs.DS2026
Faster Deterministic Streaming Vertex Coloring
Shiri Chechik, Hongyi Chen, Tianyi Zhang
Graph coloring is a fundamental problem in computer science. In the semi-streaming model, an input graph on vertices and maximum degree is presented as a stream of edge…
cs.DS2026
Simpler and Improved Replacement Path Coverings
Davide Bilò, Shiri Chechik, Keerti Choudhary +2
An important tool in the design of fault-tolerant graph data structures are -replacement path coverings (RPCs). An RPC is a family of subgraphs of a given grap…
cs.DS2026
Girth Approximations in the CONGEST Model
Shiri Chechik, Gur Lifshitz, Doron Mukhtar
This paper advances the state of the art in girth approximation within the CONGEST model. Manoharan and Ramachandran [PODC '24] provided the first significant improvement in girth…