| No. |
Title |
Author |
Year |
| 1 |
Optimal Bounds for Dominating Set in Graph Streams |
Khanna, Sanjeev et al. |
2022 |
| 2 |
On Two-Pass Streaming Algorithms for Maximum Bipartite Matching |
Konrad, Christian et al. |
2021 |
| 3 |
Constructing Large Matchings via Query Access to a Maximal Matching Oracle |
Khalil, Lidiya Khalidah binti et al. |
2020 |
| 4 |
Optimal Lower Bounds for Matching and Vertex Cover in Dynamic Graph Streams |
Dark, Jacques et al. |
2020 |
| 5 |
Distributed Minimum Vertex Coloring and Maximum Independent Set in Chordal Graphs |
Konrad, Christian et al. |
2019 |
| 6 |
Independent Sets in Vertex-Arrival Streams |
Cormode, Graham et al. |
2019 |
| 7 |
The Complexity of Symmetry Breaking in Massive Graphs |
Konrad, Christian et al. |
2019 |
| 8 |
A Simple Augmentation Method for Matchings with Applications to Streaming Algorithms |
Konrad, Christian |
2018 |
| 9 |
Detecting Cliques in CONGEST Networks |
Czumaj, Artur et al. |
2018 |
| 10 |
On the Power of Advice and Randomization for Online Bipartite Matching |
Dürr, Christoph et al. |
2016 |
| 11 |
Streaming Partitioning of Sequences and Trees |
Konrad, Christian |
2016 |
| 12 |
The Densest k-Subhypergraph Problem |
Chlamtac, Eden et al. |
2016 |
