Priya Ranjan Sinha Mahapatra

Orcid: 0000-0002-6943-3934

According to our database1, Priya Ranjan Sinha Mahapatra authored at least 21 papers between 2007 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Maximum-Width Rainbow-Bisecting Empty Annulus.
CoRR, 2023

2022
Solving a new variant of the capacitated maximal covering location problem with fuzzy coverage area using metaheuristic approaches.
Comput. Ind. Eng., 2022

2021
A multi-objective formulation of maximal covering location problem with customers' preferences: Exploring Pareto optimality-based solutions.
Expert Syst. Appl., 2021

Efficient Reporting of Top-k Subset Sums.
CoRR, 2021

Maximum-width empty square and rectangular annulus.
Comput. Geom., 2021

2019
Multi-objective uncapacitated facility location problem with customers' preferences: Pareto-based and weighted sum GA-based approaches.
Soft Comput., 2019

Solving tool indexing problem using harmony search algorithm with harmony refinement.
Soft Comput., 2019

Solving Uncapacitated Facility Location Problem Using Heuristic Algorithms.
Int. J. Nat. Comput. Res., 2019

2018
Optimizing squares covering a set of points.
Theor. Comput. Sci., 2018

Solving maximal covering location problem using genetic algorithm with local refinement.
Soft Comput., 2018

Perturbation-minimising frequency assignment to address short term demand fluctuation in cellular network.
Int. J. Commun. Networks Distributed Syst., 2018

2017
Maximum-width Axis-Parallel Empty Rectangular Annulus.
CoRR, 2017

A Computer Vision Framework for Partitioning of Image-Object Through Graph Theoretical Heuristic Approach.
Proceedings of the Computational Intelligence, Communications, and Business Analytics, 2017

2016
No-hole λ-L(k, k-1, ..., 2, 1)-labeling for Square Grid.
CoRR, 2016

An efficient algorithm for PMFAP.
Proceedings of the 8th International Conference on Communication Systems and Networks, 2016

2015
Placing Two Axis-Parallel Squares to Maximize the Number of Enclosed Points.
Int. J. Comput. Geom. Appl., 2015

2014
Optimizing Squares Covering a Set of Points.
Proceedings of the Combinatorial Optimization and Applications, 2014

2013
Minimum-width rectangular annulus.
Theor. Comput. Sci., 2013

2011
<i>k</i>-Enclosing Axis-Parallel Square.
Proceedings of the Computational Science and Its Applications - ICCSA 2011, 2011

2008
Maximal Covering by Two Isothetic Unit Squares.
Proceedings of the 20th Annual Canadian Conference on Computational Geometry, 2008

2007
Covering Points by Isothetic Unit Squares.
Proceedings of the 19th Annual Canadian Conference on Computational Geometry, 2007


  Loading...