 Decentralized Distributed Graph Coloring II: degree+1-Coloring Virtual
GraphsInternational Symposium on Distributed Computing (DISC), 2024 |
 Massively Parallel Ruling Set Made DeterministicInternational Symposium on Distributed Computing (DISC), 2024 |
 Distributed Delta-Coloring under Bandwidth LimitationsInternational Symposium on Distributed Computing (DISC), 2024 |
 Decentralized Distributed Graph Coloring: Cluster GraphsACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), 2024 |
 Low-Distortion Clustering in Bounded Growth GraphsColloquium on Structural Information & Communication Complexity (CSICC), 2024 |
 The Message Complexity of Distributed Graph OptimizationInformation Technology Convergence and Services (ITCS), 2023 |
 The Distributed Complexity of Locally Checkable Labeling Problems Beyond
Paths and TreesInformation Technology Convergence and Services (ITCS), 2023 |
 Improved Distributed Algorithms for Random ColoringsInternational Conference on Principles of Distributed Systems (OPODIS), 2023 |
 Fast Coloring Despite Congested RelaysInternational Symposium on Distributed Computing (DISC), 2023 |
 Conditionally Optimal Parallel Coloring of ForestsInternational Symposium on Distributed Computing (DISC), 2023 |
 Distributed MIS with Low Energy and Time ComplexitiesACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), 2023 |
 Average Awake Complexity of MIS and MatchingACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2022 |
 Coloring Fast with BroadcastsACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2023 |
 List Defective Colorings: Distributed Algorithms and ApplicationsInternational Symposium on Distributed Computing (DISC), 2023 |
 Optimal Message-Passing with Noisy BeepsACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), 2023 |
 Distributed Half-Integral Matching and BeyondColloquium on Structural Information & Communication Complexity (SIROCCO), 2023 |
 Exact Distributed SamplingColloquium on Structural Information & Communication Complexity (SIROCCO), 2023 |
 Distributed Symmetry Breaking on Power Graphs via SparsificationACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), 2023 |
 Distributed CONGEST Algorithm for Finding Hamiltonian Paths in Dirac
Graphs and GeneralizationsInternational Symposium on Mathematical Foundations of Computer Science (MFCS), 2023 |
 Deterministic Massively Parallel Symmetry Breaking for Sparse GraphsACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2023 |
 A Distributed Palette Sparsification TheoremACM-SIAM Symposium on Discrete Algorithms (SODA), 2023 |
 Distributed Self-Stabilizing MIS with Few States and Weak CommunicationACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), 2023 |
 Fast Distributed Brooks' TheoremACM-SIAM Symposium on Discrete Algorithms (SODA), 2022 |
 Distributed Maximal Matching and Maximal Independent Set on HypergraphsACM-SIAM Symposium on Discrete Algorithms (SODA), 2022 |
 Making Self-Stabilizing any Locally Greedy ProblemSymposium on Algorithmic Foundations of Dynamic Networks (AFDN), 2022 |
 Improved Distributed Algorithms for the Lovász Local Lemma and Edge
ColoringACM-SIAM Symposium on Discrete Algorithms (SODA), 2022 |
 Node and Edge Averaged Complexities of Local Graph ProblemsDistributed computing (Distrib. Comput.), 2022 |
 Fast Distributed Vertex Splitting with ApplicationsInternational Symposium on Distributed Computing (DISC), 2022 |
 Distributed Edge Coloring in Time Polylogarithmic in ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), 2022 |
 Overcoming Congestion in Distributed ColoringACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), 2022 |
 Narrowing the LOCALCONGEST Gaps in Sparse Networks via
Expander DecompositionsACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), 2022 |
 Distributed MIS in Awake ComplexityACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), 2022 |
 Efficient CONGEST Algorithms for the Lovasz Local LemmaInternational Symposium on Distributed Computing (DISC), 2021 |
 Improved Distributed Lower Bounds for MIS and Bounded (Out-)Degree
Dominating Sets in TreesACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), 2021 |
 Can We Break Symmetry with o(m) Communication?ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), 2021 |
 Distributed Graph Coloring Made EasyACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2021 |
 Locally Checkable Labelings with Small MessagesInternational Symposium on Distributed Computing (DISC), 2021 |
 The Complexity of Symmetry Breaking in Massive GraphsInternational Symposium on Distributed Computing (DISC), 2021 |
