Keerti Choudhary

Orcid: 0000-0002-8289-5930

According to our database1, Keerti Choudhary authored at least 32 papers between 2013 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Graph realizations: Maximum degree in vertex neighborhoods.
Discret. Math., September, 2023

Improved Approximate Distance Oracles: Bypassing the Thorup-Zwick Bound in Dense Graphs.
CoRR, 2023

Compact Distance Oracles with Large Sensitivity and Low Stretch.
Proceedings of the Algorithms and Data Structures - 18th International Symposium, 2023

Approximate Distance Sensitivity Oracles in Subquadratic Space.
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

Fault-Tolerant ST-Diameter Oracles.
Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

2022
Distributed Graph Realizations.
IEEE Trans. Parallel Distributed Syst., 2022

Fixed-Parameter Sensitivity Oracles.
Proceedings of the 13th Innovations in Theoretical Computer Science Conference, 2022

Pairwise Reachability Oracles and Preservers Under Failures.
Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

Deterministic Sensitivity Oracles for Diameter, Eccentricities and All Pairs Distances.
Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

2021
Budgeted Dominating Sets in Uncertain Graphs.
Proceedings of the 46th International Symposium on Mathematical Foundations of Computer Science, 2021

2020
Approximate Single-Source Fault Tolerant Shortest Path.
ACM Trans. Algorithms, 2020

Efficiently Realizing Interval Sequences.
SIAM J. Discret. Math., 2020

Extremal Distances in Directed Graphs: Tight Spanners and Near-Optimal Approximation Algorithms.
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

New Extremal Bounds for Reachability and Strong-Connectivity Preservers Under Failures.
Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

New Fault Tolerant Subset Preservers.
Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

Minimum Neighboring Degree Realization in Graphs and Trees.
Proceedings of the 28th Annual European Symposium on Algorithms, 2020

2019
Dynamic DFS in Undirected Graphs: Breaking the O(m) Barrier.
SIAM J. Comput., 2019

Graph Realizations: Maximum and Minimum Degree in Vertex Neighborhoods.
CoRR, 2019

An Efficient Strongly Connected Components Algorithm in the Fault Tolerant Model.
Algorithmica, 2019

Graph Profile Realizations and Applications to Social Networks.
Proceedings of the WALCOM: Algorithms and Computation - 13th International Conference, 2019

2018
Fault-Tolerant Subgraph for Single-Source Reachability: General and Optimal.
SIAM J. Comput., 2018

Diameter Spanner, Eccentricity Spanner, and Approximating Extremal Graph Distances: Static, Dynamic, and Fault Tolerant.
CoRR, 2018

Efficient Oracles and Routing Schemes for Replacement Paths.
Proceedings of the 35th Symposium on Theoretical Aspects of Computer Science, 2018

Realizability of Graph Specifications: Characterizations and Algorithms.
Proceedings of the Structural Information and Communication Complexity, 2018

2016
Fault tolerant subgraph for single source reachability: generic and optimal.
Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, 2016

Dynamic DFS in Undirected Graphs: breaking the O(<i>m</i>) barrier.
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

An Optimal Dual Fault Tolerant Reachability Oracle.
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

2015
Integer domination of Cartesian product graphs.
Discret. Math., 2015

Dynamic DFS Tree in Undirected Graphs: breaking the O(m) barrier.
CoRR, 2015

Fault Tolerant Reachability for Directed Graphs.
Proceedings of the Distributed Computing - 29th International Symposium, 2015

On Dynamic DFS Tree in Directed Graphs.
Proceedings of the Mathematical Foundations of Computer Science 2015, 2015

2013
A Note on Total and Paired Domination of Cartesian Product Graphs.
Electron. J. Comb., 2013


  Loading...