Conference Publications:
- Amartya Shankha Biswas, Michal Dory, Mohsen Ghaffari, Slobodan Mitrovic, Yasamin Nazari. Massively Parallel Algorithms for Distance Approximation and Spanners. SPAA 2021.
- Michal Dory, Yuval Efron, Sagnik Mukhopadhyay, Danupon Nanongkai.
Distributed Weighted Min-Cut in Nearly-Optimal Time. STOC 2021. - Magnu ́s M. Halldo ́rsson, Tigran Tonoyan.
Sparse Backbone and Optimal Distributed SINR Algorithms. TALG 2021. - Magnu ́s M. Halldo ́rsson, Tigran Tonoyan.
Effective Wireless Scheduling via Hypergraph Sketches. SICOMP 2021. - Jokull S. Gylfason, Bernhard L. Hilmarsson, Tigran Tonoyan.
Unimodal Eccentricity in Trees. Networks 2021 - Ívar Marrow Arnþórsson, Steven Chaplick, Jökull Snær Gylfason, Magnús M. Halldórsson, Jökull Máni Reynisson, Tigran Tonoyan.
Generalized Disk Graphs. WADS 2021. - Magnús M. Halldórsson, Fabian Kuhn, Yannic Maus, Tigran Tonoyan.
Efficient randomized distributed coloring in CONGEST. STOC 2021. - Yannic Maus.
Distributed Graph Coloring Made Easy. SPAA 2021. - Fabien Dufoulon, Shay Kutten, William K. Moses Jr.
Efficient Deterministic Leader Election for Programmable Matter. PODC 2021. - Michal Dory, Orr Fischer, Seri Khoury, Dean Leitersdorf.
Constant-Round Spanners and Shortest Paths in Congested Clique and MPC. PODC 2021. - Magnús M. Halldórsson, Fabian Kuhn, Yannic Maus, and Alexandre Nolin.
Coloring Fast Without Learning Your Neighbors’ Colors. DISC 2020. - Yannic Maus and Tigran Tonoyan.
Local Conflict Coloring Revisited: Linial for Lists. DISC 2020. - Alkida Balliu, Sebastian Brandt, Yuval Efron, Juho Hirvonen, Yannic Maus, Dennis Olivetti, Jukka Suomela.
Classification of Distributed Binary Labeling Problems. DISC 2020. - Christian Konrad and Tigran Tonoyan.
Guessing Fractions of Online Sequences. Discrete Applied Math. - Steven Chaplick, Magnús M. Halldórsson, Murilo de Lima and Tigran Tonoyan.
Query Minimization under Stochastic Uncertainty. LATIN 2020. - Philipp Bamberger, Fabian Kuhn, and Yannic Maus.
Efficient Deterministic Distributed Coloring with Small Bandwidth. PODC 2020. - Magnus M. Halldorsson, Fabian Kuhn, and Yannic Maus.
Distance-2 Coloring in the CONGEST model. PODC 2020. - Yuval Efron, Ofer Grossman, Seri Khoury.
Beyond Alice and Bob: Improved Inapproximability for Maximum Independent Set in CONGEST. PODC 2020. - Michal Dory and Merav Parter.
Exponentially Faster Shortest Paths in the Congested Clique. PODC 2020.
Best Paper Award. - Michal Dory and Mohsen Ghaffari.
Improved Distributed Approximations for Minimum-Weight Two-Edge-Connected Spanning Subgraph. PODC 2019. - Michal Dory.
Distributed Approximation of Minimum $k$-edge-connected Spanning Subgraphs. PODC 2018. - Ami Paz and Gregory Schwartzman.
A $(2+\epsilon)$-Approximation for Maximum Weight Matching in the Semi-Streaming Model. SODA 2017.
Best Student Paper Award and Best Paper Award.