← authors · overview

• Predicting Signed Edges with $O(n^1+o(1) łogn)$ Queries
  2016
• Scalable Betweenness Centrality Maximization via Sampling
  2016
• Predicting Positive and Negative Links with Noisy Queries: Theory & Practice
  2017
• Risk-Averse Matchings over Uncertain Graph Databases
  2018
• Opinion Dynamics with Varying Susceptibility to Persuasion
  2018
• Node Embeddings and Exact Low-Rank Representations of Complex Networks
  2020
• Finding Densest $k$-Connected Subgraphs
  2020
• Dense and well-connected subgraph detection in dual networks
  2021
• Densest Diverse Subgraphs: How to Plan a Successful Cocktail Party with Diversity
  2023
• A Note on Computing Betweenness Centrality from the 2-core
  2024
• Q-DISCO: Query-Centric Densest Subgraphs in Networks with Opinion Information
  2024
• Parallel Motif-Based Community Detection
  2024