Chaitanya Nalam

Orcid: 0000-0003-3567-3507

According to our database1, Chaitanya Nalam authored at least 5 papers between 2023 and 2025.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

On csauthors.net:

Bibliography

2025
Deterministic Vertex Connectivity via Common-Neighborhood Clustering and Pseudorandomness.
Proceedings of the 57th Annual ACM Symposium on Theory of Computing, 2025

Finding Small Dijoins in Transitive Closure Time.
Proceedings of the 45th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2025

2023
Deterministic k-Vertex Connectivity in k<sup>2</sup> Max-flows.
CoRR, 2023

Maximal k-Edge-Connected Subgraphs in Weighted Graphs via Local Random Contraction.
CoRR, 2023

Maximal <i>k</i>-Edge-Connected Subgraphs in Weighted Graphs via Local Random Contraction.
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023


  Loading...