| No. |
Title |
Author |
Year |
| 1 |
Adaptive Massively Parallel Constant-Round Tree Contraction |
Hajiaghayi, MohammadTaghi et al. |
2022 |
| 2 |
Streaming and Small Space Approximation Algorithms for Edit Distance and Longest Common Subsequence |
Cheng, Kuan et al. |
2021 |
| 3 |
Brief Announcement: Streaming and Massively Parallel Algorithms for Edge Coloring |
Behnezhad, Soheil et al. |
2019 |
| 4 |
Streaming and Massively Parallel Algorithms for Edge Coloring |
Behnezhad, Soheil et al. |
2019 |
| 5 |
Brief Announcement: MapReduce Algorithms for Massive Trees |
Bateni, MohammadHossein et al. |
2018 |
| 6 |
Greedy Algorithms for Online Survivable Network Design |
Dehghani, Sina et al. |
2018 |
| 7 |
Stochastic k-Server: How Should Uber Work? |
Dehghani, Sina et al. |
2017 |
| 8 |
Beating Ratio 0.5 for Weighted Oblivious Matching Problems |
Abolhassani, Melika et al. |
2016 |
| 9 |
Bidimensional Structures: Algorithms, Combinatorics and Logic (Dagstuhl Seminar 13121) |
Demaine, Erik D. et al. |
2013 |
| 10 |
09511 Abstracts Collection -- Parameterized complexity and approximation algorithms |
Demaine, Erik D. et al. |
2010 |
| 11 |
09511 Executive Summary -- Parameterized complexity and approximation algorithms |
Demaine, Erik D. et al. |
2010 |
| 12 |
09511 Open Problems -- Parameterized complexity and approximation algorithms |
Demaine, Erik D. et al. |
2010 |
| 13 |
The Price of Anarchy in Cooperative Network Creation Games |
Demaine, Erik D. et al. |
2009 |
