A delaunay triangulation architecture supporting churn and user mobility in MMVEs. - Mohsen Ghaffari 001; Behnoosh Hariri; Shervin Shirmohammadi (NOSSDAV, 2009)

A new routing algorithm for sparse vehicular ad-hoc networks with moving destinations. - Mohsen Ghaffari 001; Farid Ashtiani (WCNC, 2009)

On the Necessary and Sufficient Condition of Greedy Routing Supporting Geographical Data Networks - Mohsen Ghaffari 001; Behnoosh Hariri; Shervin Shirmohammadi (CoRR, 2009)

On the necessity of using Delaunay Triangulation substrate in greedy routing based networks. - Mohsen Ghaffari 001; Behnoosh Hariri; Shervin Shirmohammadi (IEEE Commun. Lett., 2010)

Optimal Broadcast in Shared Spectrum Radio Networks. - Mohsen Ghaffari 001; Seth Gilbert; Calvin C. Newport; Henry Tan (OPODIS, 2012)

Bounds on Contention Management in Radio Networks. - Mohsen Ghaffari 001; Bernhard Haeupler; Nancy A. Lynch; Calvin C. Newport (DISC, 2012)

The Complexity of Multi-Message Broadcast in Radio Networks with Known Topology - Mohsen Ghaffari 001; Bernhard Haeupler; Majid Khabbazian (CoRR, 2012)

Leader election using loneliness detection. - Mohsen Ghaffari 001; Nancy A. Lynch; Srikanth Sastry (Distributed Comput., 2012)

Maximal independent sets in multichannel radio networks. - Sebastian Daum; Mohsen Ghaffari 001; Seth Gilbert; Fabian Kuhn; Calvin C. Newport (PODC, 2013)

The cost of radio network broadcast for different models of unreliable links. - Mohsen Ghaffari 001; Nancy A. Lynch; Calvin C. Newport (PODC, 2013)

Near Optimal Leader Election in Multi-Hop Radio Networks. - Mohsen Ghaffari 001; Bernhard Haeupler (SODA, 2013)

Fast Structuring of Radio Networks Large for Multi-message Communications. - Mohsen Ghaffari 001; Bernhard Haeupler (DISC, 2013)

Distributed Minimum Cut Approximation. - Mohsen Ghaffari 001; Fabian Kuhn (DISC, 2013)

A Bound on the Throughput of Radio Networks - Mohsen Ghaffari 001; Bernhard Haeupler; Majid Khabbazian (CoRR, 2013)

Optimal Error Rates for Interactive Coding II: Efficiency and List Decoding. - Mohsen Ghaffari 001; Bernhard Haeupler (FOCS, 2014)

Near-Optimal Distributed Approximation of Minimum-Weight Connected Dominating Set. - Mohsen Ghaffari 001 (ICALP (2), 2014)

On the Importance of Registers for Computability. - Rati Gelashvili; Mohsen Ghaffari 001; Jerry Li 001; Nir Shavit (OPODIS, 2014)

Distributed connectivity decomposition. - Keren Censor-Hillel; Mohsen Ghaffari 001; Fabian Kuhn (PODC, 2014)

Multi-message broadcast with abstract MAC layers and unreliable links. - Mohsen Ghaffari 001; Erez Kantor; Nancy A. Lynch; Calvin C. Newport (PODC, 2014)

Broadcast Throughput in Radio Networks: Routing vs. Network Coding. - Noga Alon; Mohsen Ghaffari 001; Bernhard Haeupler; Majid Khabbazian (SODA, 2014)

A New Perspective on Vertex Connectivity. - Keren Censor-Hillel; Mohsen Ghaffari 001; Fabian Kuhn (SODA, 2014)

Optimal error rates for interactive coding I: adaptivity and other settings. - Mohsen Ghaffari 001; Bernhard Haeupler; Madhu Sudan 001 (STOC, 2014)

Near-Optimal Distributed Tree Embedding. - Mohsen Ghaffari 001; Christoph Lenzen 001 (DISC, 2014)

Fast Structuring of Radio Networks for Multi-Message Communications. - Mohsen Ghaffari 001; Bernhard Haeupler (CoRR, 2014)

Distributed Broadcast Revisited: Towards Universal Optimality. - Mohsen Ghaffari 001 (ICALP (2), 2015)

Near-Optimal Scheduling of Distributed Algorithms. - Mohsen Ghaffari 001 (PODC, 2015)

Near-Optimal Distributed Maximum Flow: Extended Abstract. - Mohsen Ghaffari 001; Andreas Karrenbauer; Fabian Kuhn; Christoph Lenzen 001; Boaz Patt-Shamir (PODC, 2015)

Distributed House-Hunting in Ant Colonies. - Mohsen Ghaffari 001; Cameron Musco; Tsvetomira Radeva; Nancy A. Lynch (PODC, 2015)

Brief Announcement: Distributed Single-Source Reachability. - Mohsen Ghaffari 001; Rajan Udwani (PODC, 2015)

Tight Bounds on Vertex Connectivity Under Vertex Sampling. - Keren Censor-Hillel; Mohsen Ghaffari 001; George Giakkoupis; Bernhard Haeupler; Fabian Kuhn (SODA, 2015)

Towards an Optimal Distributed Algorithm for Maximal Independent Set. - Mohsen Ghaffari 001 (CoRR, 2015)

Randomized broadcast in radio networks with collision detection. - Mohsen Ghaffari 001; Bernhard Haeupler; Majid Khabbazian (Distributed Comput., 2015)

A Dynamic Networking Substrate for Distributed MMOGs. - Mohsen Ghaffari 001; Behnoosh Hariri; Shervin Shirmohammadi; Dewan Tanvir Ahmed (IEEE Trans. Emerg. Top. Comput., 2015)

Leader Election in Unreliable Radio Networks. - Mohsen Ghaffari 001; Calvin C. Newport (ICALP, 2016)

Distributed Algorithms for Planar Networks I: Planar Embedding. - Mohsen Ghaffari 001; Bernhard Haeupler (PODC, 2016)

MST in Log-Star Rounds of Congested Clique. - Mohsen Ghaffari 001; Merav Parter (PODC, 2016)

A Polylogarithmic Gossip Algorithm for Plurality Consensus. - Mohsen Ghaffari 001; Merav Parter (PODC, 2016)

An Improved Distributed Algorithm for Maximal Independent Set. - Mohsen Ghaffari 001 (SODA, 2016)

Distributed Algorithms for Planar Networks II: Low-Congestion Shortcuts, MST, and Min-Cut. - Mohsen Ghaffari 001; Bernhard Haeupler (SODA, 2016)

Near-Optimal Distributed Algorithms for Fault-Tolerant Tree Structures. - Mohsen Ghaffari 001; Merav Parter (SPAA, 2016)

How to Discreetly Spread a Rumor in a Crowd. - Mohsen Ghaffari 001; Calvin C. Newport (DISC, 2016)

Near-Optimal BFS-Tree Construction in Radio Networks. - Mohsen Ghaffari 001; Bernhard Haeupler (IEEE Commun. Lett., 2016)

Deterministic Distributed Edge-Coloring via Hypergraph Maximal Matching. - Manuela Fischer; Mohsen Ghaffari 001; Fabian Kuhn (FOCS, 2017)

Distributed Approximation of Maximum Independent Set and Maximum Matching. - Reuven Bar-Yehuda; Keren Censor-Hillel; Mohsen Ghaffari 001; Gregory Schwartzman (PODC, 2017)

Distributed MIS via All-to-All Communication. - Mohsen Ghaffari 001 (PODC, 2017)

Distributed MST and Routing in Almost Mixing Time. - Mohsen Ghaffari 001; Fabian Kuhn; Hsin-Hao Su (PODC, 2017)

Random Contractions and Sampling for Hypergraph and Hedge Connectivity. - Mohsen Ghaffari 001; David R. Karger; Debmalya Panigrahi (SODA, 2017)

Distributed Degree Splitting, Edge Coloring, and Orientations. - Mohsen Ghaffari 001; Hsin-Hao Su (SODA, 2017)

On the complexity of local distributed graph problems. - Mohsen Ghaffari 001; Fabian Kuhn; Yannic Maus (STOC, 2017)

Sublogarithmic Distributed Algorithms for Lovász Local Lemma, and the Complexity Hierarchy. - Manuela Fischer; Mohsen Ghaffari 001 (DISC, 2017)

Simple and Near-Optimal Distributed Coloring for Sparse Graphs. - Mohsen Ghaffari 001; Christiana Lymouri (DISC, 2017)

Near-Optimal Distributed DFS in Planar Graphs. - Mohsen Ghaffari 001; Merav Parter (DISC, 2017)

Deterministic Distributed Matching: Simpler, Faster, Better. - Manuela Fischer; Mohsen Ghaffari 001 (CoRR, 2017)

Space-Optimal Semi-Streaming for (2+ε)-Approximate Matching. - Mohsen Ghaffari 001 (CoRR, 2017)

Tight Analysis for the 3-Majority Consensus Dynamics. - Mohsen Ghaffari 001; Johannes Lengler (CoRR, 2017)

Tight Bounds on Vertex Connectivity Under Sampling. - Keren Censor-Hillel; Mohsen Ghaffari 001; George Giakkoupis; Bernhard Haeupler; Fabian Kuhn (ACM Trans. Algorithms, 2017)

Improved Distributed Algorithms for Fundamental Graph Problems. - Mohsen Ghaffari 001 (2017)

On Derandomizing Local Distributed Algorithms. - Mohsen Ghaffari 001; David G. Harris 001; Fabian Kuhn (FOCS, 2018)

A Tight Analysis of the Parallel Undecided-State Dynamics with Two Colors. - Andrea Clementi; Mohsen Ghaffari 001; Luciano Gualà; Emanuele Natale; Francesco Pasquale; Giacomo Scornavacca (MFCS, 2018)

Session details: Session 2B: Routing and Leader Election. - Mohsen Ghaffari 001 (PODC, 2018)

Improved Massively Parallel Computation Algorithms for MIS, Matching, and Vertex Cover. - Mohsen Ghaffari 001; Themis Gouleakis; Christian Konrad 001; Slobodan Mitrovic; Ronitt Rubinfeld (PODC, 2018)

Improved Distributed Delta-Coloring. - Mohsen Ghaffari 001; Juho Hirvonen; Fabian Kuhn; Yannic Maus (PODC, 2018)

Nearly-Tight Analysis for 2-Choice and 3-Majority Consensus Dynamics. - Mohsen Ghaffari 001; Johannes Lengler (PODC, 2018)

Congested Clique Algorithms for the Minimum Cut Problem. - Mohsen Ghaffari 001; Krzysztof Nowicki 002 (PODC, 2018)

Deterministic distributed edge-coloring with fewer colors. - Mohsen Ghaffari 001; Fabian Kuhn; Yannic Maus; Jara Uitto (STOC, 2018)

Improved distributed algorithms for exact shortest paths. - Mohsen Ghaffari 001; Jason Li 006 (STOC, 2018)

Distributed Set Cover Approximation: Primal-Dual with Optimal Locality. - Guy Even; Mohsen Ghaffari 001; Moti Medina (DISC, 2018)

A Simple Parallel and Distributed Sampling Technique: Local Glauber Dynamics. - Manuela Fischer; Mohsen Ghaffari 001 (DISC, 2018)

Derandomizing Distributed Algorithms with Small Messages: Spanners and Dominating Set. - Mohsen Ghaffari 001; Fabian Kuhn (DISC, 2018)

Distributed MST and Broadcast with Fewer Messages, and Faster Gossiping. - Mohsen Ghaffari 001; Fabian Kuhn (DISC, 2018)

New Distributed Algorithms in Almost Mixing Time via Transformations from Parallel Algorithms. - Mohsen Ghaffari 001; Jason Li 006 (DISC, 2018)

Improved Massively Parallel Computation Algorithms for MIS, Matching, and Vertex Cover. - Mohsen Ghaffari 001; Themis Gouleakis; Slobodan Mitrovic; Ronitt Rubinfeld (CoRR, 2018)

Distributed Computation in the Node-Congested Clique. - John Augustine; Mohsen Ghaffari 001; Robert Gmyr; Kristian Hinnenthal; Fabian Kuhn; Jason Li 006; Christian Scheideler (CoRR, 2018)

Simple Graph Coloring Algorithms for Congested Clique and Massively Parallel Computation. - Manuela Fischer; Mohsen Ghaffari 001; Jara Uitto (CoRR, 2018)

Near-Optimal Distributed Maximum Flow. - Mohsen Ghaffari 001; Andreas Karrenbauer; Fabian Kuhn; Christoph Lenzen 001; Boaz Patt-Shamir (SIAM J. Comput., 2018)

Conditional Hardness Results for Massively Parallel Computation from Distributed Lower Bounds. - Mohsen Ghaffari 001; Fabian Kuhn; Jara Uitto (FOCS, 2019)

Distributed Arboricity-Dependent Graph Coloring via All-to-All Communication. - Mohsen Ghaffari 001; Ali Sayyadi (ICALP, 2019)

Improved Parallel Algorithms for Density-Based Network Clustering. - Mohsen Ghaffari 001; Silvio Lattanzi; Slobodan Mitrovic (ICML, 2019)

On the Complexity of Distributed Splitting Problems. - Philipp Bamberger; Mohsen Ghaffari 001; Fabian Kuhn; Yannic Maus; Jara Uitto (PODC, 2019)

The Complexity of (Δ+1) Coloring in Congested Clique, Massively Parallel Computation, and Centralized Local Computation. - Yi-Jun Chang; Manuela Fischer; Mohsen Ghaffari 001; Jara Uitto; Yufan Zheng (PODC, 2019)

Improved Distributed Approximations for Minimum-Weight Two-Edge-Connected Spanning Subgraph. - Michal Dory; Mohsen Ghaffari 001 (PODC, 2019)

On the Use of Randomness in Local Distributed Graph Algorithms. - Mohsen Ghaffari 001; Fabian Kuhn (PODC, 2019)

Distributed Maximal Independent Set using Small Messages. - Mohsen Ghaffari 001 (SODA, 2019)

Sparsifying Distributed Algorithms with Ramifications in Massively Parallel Computation and Centralized Local Computation. - Mohsen Ghaffari 001; Jara Uitto (SODA, 2019)

Simplified and Space-Optimal Semi-Streaming (2+epsilon)-Approximate Matching. - Mohsen Ghaffari 001; David Wajc (SOSA, 2019)

Distributed Computation in Node-Capacitated Networks. - John Augustine; Mohsen Ghaffari 001; Robert Gmyr; Kristian Hinnenthal; Christian Scheideler; Fabian Kuhn; Jason Li 006 (SPAA, 2019)

Distributed Algorithms for Low Stretch Spanning Trees. - Ruben Becker; Yuval Emek; Mohsen Ghaffari 001; Christoph Lenzen 001 (DISC, 2019)

Improved Network Decompositions Using Small Messages with Applications on MIS, Neighborhood Covers, and Beyond. - Mohsen Ghaffari 001; Julian Portmann (DISC, 2019)

Massively Parallel Algorithms for Minimum Cut. - Mohsen Ghaffari 001; Krzysztof Nowicki 002 (PODC, 2020)

Network Decomposition and Distributed Derandomization (Invited Paper). - Mohsen Ghaffari 001 (SIROCCO, 2020)

Faster Algorithms for Edge Connectivity via Random 2-Out Contractions. - Mohsen Ghaffari 001; Krzysztof Nowicki 002; Mikkel Thorup (SODA, 2020)

A Massively Parallel Algorithm for Minimum Weight Vertex Cover. - Mohsen Ghaffari 001; Ce Jin 001; Daan Nilis (SPAA, 2020)

Polylogarithmic-time deterministic network decomposition and distributed derandomization. - Václav Rozhon; Mohsen Ghaffari 001 (STOC, 2020)

Improved MPC Algorithms for MIS, Matching, and Coloring on Trees and Beyond. - Mohsen Ghaffari 001; Christoph Grunau; Ce Jin 001 (DISC, 2020)

Improved distributed degree splitting and edge coloring. - Mohsen Ghaffari 001; Juho Hirvonen; Fabian Kuhn; Yannic Maus; Jukka Suomela; Jara Uitto (Distributed Comput., 2020)

Deterministic Distributed Vertex Coloring: Simpler, Faster, and without Network Decomposition. - Mohsen Ghaffari 001; Fabian Kuhn (FOCS, 2021)

Network Decomposition and Distributed Derandomization. - Mohsen Ghaffari 001 (ICDCN, 2021)

Strong-Diameter Network Decomposition. - Yi-Jun Chang; Mohsen Ghaffari 001 (PODC, 2021)

Low-Congestion Shortcuts for Graphs Excluding Dense Minors. - Mohsen Ghaffari 001; Bernhard Haeupler (PODC, 2021)

Improved Deterministic Network Decomposition. - Mohsen Ghaffari 001; Christoph Grunau; Václav Rozhon (SODA, 2021)

A Time-Optimal Randomized Parallel Algorithm for MIS. - Mohsen Ghaffari 001; Bernhard Haeupler (SODA, 2021)

Massively Parallel Algorithms for Distance Approximation and Spanners. - Amartya Shankha Biswas; Michal Dory; Mohsen Ghaffari 001; Slobodan Mitrovic; Yasamin Nazari (SPAA, 2021)

Hop-constrained oblivious routing. - Mohsen Ghaffari 001; Bernhard Haeupler; Goran Zuzic (STOC, 2021)

Improved distributed Δ-coloring. - Mohsen Ghaffari 001; Juho Hirvonen; Fabian Kuhn; Yannic Maus (Distributed Comput., 2021)

Local Computation of Maximal Independent Set. - Mohsen Ghaffari 001 (FOCS, 2022)

Universally-Optimal Distributed Exact Min-Cut. - Mohsen Ghaffari 001; Goran Zuzic (PODC, 2022)

Massively Parallel Algorithms for b-Matching. - Mohsen Ghaffari 001; Christoph Grunau; Slobodan Mitrovic (SPAA, 2022)

Average Awake Complexity of MIS and Matching. - Mohsen Ghaffari 001; Julian Portmann (SPAA, 2022)

Deterministic Distributed Sparse and Ultra-Sparse Spanners and Connectivity Certificates. - Marcel Bezdrighin; Michael Elkin; Mohsen Ghaffari 001; Christoph Grunau; Bernhard Haeupler; Saeed Ilchi; Václav Rozhon (SPAA, 2022)

Hop-constrained expander decompositions, oblivious routing, and distributed universal optimality. - Bernhard Haeupler; Harald Räcke; Mohsen Ghaffari 001 (STOC, 2022)

A Nearly Time-Optimal Distributed Approximation of Minimum Cost k-Edge-Connected Spanning Subgraph. - Michal Dory; Mohsen Ghaffari 001 (CoRR, 2022)

Work-Efficient Parallel Derandomization I: Chernoff-like Concentrations via Pairwise Independence. - Mohsen Ghaffari 001; Christoph Grunau; Václav Rozhon (FOCS, 2023)

Distributed MIS with Low Energy and Time Complexities. - Mohsen Ghaffari 001; Julian Portmann (PODC, 2023)

A Near-Optimal Deterministic Distributed Synchronizer. - Mohsen Ghaffari 001; Anton Trygub (PODC, 2023)

Improved Distributed Network Decomposition, Hitting Sets, and Spanners, via Derandomization. - Mohsen Ghaffari 001; Christoph Grunau; Bernhard Haeupler; Saeed Ilchi; Václav Rozhon (SODA, 2023)

A Nearly Time-Optimal Distributed Approximation of Minimum Cost k-Edge-Connected Spanning Subgraph. - Michal Dory; Mohsen Ghaffari 001 (SODA, 2023)

Local Distributed Rounding: Generalized to MIS, Matching, Set Cover, and Beyond. - Salwa Faour; Mohsen Ghaffari 001; Christoph Grunau; Fabian Kuhn; Václav Rozhon (SODA, 2023)

Nearly Work-Efficient Parallel DFS in Undirected Graphs. - Mohsen Ghaffari 001; Christoph Grunau; Jiahao Qu (SPAA, 2023)

Coloring Fast with Broadcasts. - Maxime Flin; Mohsen Ghaffari 001; Magnús M. Halldórsson; Fabian Kuhn; Alexandre Nolin (SPAA, 2023)

Faster Deterministic Distributed MIS and Approximate Matching. - Mohsen Ghaffari 001; Christoph Grunau (STOC, 2023)

Node and edge averaged complexities of local graph problems. - Alkida Balliu; Mohsen Ghaffari 001; Fabian Kuhn; Dennis Olivetti (Distributed Comput., 2023)

Near-Optimal Deterministic Network Decomposition and Ruling Set, and Improved MIS. - Mohsen Ghaffari 001; Christoph Grunau (FOCS, 2024)

A Near-Optimal Low-Energy Deterministic Distributed SSSP with Ramifications on Congestion and APSP. - Mohsen Ghaffari 001; Anton Trygub (PODC, 2024)

A Distributed Palette Sparsification Theorem. - Maxime Flin; Mohsen Ghaffari 001; Magnús M. Halldórsson; Fabian Kuhn; Alexandre Nolin (SODA, 2024)

Parallel Dynamic Maximal Matching. - Mohsen Ghaffari 001; Anton Trygub (SPAA, 2024)

Fast Broadcast in Highly Connected Networks. - Shashwat Chandra; Yi-Jun Chang; Michal Dory; Mohsen Ghaffari 001; Dean Leitersdorf (SPAA, 2024)

Dynamic O(Arboricity) Coloring in Polylogarithmic Worst-Case Time. - Mohsen Ghaffari 001; Christoph Grunau (STOC, 2024)

Work-Efficient Parallel Derandomization II: Optimal Concentrations via Bootstrapping. - Mohsen Ghaffari 001; Christoph Grunau (STOC, 2024)

Lenzen's Distributed Routing Generalized: A Full Characterization of Constant-Time Routability. - Mohsen Ghaffari 001; Brandon Wang (STOC, 2024)

Decentralized Low-Stretch Trees via Low Diameter Graph Decompositions. - Ruben Becker; Yuval Emek; Mohsen Ghaffari 001; Christoph Lenzen 001 (SIAM J. Comput., 2024)

Near-optimal distributed dominating set in bounded arboricity graphs. - Michal Dory; Mohsen Ghaffari 001; Saeed Ilchi (Distributed Comput., 2024)

Shared Randomness Helps with Local Distributed Problems. - Alkida Balliu; Mohsen Ghaffari 001; Fabian Kuhn; Augusto Modanese; Dennis Olivetti; Mikaël Rabie; Jukka Suomela; Jara Uitto (ICALP, 2025)

Fully Scalable MPC Algorithms for Euclidean k-Center. - Artur Czumaj; Guichen Gao; Mohsen Ghaffari 001; Shaofeng H.-C. Jiang (ICALP, 2025)

Density-Dependent Graph Orientation and Coloring in Scalable MPC. - Mohsen Ghaffari 001; Christoph Grunau (PODC, 2025)

A Cut-Matching Game for Constant-Hop Expanders. - Bernhard Haeupler; Jonas Hübotter; Mohsen Ghaffari 001 (SODA, 2025)

Parallel Batch-Dynamic Coreness Decomposition with Worst-Case Guarantees. - Mohsen Ghaffari 001; Jaehyun Koo (SPAA, 2025)

Parallel Batch-Dynamic Algorithms for Spanners, and Extensions. - Mohsen Ghaffari 001; Jaehyun Koo (SPAA, 2025)

Towards True Work-Efficiency in Parallel Derandomization: MIS, Maximal Matching, and Hitting Set. - Mohsen Ghaffari 001; Christoph Grunau (CoRR, 2025)