Go to content
- {{#headlines}}
- {{title}} {{/headlines}}
Profile
| Academic position | Full Professor |
|---|---|
| Research fields | Theoretical Computer Science |
| Keywords | Graph Algorithms, Data Structures, Incremental, Dynamic Algorithms, Decremental |
Current contact address
| Country | India |
|---|---|
| City | Kanpur |
| Institution | Indian Institute of Technology (IIT) Kanpur |
| Institute | Department of Computer Science and Engineering |
Host during sponsorship
| Prof. Dr. Friedhelm Meyer auf der Heide | Heinz Nixdorf Institut (HNI), Universität Paderborn, Paderborn |
|---|---|
| Start of initial sponsorship | 01/12/2018 |
Programme(s)
| 2017 | Humboldt Research Fellowship Programme for Experienced Researchers |
|---|
Publications (partial selection)
| 2025 | Surender Baswana and Abhyuday Pandey: Connectivity carcass of a vertex subset: both odd and even cases. In: Ioana Bercea and Rasmus Pagh, SIAM Symposium on Simplicity in Algorithms. SIAM, 2025. 385–422 |
|---|---|
| 2022 | Surender Baswana and Abhyuday Pandey: Sensitivity Oracles for All-Pairs Mincuts. In: Joseph (Seffi) Naor, Niv Buchbinder:, SIAM Symposium on Discrete Algorithms. SIAM, 2022. 581-609 |
| 2020 | Surender Baswana and Shiv Kumar Gupta and Till Knollmann: Mincut Sensitivity Data Structures for the Insertion of an Edge. In: Fabrizio Grandoni and Grzegorz Herman and Peter Sanders, 28th Annual European Symposium on Algorithms, {ESA} 2020, September 7-9, 2020, Pisa, Italy (Virtual Conference). Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik, 2020. 12:1--12:14 |
| 2019 | Surender Baswana and Shiv Kumar Gupta and Ayush Tulsyan: Fault Tolerant and Fully Dynamic {DFS} in Undirected Graphs: Simple Yet Efficient. In: Peter Rossmanith and Pinar Heggernes and Joost{-}Pieter Katoen, 44th International Symposium on Mathematical Foundations of Computer Science, {MFCS} 2019, August 26-30, 2019, Aachen, Germany. Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik, 2019. 65:1--65:16 |