Ronak Bhadra

Orcid: 0009-0009-2309-3944

According to our database1, Ronak Bhadra authored at least 4 papers between 2024 and 2026.

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

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

On csauthors.net:

Bibliography

2026
Reachability in graphs having linear 2-arboricity two is NL-hard.
Inf. Process. Lett., 2026

2025
Trading Determinism for Time: The k-Reach Problem.
Proceedings of the XIII Latin-American Algorithms, Graphs and Optimization Symposium, 2025

Inductive Tracing and the Complexity of Finding Hamiltonian Path in DAGs.
Proceedings of the Fundamentals of Computation Theory - 25th International Symposium, 2025

2024
Deciding Reachability in a Directed Graph given its Path Decomposition.
CoRR, 2024


  Loading...