18 citations · 169 across the 45 of their papers we have counts for
4 papers · 1 filter
Flowless: Extracting Densest Subgraphs Without Flow Computations
Digvijay Boob, Yu Gao, Richard Peng +4
We propose a simple and computationally efficient method for dense subgraph discovery, which is a classic problem both in theory and in practice. It is well known that dense subgra…
Optimal Learning of Joint Alignments with a Faulty Oracle
Kasper Green Larsen, Michael Mitzenmacher, Charalampos E. Tsourakakis
We consider the following problem, which is useful in applications such as joint image and shape alignment. The goal is to recover discrete variables $g_i \in \{0, \ldots, k-1\…
TwitterMancer: Predicting Interactions on Twitter Accurately
Konstantinos Sotiropoulos, John W. Byers, Polyvios Pratikakis +1
This paper investigates the interplay between different types of user interactions on Twitter, with respect to predicting missing or unseen interactions. For example, given a set o…
Novel Dense Subgraph Discovery Primitives: Risk Aversion and Exclusion Queries
Charalampos E. Tsourakakis, Tianyi Chen, Naonori Kakimura +1
In the densest subgraph problem, given a weighted undirected graph , with non-negative edge weights, we are asked to find a subset of nodes that maximizes…