| Fault-Tolerant Subgraph for Single-Source Reachability: General and Optimal S Baswana, K Choudhary, L Roditty SIAM Journal on Computing 47 (1), 80-95, 2018 | 55 | 2018 |
| Dynamic DFS in Undirected Graphs: Breaking the Barrier S Baswana, SR Chaudhury, K Choudhary, S Khan SIAM Journal on Computing 48 (4), 1335-1363, 2019 | 52 | 2019 |
| Fault tolerant reachability for directed graphs S Baswana, K Choudhary, L Roditty International Symposium on Distributed Computing, 528-543, 2015 | 30 | 2015 |
| An optimal dual fault tolerant reachability oracle K Choudhary 43rd International Colloquium on Automata, Languages, and Programming (ICALP …, 2016 | 23 | 2016 |
| An efficient strongly connected components algorithm in the fault tolerant model S Baswana, K Choudhary, L Roditty Algorithmica 81, 967-985, 2019 | 19 | 2019 |
| Approximate Single-Source Fault Tolerant Shortest Path S Baswana, K Choudhary, M Hussain, L Roditty ACM Transactions on Algorithms (TALG) 16 (4), 1-22, 2020 | 18 | 2020 |
| On dynamic DFS tree in directed graphs S Baswana, K Choudhary Mathematical Foundations of Computer Science 2015: 40th International …, 2015 | 16 | 2015 |
| Distributed graph realizations J Augustine, K Choudhary, A Cohen, D Peleg, S Sivasubramaniam, ... IEEE Transactions on Parallel and Distributed Systems 33 (6), 1321-1337, 2021 | 15 | 2021 |
| New Extremal bounds for Reachability and Strong-Connectivity Preservers under failures D Chakraborty, K Choudhary arXiv preprint arXiv:2004.12890, 2020 | 14 | 2020 |
| Realizability of graph specifications: Characterizations and algorithms A Bar-Noy, K Choudhary, D Peleg, D Rawitz International Colloquium on Structural Information and Communication …, 2018 | 12 | 2018 |
| Efficient oracles and routing schemes for replacement paths D Bilò, K Choudhary, L Gualà, S Leucci, M Parter, G Proietti 35th Symposium on Theoretical Aspects of Computer Science (STACS 2018), 2018 | 12 | 2018 |
| Extremal Distances in Directed Graphs: Tight Spanners and Near-Optimal Approximation Algorithms K Choudhary, O Gold Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 20, 2020 | 11 | 2020 |
| Graph profile realizations and applications to social networks A Bar-Noy, K Choudhary, D Peleg, D Rawitz WALCOM: Algorithms and Computation: 13th International Conference, WALCOM …, 2019 | 9 | 2019 |
| A note on total and paired domination of Cartesian product graphs K Choudhary, S Margulies, IV Hicks the electronic journal of combinatorics 20 (3), P25, 2013 | 9 | 2013 |
| Efficiently Realizing Interval Sequences A Bar-Noy, K Choudhary, D Peleg, D Rawitz 30th International Symposium on Algorithms and Computation (ISAAC 2019), 2019 | 7 | 2019 |
| Graph realizations: maximum degree in vertex neighborhoods A Bar-Noy, K Choudhary, D Peleg, D Rawitz Discrete Mathematics 346 (9), 113483, 2023 | 6 | 2023 |
| Integer domination of Cartesian product graphs K Choudhary, S Margulies, IV Hicks Discrete Mathematics 338 (7), 1239-1242, 2015 | 6 | 2015 |
| Fixed-Parameter Sensitivity Oracles D Bilò, K Casel, K Choudhary, S Cohen, T Friedrich, JA Lagodzinski, ... arXiv preprint arXiv:2112.03059, 2021 | 5 | 2021 |
| Deterministic Sensitivity Oracles for Diameter, Eccentricities and All Pairs Distances D Bilò, K Choudhary, S Cohen, T Friedrich, M Schirneck arXiv preprint arXiv:2204.10679, 2022 | 4 | 2022 |
| Minimum Neighboring Degree Realization in Graphs and Trees A Bar-Noy, K Choudhary, A Cohen, D Peleg, D Rawitz 28th Annual European Symposium on Algorithms (ESA 2020), 2020 | 4 | 2020 |
