Papers
Communities
Events
Blog
Pricing
Search
Open menu
Home
Papers
2405.05132
Cited By
Low-Distortion Clustering in Bounded Growth Graphs
8 May 2024
Yi-Jun Chang
Varsha Dani
Thomas P. Hayes
Re-assign community
ArXiv (abs)
PDF
HTML
Papers citing
"Low-Distortion Clustering in Bounded Growth Graphs"
24 / 24 papers shown
Title
Borel Vizing's Theorem for Graphs of Subexponential Growth
Anton Bernshteyn
A. Dhawan
134
6
0
30 Jun 2023
Distributed MIS with Low Energy and Time Complexities
M. Ghaffari
Julian Portmann
37
10
0
19 May 2023
Average Awake Complexity of MIS and Matching
M. Ghaffari
Julian Portmann
38
13
0
10 May 2023
The Complexity of Distributed Approximation of Packing and Covering Integer Linear Programs
Yi-Jun Chang
Zeyong Li
62
6
0
02 May 2023
Uniting General-Graph and Geometric-Based Radio Networks via Independence Number Parametrization
Peter Davies
47
1
0
29 Mar 2023
How to Wake Up Your Neighbors: Safe and Nearly Optimal Generic Energy Conservation in Radio Networks
Varsha Dani
Thomas P. Hayes
51
7
0
25 May 2022
Distributed MIS in
O
(
log
log
n
)
O(\log\log{n} )
O
(
lo
g
lo
g
n
)
Awake Complexity
Fabien Dufoulon
W. Moses
Gopal Pandurangan
47
12
0
18 Apr 2022
Distributed CONGEST Approximation of Weighted Vertex Covers and Matchings
S. Faour
Marc Fuchs
Fabian Kuhn
46
11
0
20 Nov 2021
Deterministic Logarithmic Completeness in the Distributed Sleeping Model
Leonid Barenboim
Tzalik Maimon
18
21
0
04 Aug 2021
Wake Up and Join Me! An Energy-Efficient Algorithm for Maximal Matching in Radio Networks
Varsha Dani
Aayush Gupta
Thomas P. Hayes
Seth Pettie
25
14
0
19 Apr 2021
Deterministic Distributed Expander Decomposition and Routing with Applications in Distributed Derandomization
Yi-Jun Chang
Thatchaphol Saranurak
28
34
0
29 Jul 2020
The Energy Complexity of BFS in Radio Networks
Yi-Jun Chang
Varsha Dani
Thomas P. Hayes
Seth Pettie
23
22
0
19 Jul 2020
Sleeping is Efficient: MIS in
O
(
1
)
O(1)
O
(
1
)
-rounds Node-averaged Awake Complexity
Soumyottam Chatterjee
R. Gmyr
Gopal Pandurangan
50
34
0
12 Jun 2020
A Breezing Proof of the KMW Bound
Corinna Coupette
Christoph Lenzen
49
4
0
14 Feb 2020
Property Testing of Planarity in the CONGEST model
Reut Levi
Moti Medina
D. Ron
31
13
0
27 May 2018
The Energy Complexity of Diameter and Minimum Cut Computation in Bounded-Genus Networks
Yi-Jun Chang
45
3
0
10 May 2018
Deterministic Distributed Edge-Coloring with Fewer Colors
M. Ghaffari
Fabian Kuhn
Yannic Maus
Jara Uitto
34
54
0
15 Nov 2017
The Energy Complexity of Broadcast
Yi-Jun Chang
Varsha Dani
Thomas P. Hayes
Qizheng He
Wenzheng Li
Seth Pettie
25
45
0
04 Oct 2017
Fast Distributed Approximation for Max-Cut
K. Censor-Hillel
Rina Levy
H. Shachnai
67
10
0
26 Jul 2017
Exploiting Spontaneous Transmissions for Broadcasting and Leader Election in Radio Networks
A. Czumaj
Peter Davies
15
21
0
06 Mar 2017
Exponential Separations in the Energy Complexity of Leader Election
Yi-Jun Chang
T. Kopelowitz
Seth Pettie
Ruosong Wang
Wei Zhan
25
43
0
27 Sep 2016
A Local Broadcast Layer for the SINR Network Model
Magnús M. Halldórsson
S. Holzer
Nancy A. Lynch
29
21
0
18 May 2015
The Locality of Distributed Symmetry Breaking
Leonid Barenboim
Michael Elkin
Seth Pettie
Johannes Schneider
83
298
0
09 Feb 2012
Distributed Deterministic Edge Coloring using Bounded Neighborhood Independence
Leonid Barenboim
Michael Elkin
70
45
0
12 Oct 2010
1