Manoj Gupta Associate Professor, Computer Science and Engineering, IIT Gandhinagar Email : gmanoj at iitgn dot ac dot in

Research

My research interests include

• Data Structure

• Fault Tolerant Algorithms

• Dynamic Graph Algorithms

Publications

Conference

1. Improved 2-Approximate Shortest Paths for close vertex pairs
   Manoj Gupta
   FOCS 2025

2. Near Optimal Dual Fault Tolerant Distance Oracle
   Dipan Dey and Manoj Gupta
   ESA 2024

3. The Group Access Bounds for Binary Search Trees
   Parinya Chalermsook, Manoj Gupta, Wanchote Jiamjitrak, Akash Pareek and Sorrachai Yingchareonthawornchai
   ICALP 2024

4. Nearly Optimal Fault Tolerant Distance Oracle
   Dipan Dey and Manoj Gupta
   STOC 2024

5. Improved Pattern-Avoidance Bounds for Greedy BSTs via Matrix Decomposition
   Parinya Chalermsook, Manoj Gupta, Wanchote Jiamjitrak, Nidia Obscura Acosta, Akash Pareek and Sorrachai Yingchareonthawornchai
   SODA 2023

6. Near Optimal Algorithm for Fault Tolerant Distance Oracle and Single Source Replacement Path problem
   Dipan Dey and Manoj Gupta
   ESA 2022

7. Output Sensitive Fault Tolerant Maximum Matching
   Niranka Banerjee, Manoj Gupta, Venkatesh Raman and Saket Saurabh
   CSR 2022

8. Simple dynamic algorithms for Maximal Independent Set, Maximum Flow and Maximum Matching.
   Manoj Gupta and Shahbaz Khan
   SOSA 2021

9. Multiple Source Replacement Path Problem
   Manoj Gupta, Rahul Jain and Nitiksha Modi
   PODC 2020

10. On the Complexity of Optimal Matching Reconfiguration
    Manoj Gupta and Hitesh Kumar and Neeldhara Misra
    SOFSEM 2019

11. Generic Single Edge Fault Tolerant Exact Distance Oracle
    Manoj Gupta and Aditi Singh
    ICALP 2018

12. Improved Algorithm for Dynamic b-Matching
    Sayan Bhattacharya, Manoj Gupta and Divyarthi Mohan
    ESA 2017

13. Multiple Source Dual Fault Tolerant BFS Trees
    Manoj Gupta and Shahbaz Khan
    ICALP 2017

14. CAPReS: Context Aware Persona Based Recommendation for Shoppers
    Joydeep Banerjee, Gurulingesh Raravi, Manoj Gupta, Sindhu K. Ernala, Shruti Kunde, Koustuv Dasgupta
    AAAI 2016

15. Cell Design and Routing of Jobs in a Multisite Make-to-Order Enterprise
    Manoj Gupta, J.C. Bose, Partha Dutta
    ICAPS 2016

16. Maintaining Approximate Maximum Matching in an Incremental Bipartite Graph in Polylogarithmic Update Time
    Manoj Gupta
    FSTTCS 2015

17. Fully Dynamic (1+$\epsilon$), Approximate Matchings
    Manoj Gupta and Richard Peng
    FOCS 2013

18. Fully dynamic maximal matching in $O(\log n)$ update time
    Surender Baswana, Manoj Gupta, Sandeep Sen
    FOCS 2011

19. Maintaining Approximate Maximum Weighted Matching in Fully Dynamic Graphs
    Abhash Anand , Surender Baswana, Manoj Gupta, Sandeep Sen
    FSTTCS 2012

20. The update complexity of selection and related problems
    Manoj Gupta, Yogish Sabharwal, Sandeep Sen
    FSTTCS 2011

Journal

1. The update complexity of selection and related problems
   Manoj Gupta, Yogish Sabharwal, Sandeep Sen,
   Theory Comput. Syst., 2016, 59, 112-132

2. Fully dynamic maximal matching in $O(\log n)$ update time
   Surender Baswana, Manoj Gupta, Sandeep Sen,
   SIAM J. Comput., 2015, 44, 88-113

3. The robust knapsack problem with queries
   Marc Goerigk, Manoj Gupta, Jonas Ide, Anita Schöbel, Sandeep Sen
   Computers & OR, 2015, 55, 12-22

4. Better Analysis of GREEDY Binary Search Tree on Decomposable Sequences
   Navin Goyal, Manoj Gupta
   Theoretical Computer Science

Book Chapters

1. Matching in Dynamic Graphs
   Surender Baswana, Manoj Gupta, Sandeep Sen
   Encyclopedia of Algorithms, 2016, 1195-1199

Manuscripts

1. On Dynamic Optimality for Binary Search Trees
   Navin Goyal, Manoj Gupta

2. An $O(\log n)$ Fully Dynamic Algorithm for Maximum matching in a tree
   Manoj Gupta, Ankit Sharma