| Publication | Date of Publication | Type |
|---|
| An unconditional lower bound for two-pass streaming algorithms for maximum matching approximation | 2024-11-28 | Paper |
| Improved weighted matching in the sliding window model | 2024-10-08 | Paper |
| Maximum matching via maximal matching queries | 2024-10-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6126337 | 2024-04-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6090893 | 2023-11-20 | Paper |
| The complexity of symmetry breaking in massive graphs | 2023-02-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5090906 | 2022-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5091196 | 2022-07-21 | Paper |
| Distributed Minimum Vertex Coloring and Maximum Independent Set in Chordal Graphs | 2022-07-21 | Paper |
| Optimal lower bounds for matching and vertex cover in dynamic graph streams | 2022-07-21 | Paper |
| Distributed minimum vertex coloring and maximum independent set in chordal graphs | 2022-06-13 | Paper |
| Guessing fractions of online sequences | 2022-01-05 | Paper |
| A simple augmentation method for matchings with applications to streaming algorithms | 2021-08-04 | Paper |
| Streaming Set Cover in Practice | 2021-01-27 | Paper |
| Detecting cliques in CONGEST networks | 2021-01-22 | Paper |
| Radio aggregation scheduling | 2020-09-17 | Paper |
| Limitations of current wireless link scheduling algorithms | 2020-09-17 | Paper |
| Improved distributed algorithms for coloring interval graphs with application to multicoloring trees | 2020-02-13 | Paper |
| Improved Massively Parallel Computation Algorithms for MIS, Matching, and Vertex Cover | 2019-09-19 | Paper |
| Brief Announcement | 2019-09-19 | Paper |
| The triangle scheduling problem | 2018-11-07 | Paper |
| Approximating Semi-matchings in Streaming and in Two-Party Communication | 2018-11-05 | Paper |
| Distributed large independent sets in one round on bounded-independence graphs | 2018-08-24 | Paper |
| Approximating the Caro-Wei bound for independent sets in graph streams | 2018-08-17 | Paper |
| Preemptively guessing the center | 2018-08-17 | Paper |
| The Densest $k$-Subhypergraph Problem | 2018-07-18 | Paper |
| The Densest k-Subhypergraph Problem | 2018-04-19 | Paper |
| Improved distributed algorithms for coloring interval graphs with application to multicoloring trees | 2018-04-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4606307 | 2018-03-02 | Paper |
| Computing large independent sets in a single round | 2018-02-23 | Paper |
| Brief Announcement | 2017-09-29 | Paper |
| Streaming Partitioning of Sequences and Trees | 2017-07-14 | Paper |
| The minimum vulnerability problem on specific graph classes | 2016-11-29 | Paper |
| Maximum Matching in Turnstile Streams | 2015-11-19 | Paper |
| The Minimum Vulnerability Problem on Graphs | 2015-09-11 | Paper |
| Validating XML documents in the streaming model with external memory | 2015-09-03 | Paper |
| Distributed Algorithms for Coloring Interval Graphs | 2015-02-10 | Paper |
| Approximating Semi-matchings in Streaming and in Two-Party Communication | 2013-08-06 | Paper |
| Maximum Matching in Semi-streaming with Few Passes | 2012-11-02 | Paper |
| Two-constraint domain decomposition with space filling curves | 2011-07-14 | Paper |
