| No. | Title | Author | Year |
|---|---|---|---|
| 1 | TSP in a Simple Polygon | Alkema, Henk et al. | 2022 |
| 2 | Clique-Based Separators for Geometric Intersection Graphs | de Berg, Mark et al. | 2021 |
| 3 | k-Center Clustering with Outliers in the Sliding-Window Model | de Berg, Mark et al. | 2021 |
| 4 | Maximum-Weight Matching in Sliding Windows and Beyond | Biabani, Leyla et al. | 2021 |
| 5 | Testable Bounded Degree Graph Properties Are Random Order Streamable | Monemizadeh, Morteza et al. | 2017 |
| 6 | The Sparse Awakens: Streaming Algorithms for Matching Size Estimation in Sparse Graphs | Cormode, Graham et al. | 2017 |
| 7 | Clustering on Sliding Windows in Polylogarithmic Space | Braverman, Vladimir et al. | 2015 |
| Current Page : | |
| Number of result pages: | 1 |
| Number of documents: | 7 |