| Publication | Date of Publication | Type |
|---|
| Clustering with qualitative information | 2026-05-29 | Paper |
| Maximizing quadratic programs: extending Grothendieck's inequality | 2026-05-29 | Paper |
| Improved algorithms for maximum coverage in dynamic and random order streams | 2026-05-26 | Paper |
| Informational complexity and the direct sum problem for simultaneous message complexity | 2026-05-08 | Paper |
Lower bounds for approximate (\& exact) \(k\)-\textsc{Disjoint-Shortest-Paths}
Theoretical Computer Science | 2026-04-16 | Paper |
| Exploiting new properties of string net frequency for efficient computation | 2025-12-02 | Paper |
| Maximum unique coverage on streams: improved FPT approximation scheme and tighter space lower bound | 2025-10-06 | Paper |
| Lower bounds for approximate (\& exact) \(k\)-disjoint-shortest-paths | 2025-06-06 | Paper |
| Maximum coverage in random-arrival streams | 2025-01-06 | Paper |
| Fast parallel algorithms for submodular \(p\)-superseparable maximization | 2024-07-19 | Paper |
| An almost optimal algorithm for unbounded search with noisy information | 2024-05-27 | Paper |
Sublinear-space streaming algorithms for estimating graph parameters on sparse graphs
Lecture Notes in Computer Science | 2024-01-16 | Paper |
| scientific article; zbMATH DE number 7765407 (Why is no real title available?) | 2023-11-14 | Paper |
| Result-Sensitive Binary Search with Noisy Information | 2023-02-03 | Paper |
scientific article; zbMATH DE number 7561398 (Why is no real title available?)
(available as arXiv preprint) | 2022-07-21 | Paper |
Graph Clustering in All Parameter Regimes
(available as arXiv preprint) | 2022-07-18 | Paper |
Metric-Constrained Optimization for Graph Clustering Algorithms
SIAM Journal on Mathematics of Data Science | 2022-02-03 | Paper |
Correlation clustering in data streams
Algorithmica | 2021-06-30 | Paper |
| Precedence-Constrained Min Sum Set Cover | 2020-11-25 | Paper |
Ranking tournaments: local search and a new algorithm
2008 Proceedings of the Tenth Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-11 | Paper |
Incidence geometries and the pass complexity of semi-streaming set cover
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
| On approximating target set selection | 2018-04-19 | Paper |
| scientific article; zbMATH DE number 6297742 (Why is no real title available?) | 2014-05-22 | Paper |
Ranking tournaments, local search and a new algorithm
ACM Journal of Experimental Algorithmics | 2014-04-01 | Paper |
Engineering burstsort, toward fast in-place string sorting
ACM Journal of Experimental Algorithmics | 2014-04-01 | Paper |
Resolving rooted triplet inconsistency by dissolving multigraphs
Lecture Notes in Computer Science | 2013-05-28 | Paper |
The query complexity of estimating weighted averages
Acta Informatica | 2012-03-23 | Paper |
Lock-free parallel dynamic programming
Journal of Parallel and Distributed Computing | 2012-03-07 | Paper |
Asymmetry in \(k\)-center variants
Lecture Notes in Computer Science | 2010-05-26 | Paper |
A Local-Search 2-Approximation for 2-Correlation-Clustering
Algorithms - ESA 2008 | 2008-11-25 | Paper |
| Correlation clustering | 2008-09-25 | Paper |
Asymmetry in \(k\)-center variants
Theoretical Computer Science | 2006-09-14 | Paper |
Clustering with qualitative information
Journal of Computer and System Sciences | 2005-10-10 | Paper |
A Projection Method for Metric-Constrained Optimization
(available as arXiv preprint) | N/A | Paper |
