Linear Time Subgraph Counting, Graph Degeneracy, and the Chasm at Size Six. - Suman K. Bera 001; Noujan Pashanasangi; C. Seshadhri 001 (ITCS, 2020)

Efficiently Counting Vertex Orbits of All 5-vertex Subgraphs, by EVOKE. - Noujan Pashanasangi; C. Seshadhri 001 (WSDM, 2020)

Faster and Generalized Temporal Triangle Counting, via Degeneracy Ordering. - Noujan Pashanasangi; C. Seshadhri 001 (KDD, 2021)

Near-Linear Time Homomorphism Counting in Bounded Degeneracy Graphs: The Barrier of Long Induced Cycles. - Suman K. Bera 001; Noujan Pashanasangi; C. Seshadhri 001 (SODA, 2021)

The Role of Degeneracy in Real-World Subgraph Counting. - Noujan Pashanasangi (2021)