|
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
Algorithms
Dynamic Graph Algorithms
Publications
Conference
Dipan Dey and Manoj Gupta
Near Optimal Dual Fault Tolerant Distance Oracle
ESA 2024
Parinya Chalermsook, Manoj Gupta,Wanchote Jiamjitrak,Akash Pareek and Sorrachai Yingchareonthawornchai
The Group Access Bounds for Binary Search Trees
ICALP 2024
Dipan Dey and Manoj Gupta
Nearly Optimal Fault Tolerant Distance Oracle
STOC 2024
Parinya Chalermsook, Manoj Gupta,Wanchote Jiamjitrak, Nidia Obscura Acosta,Akash Pareek and Sorrachai Yingchareonthawornchai
Improved Pattern-Avoidance Bounds for Greedy BSTs via Matrix Decomposition
SODA 2023
Dipan Dey and Manoj Gupta
Near Optimal Algorithm for Fault Tolerant Distance Oracle and Single Source Replacement Path problem
ESA 2022
Niranka Banerjee, Manoj Gupta, Venkatesh Raman and Saket Saurabh
Output Sensitive Fault Tolerant Maximum Matching
CSR 2022
Manoj Gupta and Shahbaz Khan
Simple dynamic algorithms for Maximal Independent Set, Maximum Flow and Maximum Matching.
SOSA 2021
Manoj Gupta, Rahul Jain and Nitiksha Modi
Multiple Source Replacement Path Problem
PODC 2020
Manoj Gupta and Hitesh Kumar and Neeldhara Misra
On the Complexity of Optimal Matching Reconfiguration
SOFSEM 2019
Manoj Gupta and Aditi Singh
Generic Single Edge Fault Tolerant Exact Distance Oracle
ICALP 2018
Sayan Bhattacharya, Manoj Gupta and Divyarthi Mohan
Improved Algorithm for Dynamic b-Matching
ESA 2017
Manoj Gupta and Shahbaz Khan
Multiple Source Dual Fault Tolerant BFS Trees
ICALP 2017
Joydeep Banerjee, Gurulingesh Raravi, Manoj Gupta, Sindhu K. Ernala, Shruti Kunde, Koustuv Dasgupta
CAPReS: Context Aware Persona Based Recommendation for Shoppers
Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, February 12-17, 2016, Phoenix, Arizona, USA., AAAI Press, 2016, 680-686
Manoj Gupta, J.C. Bose, Partha Dutta
Cell Design and Routing of Jobs in a Multisite Make-to-Order Enterprise
Proceedings of the Twenty-Sixth International Conference on Automated Planning and Scheduling, ICAPS 2016, London, UK, June 12-17, 2016., AAAI Press, 2016, 394-402
Manoj Gupta
Maintaining Approximate Maximum Matching in an Incremental Bipartite Graph in Polylogarithmic Update Time
FSTTCS 2015
Manoj Gupta and Richard Peng
Fully Dynamic (1+$\epsilon$), Approximate Matchings
FOCS 2013
Surender Baswana, Manoj Gupta, Sandeep Sen
Fully dynamic maximal matching in $O(\log n)$ update time
FOCS 2011
Abhash Anand , Surender Baswana, Manoj Gupta, Sandeep Sen
Maintaining Approximate Maximum Weighted Matching in Fully Dynamic Graphs
FSTTCS 2012
Manoj Gupta, Yogish Sabharwal, Sandeep Sen
The update complexity of selection and related problems
FSTTCS 2011
Journal
Manoj Gupta, Yogish Sabharwal, Sandeep Sen,
The update complexity of selection and related problems
Theory Comput. Syst., 2016, 59, 112-132
Surender Baswana, Manoj Gupta, Sandeep Sen,
Fully dynamic maximal matching in $O(\log n)$ update time
SIAM J. Comput., 2015, 44, 88-113
Marc Goerigk, Manoj Gupta, Jonas Ide, Anita Schöbel, Sandeep Sen
The robust knapsack problem with queries
Computers & OR, 2015, 55, 12-22
Navin Goyal, Manoj Gupta
Better Analysis of GREEDY Binary Search Tree on Decomposable Sequences
Theoretical Computer Science
Book Chapters
Surender Baswana, Manoj Gupta, Sandeep Sen
Matching in Dynamic Graphs
Encyclopedia of Algorithms, 2016, 1195-1199
Manuscripts
Navin Goyal, Manoj Gupta
On Dynamic Optimality for Binary Search Trees
Manoj Gupta, Ankit Sharma
An $O(\log n)$ Fully Dynamic Algorithm for Maximum matching in a tree
|