Theodore Pan — accepted AI-conference papers

2025

New Parallel and Streaming Algorithms for Directed Densest Subgraph

Slobodan Mitrović, Theodore Pan, Mahdi Qaempanah, Mohammad Amin Raeisi

NeurIPS 2025poster

Finding dense subgraphs is a fundamental problem with applications to community detection, clustering, and data mining. Our work focuses on finding approximate densest subgraphs in directed graphs in computational models for processing massive data. We consider two such models: Massively Parallel Co…

Cited by 0 Source ↗Scholar ↗

2024

Faster Streaming and Scalable Algorithms for Finding Directed Dense Subgraphs in Large Graphs

Slobodan Mitrovic, Theodore Pan

ICML 2024poster

Finding dense subgraphs is a fundamental algorithmic tool in data mining, community detection, and clustering. In this problem, the aim is to find an induced subgraph whose edge-to-vertex ratio is maximized. We show how to find a $(2+\epsilon)$ approximation of the directed densest subgraph on rando…

Cited by 0 Source ↗PDF ↗Scholar ↗