All Stories

  1. Accelerating directed densest subgraph queries with software and hardware approaches

    Article • The VLDB Journal, July 2023, Springer Science + Business Media

    Chenhao Ma

  2. Efficient and Effective Algorithms for Generalized Densest Subgraph Discovery

    Article • Proceedings of the ACM on Management of Data, June 2023, ACM (Association for Computing Machinery)

    Chenhao Ma

  3. On Querying Connected Components in Large Temporal Graphs

    Article • Proceedings of the ACM on Management of Data, June 2023, ACM (Association for Computing Machinery)

    Chenhao Ma

  4. A Convex-Programming Approach for Efficient Directed Densest Subgraph Discovery

    Article • June 2022, ACM (Association for Computing Machinery)

    Chenhao Ma, Laks Lakshmanan, V.S.

  5. On Directed Densest Subgraph Discovery

    Article • ACM Transactions on Database Systems, December 2021, ACM (Association for Computing Machinery)

    Chenhao Ma, Laks Lakshmanan, V.S.

  6. Efficient Directed Densest Subgraph Discovery

    Article • ACM SIGMOD Record, June 2021, ACM (Association for Computing Machinery)

    Chenhao Ma, Laks Lakshmanan, V.S.

  7. On analyzing graphs with motif-paths

    Article • Proceedings of the VLDB Endowment, February 2021, ACM (Association for Computing Machinery)

    Chenhao Ma

  8. Efficient Algorithms for Densest Subgraph Discovery on Large Directed Graphs

    Article • May 2020, ACM (Association for Computing Machinery)

    Laks Lakshmanan, V.S., Chenhao Ma

  9. LINC

    Article • Proceedings of the VLDB Endowment, October 2019, ACM (Association for Computing Machinery)

    Chenhao Ma