Noujan Pashanasangi

According to our database, Noujan Pashanasangi authored at least 5 papers between 2020 and 2021.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2021

The Role of Degeneracy in Real-World Subgraph Counting.

Noujan Pashanasangi

PhD thesis, 2021

Near-Linear Time Homomorphism Counting in Bounded Degeneracy Graphs: The Barrier of Long Induced Cycles.

Suman K. Bera, Noujan Pashanasangi, C. Seshadhri

Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

Faster and Generalized Temporal Triangle Counting, via Degeneracy Ordering.

Noujan Pashanasangi, C. Seshadhri

Proceedings of the KDD '21: The 27th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2021

2020

Efficiently Counting Vertex Orbits of All 5-vertex Subgraphs, by EVOKE.

Noujan Pashanasangi, C. Seshadhri

Proceedings of the WSDM '20: The Thirteenth ACM International Conference on Web Search and Data Mining, 2020

Linear Time Subgraph Counting, Graph Degeneracy, and the Chasm at Size Six.

Suman K. Bera, Noujan Pashanasangi, C. Seshadhri

Proceedings of the 11th Innovations in Theoretical Computer Science Conference, 2020