research
∙
11/18/2022
Listing 4-Cycles
In this note we present an algorithm that lists all 4-cycles in a graph ...
share
research
∙
04/22/2022
Hardness of Approximation in P via Short Cycle Removal: Cycle Detection, Distance Oracles, and Beyond
We present a new technique for efficiently removing almost all short cyc...
research
∙
03/16/2020
Beyond Alice and Bob: Improved Inapproximability for Maximum Independent Set in CONGEST
By far the most fruitful technique for showing lower bounds for the CONG...
research
∙
06/27/2019
Improved Distributed Approximation to Maximum Independent Set
We present improved results for approximating Maximum Independent Set ()...
research
∙
01/07/2019
Smaller Cuts, Higher Lower Bounds
This paper proves strong lower bounds for distributed computing in the C...
research
∙
11/05/2017