PPaperPicks

Nikolaj Tatti

8 papers at tracked venues · 4 at CORE A* · active 20242025

Venues

Frequent coauthors

Papers

  1. Approximating splits for decision trees quickly in sparse data streams
    SDM 2025 · Nikolaj Tatti
  2. Fair Diversity Maximization with Few Representatives
  3. From Your Block to Our Block: How to Find Shared Structure Between Stochastic Block Models over Multiple Graphs
  4. SpeedSteiner: A Fast O(k1/2)-Approximation Algorithm for Directed Steiner Tree
  5. The Densest SWAMP Problem: Subhypergraphs with Arbitrary Monotonic Partial Edge Rewards
  6. Dense Subgraph Discovery Meets Strong Triadic Closure
    SIGKDD 2024 ·
    Chamalee Wickrama Arachchi
  7. Fair Densest Subgraph Across Multiple Graphs
  8. Max-Min Diversification with Asymmetric Distances