Hermitian matrices for clustering directed graphs: insights and applications. with M. Cucuringu, H. Li, and L. Zanetti (AISTATS'20). arXiv version.
Human Motion Parsing by Hierarchical Dynamic Clustering. with Y.Zhang, S.Tang, and H.NeumanN (BMVC'18).
Fully-Dynamic Graph Sparsifiers Against an Adaptive Adversary, with A. Bernstein, J. van den Brand, M. Gutenberg, D. Nanongkai, T. Saranurak, and A. Sidford. arXiv version
Augmenting the Algebraic Connectivity of Graphs, with B. Manghiuc, and P. Peng (ESA'20) arXiv version
Hermitian Laplacians and a Cheeger inequality for the Max-2-Lin problem, with H. Li, and L. Zanetti (ESA'19) arXiv version
Randomized Rumor Spreading: the Effect of the Network Topology. with X.Giménez, K.Panagiotou, and T.Sauerwald (CPC'15). Journal version
Low Randomness Rumor Spreading via Hashing. with G. Giakkoupis, T. Sauerwald, and P. Woelfel (STACS'12). Conference version
Counting Hypergraphs in Data Streams. arXiv version
Counting Arbitrary Subgraphs in Data Streams. with D.Kane, K.Mehlhorn, and T.Sauerwald (ICALP'12). Conference version
Approximate Counting of Cycles in Streams. with M.Manjunath, K.Mehlhorn, and K.Panagiotou (ESA'11) Conference version
Two improved range-efficient algorithms for F0 estimation. with Chung Keung Poon (TCS'09) Journal version | Conference version
A Fast 2-Approximation Algorithm for the Minimum Manhattan Network Problem, with Z.Guo, and H.Zhu (AAIM'08). Conference version