Independent sets in vertex-arrival streams G Cormode, J Dark, C Konrad arXiv preprint arXiv:1807.08331, 2018 | 50 | 2018 |
Optimal lower bounds for matching and vertex cover in dynamic graph streams J Dark, C Konrad arXiv preprint arXiv:2005.11116, 2020 | 25 | 2020 |
Approximating the caro-wei bound for independent sets in graph streams G Cormode, J Dark, C Konrad International Symposium on Combinatorial Optimization, 101-114, 2018 | 14* | 2018 |
Fast Sketch-based Recovery of Correlation Outliers G Cormode, J Dark arXiv preprint arXiv:1710.01985, 2017 | 3 | 2017 |
Interval Selection in Data Streams: Weighted Intervals and the Insertion-Deletion Setting J Dark, A Diddapur, C Konrad 43rd IARCS Annual Conference on Foundations of Software Technology and …, 2023 | 1 | 2023 |
Finding structure in data streams: correlations, independent sets, and matchings J Dark University of Warwick, 2020 | 1 | 2020 |