| Publication | Date of Publication | Type |
|---|
| Streaming maximal matching with bounded deletions | 2026-09-29 | Paper |
| Constructing long paths in graph streams | 2026-08-31 | Paper |
| Matchings in low-arboricity graphs in the dynamic graph stream model | 2026-06-12 | Paper |
| Interval selection in sliding windows | 2026-05-26 | Paper |
| Constructing large matchings via query access to a maximal matching oracle | 2026-03-23 | Paper |
| Interval selection in data streams: weighted intervals and the insertion-deletion setting | 2025-07-28 | Paper |
| 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 |
| scientific article; zbMATH DE number 7829325 (Why is no real title available?) | 2024-04-09 | Paper |
scientific article; zbMATH DE number 7768364 (Why is no real title available?)
(available as arXiv preprint) | 2023-11-20 | Paper |
| The complexity of symmetry breaking in massive graphs | 2023-02-03 | Paper |
| Detecting cliques in CONGEST networks | 2022-07-21 | Paper |
Independent sets in vertex-arrival streams
(available as arXiv preprint) | 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
(available as arXiv preprint) | 2022-07-21 | Paper |
Distributed minimum vertex coloring and maximum independent set in chordal graphs
Theoretical Computer Science | 2022-06-13 | Paper |
Guessing fractions of online sequences
Discrete Applied Mathematics | 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 Proceedings of the Workshop on Algorithm Engineering and Experiments (ALENEX) | 2021-01-27 | Paper |
Detecting cliques in CONGEST networks
Distributed Computing | 2021-01-22 | Paper |
Radio aggregation scheduling
Theoretical Computer Science | 2020-09-17 | Paper |
Limitations of current wireless link scheduling algorithms
Theoretical Computer Science | 2020-09-17 | Paper |
Improved distributed algorithms for coloring interval graphs with application to multicoloring trees
Theoretical Computer Science | 2020-02-13 | Paper |
Improved massively parallel computation algorithms for MIS, matching, and vertex cover
Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing | 2019-09-19 | Paper |
Brief announcement: Distributed minimum vertex coloring and maximum independent set in chordal graphs
Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing | 2019-09-19 | Paper |
The triangle scheduling problem
Journal of Scheduling | 2018-11-07 | Paper |
The triangle scheduling problem
Journal of Scheduling | 2018-11-07 | Paper |
Approximating semi-matchings in streaming and in two-party communication
ACM Transactions on Algorithms | 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
SIAM Journal on Discrete Mathematics | 2018-07-18 | Paper |
The densest \(k\)-subhypergraph problem
(available as arXiv preprint) | 2018-04-19 | Paper |
Improved distributed algorithms for coloring interval graphs with application to multicoloring trees
Structural Information and Communication Complexity | 2018-04-12 | Paper |
On the power of advice and randomization for online bipartite matching
(available as arXiv preprint) | 2018-03-02 | Paper |
Computing large independent sets in a single round
Distributed Computing | 2018-02-23 | Paper |
Brief Announcement
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing | 2017-09-29 | Paper |
| Streaming partitioning of sequences and trees | 2017-07-14 | Paper |
The minimum vulnerability problem on specific graph classes
Journal of Combinatorial Optimization | 2016-11-29 | Paper |
Maximum matching in turnstile streams
Algorithms - ESA 2015 | 2015-11-19 | Paper |
The minimum vulnerability problem on graphs
Combinatorial Optimization and Applications | 2015-09-11 | Paper |
Validating XML documents in the streaming model with external memory
ACM Transactions on Database Systems | 2015-09-03 | Paper |
Distributed algorithms for coloring interval graphs
Lecture Notes in Computer Science | 2015-02-10 | Paper |
Approximating semi-matchings in streaming and in two-party communication
Lecture Notes in Computer Science | 2013-08-06 | Paper |
Maximum matching in semi-streaming with few passes
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2012-11-02 | Paper |
Two-constraint domain decomposition with space filling curves
Parallel Computing | 2011-07-14 | Paper |
