Daniel Paul-Pena

According to our database, Daniel Paul-Pena authored at least 5 papers between 2023 and 2025.

Collaborative distances:

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

2025

A Dichotomy Hierarchy for Linear Time Subgraph Counting in Bounded Degeneracy Graphs.

Daniel Paul-Pena, C. Seshadhri

Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, 2025

2024

Subgraph Counting in Subquadratic Time for Bounded Degeneracy Graphs.

Daniel Paul-Pena, C. Seshadhri

CoRR, 2024

A Dichotomy Theorem for Linear Time Homomorphism Orbit Counting in Bounded Degeneracy Graphs.

Daniel Paul-Pena, C. Seshadhri

Proceedings of the 35th International Symposium on Algorithms and Computation, 2024

Covering a Graph with Dense Subgraph Families, via Triangle-Rich Sets.

Sabyasachi Basu, Daniel Paul-Pena, Kun Qian, C. Seshadhri, Edward W. Huang, Karthik Subbian

Proceedings of the 33rd ACM International Conference on Information and Knowledge Management, 2024

2023

A Dichotomy Hierarchy Characterizing Linear Time Subgraph Counting in Bounded Degeneracy Graphs.

Daniel Paul-Pena, C. Seshadhri

CoRR, 2023