default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPriya Ranjan Sinha Mahapatra
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j13]Sang Won Bae, Sandip Banerjee
, Arpita Baral, Priya Ranjan Sinha Mahapatra, Sang Duk Yoon:
Maximum-width rainbow-bisecting empty annulus. Comput. Geom. 120: 102088 (2024)- [j12]Shambo Chatterjee, Soumya Bhattacharyya, Sourav Saha, Anindya Halder, Priya Ranjan Sinha Mahapatra:
Detection of Dense Built-Up Area in Low-Resolution Satellite Images Using Deep Learning and DBSCAN Approaches. Int. J. Pattern Recognit. Artif. Intell. 38(4): 2451004:1-2451004:30 (2024) - 2023
- [i5]Sang Won Bae, Sandip Banerjee, Arpita Baral, Priya Ranjan Sinha Mahapatra, Sang Duk Yoon:
Maximum-Width Rainbow-Bisecting Empty Annulus. CoRR abs/2305.09248 (2023) - 2022
- [j11]Soumen Atta, Priya Ranjan Sinha Mahapatra, Anirban Mukhopadhyay:
Solving a new variant of the capacitated maximal covering location problem with fuzzy coverage area using metaheuristic approaches. Comput. Ind. Eng. 170: 108315 (2022) - 2021
- [j10]Sang Won Bae, Arpita Baral, Priya Ranjan Sinha Mahapatra:
Maximum-width empty square and rectangular annulus. Comput. Geom. 96: 101747 (2021) - [j9]Soumen Atta, Priya Ranjan Sinha Mahapatra, Anirban Mukhopadhyay:
A multi-objective formulation of maximal covering location problem with customers' preferences: Exploring Pareto optimality-based solutions. Expert Syst. Appl. 186: 115830 (2021) - [i4]Biswajit Sanyal, Subhashis Majumder, Priya Ranjan Sinha Mahapatra:
Efficient Reporting of Top-k Subset Sums. CoRR abs/2105.11250 (2021)
2010 – 2019
- 2019
- [j8]Soumen Atta, Priya Ranjan Sinha Mahapatra, Anirban Mukhopadhyay:
Solving Uncapacitated Facility Location Problem Using Heuristic Algorithms. Int. J. Nat. Comput. Res. 8(2): 18-50 (2019) - [j7]Soumen Atta, Priya Ranjan Sinha Mahapatra, Anirban Mukhopadhyay:
Solving tool indexing problem using harmony search algorithm with harmony refinement. Soft Comput. 23(16): 7407-7423 (2019) - [j6]Soumen Atta, Priya Ranjan Sinha Mahapatra, Anirban Mukhopadhyay:
Multi-objective uncapacitated facility location problem with customers' preferences: Pareto-based and weighted sum GA-based approaches. Soft Comput. 23(23): 12347-12362 (2019) - [c8]Sang Won Bae, Arpita Baral, Priya Ranjan Sinha Mahapatra:
Maximum-Width Empty Square and Rectangular Annulus. WALCOM 2019: 69-81 - 2018
- [j5]Soumen Atta, Priya Ranjan Sinha Mahapatra:
Perturbation-minimising frequency assignment to address short term demand fluctuation in cellular network. Int. J. Commun. Networks Distributed Syst. 21(3): 418-443 (2018) - [j4]Soumen Atta, Priya Ranjan Sinha Mahapatra, Anirban Mukhopadhyay:
Solving maximal covering location problem using genetic algorithm with local refinement. Soft Comput. 22(12): 3891-3906 (2018) - [j3]Sergey Bereg, Binay Bhattacharya, Sandip Das, Tsunehiko Kameda, Priya Ranjan Sinha Mahapatra, Zhao Song:
Optimizing squares covering a set of points. Theor. Comput. Sci. 729: 68-83 (2018) - [i3]Sang Won Bae, Arpita Baral, Priya Ranjan Sinha Mahapatra:
Maximum-Width Empty Square and Rectangular Annulus. CoRR abs/1811.06217 (2018) - 2017
- [c7]Sourav Saha, Ankita Mandal, Paras Sheth, Harshita Narnoli, Priya Ranjan Sinha Mahapatra:
A Computer Vision Framework for Partitioning of Image-Object Through Graph Theoretical Heuristic Approach. CICBA (2) 2017: 284-296 - [i2]Arpita Baral, Abhilash Gondane, Sanjib Sadhu, Priya Ranjan Sinha Mahapatra:
Maximum-width Axis-Parallel Empty Rectangular Annulus. CoRR abs/1712.00375 (2017) - 2016
- [c6]Soumen Atta, Priya Ranjan Sinha Mahapatra:
An efficient algorithm for PMFAP. COMSNETS 2016: 1-8 - [i1]Soumen Atta, Priya Ranjan Sinha Mahapatra, Stanislaw Goldstein:
No-hole λ-L(k, k-1, ..., 2, 1)-labeling for Square Grid. CoRR abs/1609.06630 (2016) - 2015
- [j2]Priya Ranjan Sinha Mahapatra, Partha P. Goswami, Sandip Das:
Placing Two Axis-Parallel Squares to Maximize the Number of Enclosed Points. Int. J. Comput. Geom. Appl. 25(4): 263-282 (2015) - 2014
- [c5]Binay K. Bhattacharya, Sandip Das, Tsunehiko Kameda, Priya Ranjan Sinha Mahapatra, Zhao Song:
Optimizing Squares Covering a Set of Points. COCOA 2014: 37-52 - 2013
- [j1]Joydeep Mukherjee, Priya Ranjan Sinha Mahapatra, Arindam Karmakar, Sandip Das:
Minimum-width rectangular annulus. Theor. Comput. Sci. 508: 74-80 (2013) - 2011
- [c4]Joydeep Mukherjee, Priya Ranjan Sinha Mahapatra, Arindam Karmakar, Sandip Das:
Minimum Width Rectangular Annulus. FAW-AAIM 2011: 364-374 - [c3]Priya Ranjan Sinha Mahapatra, Arindam Karmakar, Sandip Das, Partha P. Goswami:
k-Enclosing Axis-Parallel Square. ICCSA (3) 2011: 84-93
2000 – 2009
- 2008
- [c2]Priya Ranjan Sinha Mahapatra, Partha P. Goswami, Sandip Das:
Maximal Covering by Two Isothetic Unit Squares. CCCG 2008 - 2007
- [c1]Priya Ranjan Sinha Mahapatra, Partha P. Goswami, Sandip Das:
Covering Points by Isothetic Unit Squares. CCCG 2007: 169-172
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 2025-01-20 22:59 CET 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:
