PPaperPicks

Aritra Konar

3 papers at tracked venues · 3 at CORE A* · active 20242026

Venues

Frequent coauthors

Papers

  1. A Scalable and Exact Relaxation for Densest k-Subgraph via Error Bounds
  2. Densest k-Subgraph Mining via a Provably Tight Relaxation
  3. Optimal Quasi-clique: Hardness, Equivalence with Densest-k-Subgraph, and Quasi-partitioned Community Mining
    AAAI 2024 · Aritra Konar