Hermitian Laplacians and a Cheeger inequality for the Max-2-Lin problem, with H. Li, and L. Zanetti (ESA'19) arXiv version
Hermitian matrices for clustering directed graphs: insights and applications. with M. Cucuringu, H. Li, and L. Zanetti. arXiv version.
Distributed Graph Clustering and Sparsification. with L. Zanetti. arXiv version. To appear in ACM Transactions on Parallel Computing, 2019
Human Motion Parsing by Hierarchical Dynamic Clustering. with Y.Zhang, S.Tang, and H.NeumanN (BMVC'18).
Distributed Graph Clustering by Load Balancing. with L. Zanetti (SPAA'17). Note: There is a gap in the proof of the paper, which makes the paper's main statement invalid. We presented an improved algorithm with a different proof in the paper "Distributed Graph Clustering and Sparsification".
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