Diptarka Chakraborty
Orcid: 0000000206875823Affiliations:
 National University of Singapore, School of Computing, Singapore
 Indian Institute of Technology, Kanpur, India (PhD)
According to our database^{1},
Diptarka Chakraborty
authored at least 35 papers
between 2014 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:

on orcid.org
On csauthors.net:
Bibliography
2024
Proceedings of the 2024 ACMSIAM Symposium on Discrete Algorithms, 2024
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2024
2023
Proceedings of the 48th International Symposium on Mathematical Foundations of Computer Science, 2023
Proceedings of the 34th International Symposium on Algorithms and Computation, 2023
Proceedings of the 14th Innovations in Theoretical Computer Science Conference, 2023
Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023
Proceedings of the 43rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2023
2022
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022
Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022
2021
Proceedings of the 2021 ACMSIAM Symposium on Discrete Algorithms, 2021
Proceedings of the 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2021
Proceedings of the 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2021
2020
J. ACM, 2020
New Extremal Bounds for Reachability and StrongConnectivity Preservers Under Failures.
Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020
Proceedings of the Approximation, 2020
2019
Proceedings of the 39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2019
2018
An <i>O</i>(<i>n</i><sup>ε</sup>) Space and Polynomial Time Algorithm for Reachability in Directed Layered Planar Graphs.
ACM Trans. Comput. Theory, 2018
CoRR, 2018
Proceedings of the 16th Scandinavian Symposium and Workshops on Algorithm Theory, 2018
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018
Proceedings of the 26th Annual European Symposium on Algorithms, 2018
2017
CoRR, 2017
CoRR, 2017
Comput., 2017
Proceedings of the Theory and Applications of Models of Computation, 2017
2016
CoRR, 2016
Streaming algorithms for embedding and computing edit distance in the low distance regime.
Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, 2016
2015
An O(n<sup>ε</sup>) Space and Polynomial Time Algorithm for Reachability in Directed Layered Planar Graphs.
Electron. Colloquium Comput. Complex., 2015
Electron. Colloquium Comput. Complex., 2015
CoRR, 2015
Proceedings of the WALCOM: Algorithms and Computation  9th International Workshop, 2015
An O(n^ε ) Space and Polynomial Time Algorithm for Reachability in Directed Layered Planar Graphs.
Proceedings of the Algorithms and Computation  26th International Symposium, 2015
2014
New TimeSpace Upperbounds for Directed Reachability in Highgenus and Hminorfree Graphs.
Electron. Colloquium Comput. Complex., 2014
Electron. Colloquium Comput. Complex., 2014
Electron. Colloquium Comput. Complex., 2014