1. Stephen Alstrup , Søren Dahlgaard , Arnold Filtser , Morten Stöckel , and Christian Wulff-Nilsen . 2019 . Constructing Light Spanners Deterministically in Near-Linear Time. In 27th Annual European Symposium on Algorithms (ESA 2019). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik. Stephen Alstrup, Søren Dahlgaard, Arnold Filtser, Morten Stöckel, and Christian Wulff-Nilsen. 2019. Constructing Light Spanners Deterministically in Near-Linear Time. In 27th Annual European Symposium on Algorithms (ESA 2019). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik.
2. A simple and linear time randomized algorithm for computing sparse spanners in weighted graphs
3. Massively Parallel Algorithms for Distance Approximation and Spanners
4. Keren Censor-Hillel , Orr Fischer , Tzlil Gonen , François Le Gall , Dean Leitersdorf , and Rotem Oshman . 2020 . Fast Distributed Algorithms for Girth , Cycles and Small Subgraphs. In 34th International Symposium on Distributed Computing (DISC 2020). Schloss Dagstuhl-Leibniz-Zentrum für Informatik. Keren Censor-Hillel, Orr Fischer, Tzlil Gonen, François Le Gall, Dean Leitersdorf, and Rotem Oshman. 2020. Fast Distributed Algorithms for Girth, Cycles and Small Subgraphs. In 34th International Symposium on Distributed Computing (DISC 2020). Schloss Dagstuhl-Leibniz-Zentrum für Informatik.
5. Constant-Round Spanners and Shortest Paths in Congested Clique and MPC