keerti choudhary iitd - Yahoo India Search Results

Search results

web.iitd.ac.in › ~keertiKeerti Choudhary - IIT Delhi

web.iitd.ac.in › ~keerti
- Cached
Keerti Choudhary. I am an assistant professor in the Computer Science and Engineering department at IIT Delhi. Prior to that, I was a post-doctoral fellow at Tel Aviv University, and Weizmann Institute of Science.
- Contact
  Office Bharti 416 Department of Computer Science and...
- Home
  Keerti Choudhary. I am an assistant professor in the...
- Courses
  Courses. 2024-25 (Sem I) : Algorithmic Graph Theory (COL...
- Publications
  Budgeted Dominating Sets in Uncertain Graphs with Avi Cohen,...
- Talks
  New Extremal bounds for Reachability and Strong-Connectivity...
- COL106: Data Structures and Algorithms
  Instructors: Huzur Saran and Keerti Choudhary. Lectures:...
- COL351
  Course Information. Instructor: Keerti Choudhary. Lecture...
- COL751: Algorithmic Graph Theory
  Instructor: Keerti Choudhary. Lectures: Mon, Thurs...
web.iitd.ac.in › ~keerti › coursesKeerti Choudhary - IIT Delhi

web.iitd.ac.in › ~keerti › courses
- Cached
Courses. 2024-25 (Sem I) : Algorithmic Graph Theory (COL 751) 2023-24 (Sem II) : Analysis and Design of Algorithms (COL 351) 2023-24 (Sem I) : Algorithmic Graph Theory (COL 751) 2022-23 (Sem II) : Data Structures and Algorithms (COL 106)
Images
View all

web.iitd.ac.in › ~keerti › researchKeerti Choudhary - IIT Delhi

web.iitd.ac.in › ~keerti › research

Cached

Uncretain Graphs
Extremal Graph Structures
Graph Realizability
Fault Tolerant Structures
Dynamic Algorithms
Combinatorics

Budgeted Dominating Sets in Uncertain Graphswith Avi Cohen, N. S. Narayanaswamy, David Peleg, R. Vijayaragunathan MFCS 2021 – Mathematical Foundations of Computer Science

See full list on web.iitd.ac.in

Extremal Distances in Directed graphs: Tight Spanners and Near-Optimal Approximation Algorithmswith Omer Gold SODA 2020 – Symposium on Discrete Algorithms

See full list on web.iitd.ac.in

Minimum Neighboring Degree Realization in Graphs and Treeswith Amotz Bar-Noy, Avi Cohen, David Peleg, Dror Rawitz ESA 2020 – European Symposium on Algorithms

Graph Realizations: Maximum Degree in Vertex Neighbourhoodswith Amotz Bar-Noy, David Peleg, Dror Rawitz SWAT 2020 – Scandinavian Symposium and Workshops on Algorithm Theory

Distributed Graph Realizationswith John Augustine, Avi Cohen, David Peleg, Sumathi Sivasubramaniam, Suman Sourav IPDPS 2020 – International Parallel and Distributed Processing Symposium

Efficiently Realizing Interval Sequenceswith Amotz Bar-Noy, David Peleg, Dror Rawitz ISAAC 2019 – International Symposium on Algorithms and Computation SIAM Journal on Discrete Mathematics (SIDMA)...

See full list on web.iitd.ac.in

New Fault Tolerant Subset Preserverswith Greg Bodwin, Merav Parter, and Noa Shahar ICALP 2020 – International Colloquium on Automata, Languages, and Programming

New Extremal bounds for Reachability and Strong-Connectivity Preservers under failureswith Diptarka Chakraborty ICALP 2020 – International Colloquium on Automata, Languages, and Programming

On single source fault tolerant approximate shortest pathwith Surender Baswana, Moazzam Hussain, Liam Roditty SODA 2018 – Symposium on Discrete Algorithms ACM Transactions on Algorithms (TALG) 2020

Space Optimal Maintenance of Single Source Replacement Pathswith Davide Bilo, Luciano Guala, Stefano Leucci, Merav Parter, Guido Proietti STACS 2018 – Symposium on Theoretical Aspects of Computer S...

See full list on web.iitd.ac.in

Dynamic DFS tree in undirected graphs: breaking the O(m) barrierwith Surender Baswana, Shreejit Ray Chaudhury, Shahbaz Khan SODA 2016 – Symposium on Discrete Algorithms SIAM Journal on Computing (S...