Communities
Connect sessions
AI calendar
Organizations
Join Slack
Contact Sales
Search
Open menu
Home
Papers
2008.03091
Cited By
Low-Congestion Shortcuts for Graphs Excluding Dense Minors
ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), 2020
7 August 2020
M. Ghaffari
Bernhard Haeupler
Re-assign community
ArXiv (abs)
PDF
HTML
Papers citing
"Low-Congestion Shortcuts for Graphs Excluding Dense Minors"
12 / 12 papers shown
Decentralized Distributed Graph Coloring II: degree+1-Coloring Virtual Graphs
International Symposium on Distributed Computing (DISC), 2024
Maxime Flin
Magnús M. Halldórsson
Alexandre Nolin
252
3
0
20 Aug 2024
Model-Agnostic Approximation of Constrained Forest Problems
Corinna Coupette
Alipasha Montaseri
Christoph Lenzen
144
0
0
14 Jul 2024
Fast Broadcast in Highly Connected Networks
Shashwat Chandra
Yi-Jun Chang
Michal Dory
Mohsen Ghaffari
Dean Leitersdorf
177
1
0
19 Apr 2024
Polylog-Competitive Deterministic Local Routing and Scheduling
Symposium on the Theory of Computing (STOC), 2024
Bernhard Haeupler
Shyamal Patel
Antti Roeyskoe
Cliff Stein
Goran Zuzic
213
1
0
12 Mar 2024
The Distributed Complexity of Locally Checkable Labeling Problems Beyond Paths and Trees
Information Technology Convergence and Services (ITCS), 2023
Yi-Jun Chang
224
5
0
12 Nov 2023
Efficient Distributed Decomposition and Routing Algorithms in Minor-Free Networks and Their Applications
ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), 2023
Yi-Jun Chang
259
7
0
10 Apr 2023
Narrowing the LOCAL
\unicode
x
2013
\unicode{x2013}
\unicode
x
2013
CONGEST Gaps in Sparse Networks via Expander Decompositions
ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), 2022
Yi-Jun Chang
Hsin-Hao Su
254
10
0
17 May 2022
Undirected
(
1
+
ε
)
(1+\varepsilon)
(
1
+
ε
)
-Shortest Paths via Minor-Aggregates: Near-Optimal Deterministic Parallel & Distributed Algorithms
Václav Rozhon
Christoph Grunau
Bernhard Haeupler
Goran Zuzic
Jason Li
213
29
0
12 Apr 2022
Almost Universally Optimal Distributed Laplacian Solvers via Low-Congestion Shortcuts
Ioannis Anagnostides
Christoph Lenzen
Bernhard Haeupler
Goran Zuzic
Themis Gouleakis
346
8
0
11 Sep 2021
Local certification of graph decompositions and applications to minor-free classes
International Conference on Principles of Distributed Systems (OPODIS), 2021
Nicolas Bousquet
Laurent Feuilloley
Théo Pierron
375
25
0
30 Jul 2021
Low-Congestion Shortcuts in Constant Diameter Graphs
ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), 2021
Shimon Kogan
M. Parter
155
11
0
03 Jun 2021
The Energy Complexity of Diameter and Minimum Cut Computation in Bounded-Genus Networks
Yi-Jun Chang
311
4
0
10 May 2018
1
Page 1 of 1
