Manoj Gupta

44 papers A* 11A 3B 1Misc 1Journal 23Unranked 4
YearRankTypeTitle / Venue / Authors
2025 A* conf
Improved 2-Approximate Shortest Paths for close vertex pairs.
FOCS
Manoj Gupta
2025 J jnl
Improved 2-Approximate Shortest Paths for close vertex pairs.
CoRR
Manoj Gupta
2024 A conf
Near Optimal Dual Fault Tolerant Distance Oracle.
ESA
Dipan Dey, Manoj Gupta
2024 J jnl
Near Optimal Dual Fault Tolerant Distance Oracle.
CoRR
Dipan Dey, Manoj Gupta
2024 A* conf
Nearly Optimal Fault Tolerant Distance Oracle.
STOC
Dipan Dey, Manoj Gupta
2024 A* conf
The Group Access Bounds for Binary Search Trees.
ICALP
Parinya Chalermsook, Manoj Gupta, Wanchote Jiamjitrak, Akash Pareek, Sorrachai Yingchareonthawornchai
2023 A* conf
Improved Pattern-Avoidance Bounds for Greedy BSTs via Matrix Decomposition.
SODA
Parinya Chalermsook, Manoj Gupta, Wanchote Jiamjitrak, Nidia Obscura Acosta, Akash Pareek, Sorrachai Yingchareonthawornchai
2023 J jnl
The Group Access Bounds for Binary Search Trees.
CoRR
Parinya Chalermsook, Manoj Gupta, Wanchote Jiamjitrak, Akash Pareek, Sorrachai Yingchareonthawornchai
2022 J jnl
Improved Pattern-Avoidance Bounds for Greedy BSTs via Matrix Decomposition.
CoRR
Parinya Chalermsook, Manoj Gupta, Wanchote Jiamjitrak, Nidia Obscura Acosta, Akash Pareek, Sorrachai Yingchareonthawornchai
2022 A conf
Near Optimal Algorithm for Fault Tolerant Distance Oracle and Single Source Replacement Path Problem.
ESA
Dipan Dey, Manoj Gupta
2022 J jnl
Near Optimal Algorithm for Fault Tolerant Distance Oracle and Single Source Replacement Path problem.
CoRR
Dipan Dey, Manoj Gupta
2022 Misc conf
Output Sensitive Fault Tolerant Maximum Matching.
CSR
Niranka Banerjee, Manoj Gupta, Venkatesh Raman, Saket Saurabh
2021 — conf
Simple dynamic algorithms for Maximal Independent Set, Maximum Flow and Maximum Matching.
SOSA
Manoj Gupta, Shahbaz Khan
2020 A* conf
Multiple Source Replacement Path Problem.
PODC
Manoj Gupta, Rahul Jain, Nitiksha Modi
2020 J jnl
Multiple Source Replacement Path Problem.
CoRR
Manoj Gupta, Rahul Jain, Nitiksha Modi
2019 J jnl
Better analysis of greedy binary search tree on decomposable sequences.
Theor. Comput. Sci.
Navin Goyal, Manoj Gupta
2019 B conf
On the Complexity of Optimal Matching Reconfiguration.
SOFSEM
Manoj Gupta, Hitesh Kumar, Neeldhara Misra
2018 J jnl
Fully Dynamic Maximal Matching in O(log n) Update Time (Corrected Version).
SIAM J. Comput.
Surender Baswana, Manoj Gupta, Sandeep Sen
2018 A* conf
Generic Single Edge Fault Tolerant Exact Distance Oracle.
ICALP
Manoj Gupta, Aditi Singh
2018 J jnl
Generic Single Edge Fault Tolerant Exact Distance Oracle.
CoRR
Manoj Gupta, Aditi Singh
2018 J jnl
Nearly Optimal Space Efficient Algorithm for Depth First Search.
CoRR
Jayesh Choudhari, Manoj Gupta, Shivdutt Sharma
2018 J jnl
Simple dynamic algorithms for Maximal Independent Set and other problems.
CoRR
Manoj Gupta, Shahbaz Khan
2017 A conf
Improved Algorithm for Dynamic b-Matching.
ESA
Sayan Bhattacharya, Manoj Gupta, Divyarthi Mohan
2017 A* conf
Multiple Source Dual Fault Tolerant BFS Trees.
ICALP
Manoj Gupta, Shahbaz Khan
2017 J jnl
Multiple Source Dual Fault Tolerant BFS Trees.
CoRR
Manoj Gupta, Shahbaz Khan
2016 J jnl
Better Analysis of GREEDY Binary Search Tree on Decomposable Sequences.
CoRR
Navin Goyal, Manoj Gupta
2016 A* conf
CAPReS: Context Aware Persona Based Recommendation for Shoppers.
AAAI
Joydeep Banerjee, Gurulingesh Raravi, Manoj Gupta, Sindhu Kiranmai Ernala, Shruti Kunde, Koustuv Dasgupta
2016 A* conf
Cell Design and Routing of Jobs in a Multisite Make-to-Order Enterprise.
ICAPS
Manoj Gupta, R. P. Jagadeesh Chandra Bose, Partha Dutta
2016 — ch.
Matching in Dynamic Graphs.
Encyclopedia of Algorithms
Surender Baswana, Manoj Gupta, Sandeep Sen
2016 J jnl
The Update Complexity of Selection and Related Problems.
Theory Comput. Syst.
Manoj Gupta, Yogish Sabharwal, Sandeep Sen
2015 J jnl
Fully Dynamic Maximal Matching in O(log n) Update Time.
SIAM J. Comput.
Surender Baswana, Manoj Gupta, Sandeep Sen
2015 J jnl
The robust knapsack problem with queries.
Comput. Oper. Res.
Marc Goerigk, Manoj Gupta, Jonas Ide, Anita Schöbel, Sandeep Sen
2014 — conf
Maintaining Approximate Maximum Matching in an Incremental Bipartite Graph in Polylogarithmic Update Time.
FSTTCS
Manoj Gupta
2013 J jnl
Fully Dynamic $(1+ε)$-Approximate Matchings
CoRR
Manoj Gupta, Richard Peng
2013 A* conf
Fully Dynamic (1+ e)-Approximate Matchings.
FOCS
Manoj Gupta, Richard Peng
2012 J jnl
Maintaining Approximate Maximum Weighted Matching in Fully Dynamic Graphs
CoRR
Abhash Anand, Surender Baswana, Manoj Gupta, Sandeep Sen
2012 — conf
Maintaining Approximate Maximum Weighted Matching in Fully Dynamic Graphs.
FSTTCS
Abhash Anand, Surender Baswana, Manoj Gupta, Sandeep Sen
2011 A* conf
Fully Dynamic Maximal Matching in O (log n) Update Time.
FOCS
Surender Baswana, Manoj Gupta, Sandeep Sen
2011 J jnl
Fully dynamic maximal matching in O(log n) update time
CoRR
Surender Baswana, Manoj Gupta, Sandeep Sen
2011 J jnl
On Dynamic Optimality for Binary Search Trees
CoRR
Navin Goyal, Manoj Gupta
2011 J jnl
The update complexity of selection and related problems
CoRR
Manoj Gupta, Yogish Sabharwal, Sandeep Sen
2011 — conf
The update complexity of selection and related problems.
FSTTCS
Manoj Gupta, Yogish Sabharwal, Sandeep Sen
2009 J jnl
An O(log(n)) Fully Dynamic Algorithm for Maximum matching in a tree
CoRR
Manoj Gupta, Ankit Sharma
2006 J jnl
Development of bulk nanostructured copper with superior hardness for use as an interconnect material in electronic packaging.
Microelectron. Reliab.
M. Y. Pan, Manoj Gupta, Andrew A. O. Tay, Kripesh Vaidyanathan