default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDShubhadip Mitra
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j1]Shubhadip Mitra
, Priya Saraf, Arnab Bhattacharya:
TIPS: Mining Top-K Locations to Minimize User-Inconvenience for Trajectory-Aware Services. IEEE Trans. Knowl. Data Eng. 33(3): 1238-1250 (2021)
2010 – 2019
- 2019
- [c9]Shubhadip Mitra, Priya Saraf, Richa Sharma, Arnab Bhattacharya, Sayan Ranu:
NetClus: A Scalable Framework to Mine Top-K Locations for Placement of Trajectory-Aware Services. COMAD/CODS 2019: 27-35 - 2017
- [c8]Shubhadip Mitra, Partha Dutta, Arnab Bhattacharya:
Optimal Algorithms for Min-Closed, Max-Closed and Arc Consistency over Connected Row Convex Constraints. COMPUTE 2017: 61-72 - [c7]Shubhadip Mitra, Priya Saraf, Richa Sharma, Arnab Bhattacharya, Sayan Ranu, Harsh Bhandari:
NetClus: A Scalable Framework for Locating Top-K Sites for Placement of Trajectory-Aware Services. ICDE 2017: 87-90 - [i4]Shubhadip Mitra, Priya Saraf, Richa Sharma, Arnab Bhattacharya, Harsh Bhandari, Sayan Ranu:
NetClus: A Scalable Framework for Locating Top-K Sites for Placement of Trajectory-Aware Services. CoRR abs/1702.02809 (2017) - [i3]Shubhadip Mitra, Priya Saraf, Arnab Bhattacharya:
TIPS: Mining Top-K Locations to Minimize User-Inconvenience for Trajectory-Aware Services. CoRR abs/1709.02343 (2017) - 2016
- [c6]Shubhendu Aggarwal, Shubhadip Mitra, Arnab Bhattacharya:
SkyCover: Finding Range-Constrained Approximate Skylines with Bounded Quality Guarantees. COMAD 2016: 1-12 - [c5]Shubhadip Mitra:
Identifying Top-K Optimal Locations for Placement of Large-Scale Trajectory-Aware Services. PhD@VLDB 2016 - 2015
- [c4]Shubhadip Mitra, Sayan Ranu, Vinay Kolar, Aditya Telang, Arnab Bhattacharya, Ravi Kokku, Sriram Raghavan:
Trajectory aware macro-cell planning for mobile users. INFOCOM 2015: 792-800 - [i2]Shubhadip Mitra, Sayan Ranu, Vinay Kolar, Aditya Telang, Arnab Bhattacharya, Ravi Kokku, Sriram Raghavan:
Trajectory Aware Macro-cell Planning for Mobile Users. CoRR abs/1501.02918 (2015) - 2014
- [c3]Arzoo Katiyar, Arnab Bhattacharya, Shubhadip Mitra:
Efficient and Effective Route Planning in Road Networks with Probabilistic Data using Skyline Paths. CODS 2014: 1-10 - 2013
- [i1]Shubhadip Mitra, Partha Dutta, Arnab Bhattacharya:
Constraint Satisfaction over Generalized Staircase Constraints. CoRR abs/1304.5051 (2013) - 2010
- [c2]Shubhadip Mitra, UmaMaheswari Devi, Parul Gupta, Malolan Chetlur, Shivkumar Kalyanaraman:
Macro-scheduling of base stations for video-on-demand flows in WiMAX networks. IWQoS 2010: 1-6
2000 – 2009
- 2009
- [c1]Shubhadip Mitra, Partha Dutta, Shivkumar Kalyanaraman, Prashant Pradhan:
Spatio-Temporal Patterns for Problem Determination in IT Services. IEEE SCC 2009: 49-56
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:48 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
