| No. |
Title |
Author |
Year |
| 1 |
Incremental SCC Maintenance in Sparse Graphs |
Bernstein, Aaron et al. |
2021 |
| 2 |
Non-Mergeable Sketching for Cardinality Estimation |
Pettie, Seth et al. |
2021 |
| 3 |
The Structure of Minimum Vertex Cuts |
Pettie, Seth et al. |
2021 |
| 4 |
Wake up and Join Me! an Energy-Efficient Algorithm for Maximal Matching in Radio Networks |
Dani, Varsha et al. |
2021 |
| 5 |
Fine-grained Lower Bounds on Cops and Robbers |
Brandt, Sebastian et al. |
2018 |
| 6 |
Improved Bounds for Multipass Pairing Heaps and Path-Balanced Binary Search Trees |
Dorfman, Dani et al. |
2018 |
| 7 |
Lower Bounds on Sparse Spanners, Emulators, and Diameter-reducing shortcuts |
Huang, Shang-En et al. |
2018 |
| 8 |
Simple Contention Resolution via Multiplicative Weight Updates |
Chang, Yi-Jun et al. |
2018 |
| 9 |
Simultaneously Load Balancing for Every p-norm, With Reassignments |
Bernstein, Aaron et al. |
2017 |
| 10 |
Structure and Hardness in P (Dagstuhl Seminar 16451) |
Lewenstein, Moshe et al. |
2017 |
| 11 |
Faster Worst Case Deterministic Dynamic Connectivity |
Kejlberg-Rasmussen, Casper et al. |
2016 |
| 12 |
Mind the Gap: Essentially Optimal Algorithms for Online Dictionary Matching with One Gap |
Amir, Amihood et al. |
2016 |
| 13 |
Sources of Superlinearity in Davenport-Schinzel Sequences |
Pettie, Seth |
2008 |
| 14 |
Towards a Final Analysis of Pairing Heaps |
Pettie, Seth |
2006 |
