Mangesh Gharote
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Mangesh Gharote has a total of 21 co-authors. Here are the top co-authors by number of shared publications:
Rahul Patil
SJM School of Management, Indian Institute of Technology, Bombay, India
4 shared publicationsSachin Lodha
TCS Research, Tata Consultancy Services, Pune, India
4 shared publications- Sachin Lodha
TCS Research, Pune, Maharashtra, India
4 shared publications - Shubhro Roy
TCS Research
3 shared publications - Sutapa Mondal
TCS Research
3 shared publications Nitin Phuke
Tata Consultancy Services, TCS Research TRDDC
2 shared publications
Latest Publications
- 18 August 2025
- Published by Springer Nature
- p. 338-343
Post Quantum Cryptographic Schemes and Libraries Selection
- 18 August 2025
- Published by Springer Nature
- p. 338-343
Post Quantum Cryptographic Schemes and Libraries Selection
- 15 December 2024
- Published by Springer Nature
- p. 310-319
Enabling Privacy in IT Service Operations
- 15 August 2024
- Published by Springer Nature
- p. 1-24
Security-Aware Scheduling of Multiple Scientific Workflows in Cloud
- 15 August 2024
- Published by Springer Nature
- p. 1-24
Security-Aware Scheduling of Multiple Scientific Workflows in Cloud
- 3 March 2022
- Published by Springer Nature in CSI Transactions on ICT
- Vol. 10 (1) , 61-69
Decision support framework for data residency compliance in cloud
- 3 March 2022
- Published by Springer Nature in CSI Transactions on ICT
- Vol. 10 (1) , 61-69
Decision support framework for data residency compliance in cloud
- 19 January 2019
- Published by Springer Nature in Soft Computing
- Vol. 23 (9) , 2995-3011
Multi-objective stable matching and distributional constraints
- 19 January 2019
- Published by Springer Nature in Soft Computing
- Vol. 23 (9) , 2995-3011
Multi-objective stable matching and distributional constraints
- 1 December 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 964-968
Multi-objective stable matching with ties
Stable Matching (SM) has received a lot of attention from researchers due to its useful applications in practice. Gale and Shapley were the first to propose a polynomial-time algorithm to find an SM solution, for matching with strict preferences. However, their algorithm often produces extreme stable solutions, favouring either men or women. In practice, the real-life problems have multiple objectives (equitable and welfare) and preferences are not strict, consequently ties occur. With the inclusion of ties and objectives, the problem becomes NP-hard. A few researchers proposed local search and evolutionary algorithms to solve multi-objective SM problem with ties, but these methods were not scalable. In this paper, we propose an efficient Goal Programming and Repair Heuristics based approach to solve this problem. On comparison with other related works, our approach shows significant improvement in respective objectives (equity and welfare). This approach with slight modification can be proved useful for solving other hard variants of the SM problem.
- 1 December 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 964-968
Multi-objective stable matching with ties
Stable Matching (SM) has received a lot of attention from researchers due to its useful applications in practice. Gale and Shapley were the first to propose a polynomial-time algorithm to find an SM solution, for matching with strict preferences. However, their algorithm often produces extreme stable solutions, favouring either men or women. In practice, the real-life problems have multiple objectives (equitable and welfare) and preferences are not strict, consequently ties occur. With the inclusion of ties and objectives, the problem becomes NP-hard. A few researchers proposed local search and evolutionary algorithms to solve multi-objective SM problem with ties, but these methods were not scalable. In this paper, we propose an efficient Goal Programming and Repair Heuristics based approach to solve this problem. On comparison with other related works, our approach shows significant improvement in respective objectives (equity and welfare). This approach with slight modification can be proved useful for solving other hard variants of the SM problem.
- 5 November 2017
- Published by Springer Nature
- p. 325-334
Stable Matching with Multi-objectives: A Goal Programming Approach
- 5 November 2017
- Published by Springer Nature
- p. 325-334
Stable Matching with Multi-objectives: A Goal Programming Approach
- 24 June 2017
- Published by Springer Nature in Journal of Heuristics
- Vol. 23 (4) , 257-283
Scatter search for trainees to software project requirements stable allocation
- 24 June 2017
- Published by Springer Nature in Journal of Heuristics
- Vol. 23 (4) , 257-283
Scatter search for trainees to software project requirements stable allocation
- 1 December 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1146-1150
Minimal cost stable workforce allocation in presence of ties
In this paper, we address the problem of allocating workforce to software projects, considering bilateral (project managers' and employees') preferences and cost of allocation. Earlier research has addressed the workforce allocation to software projects as stable matching problem with strict preferences ranking. However, in practice, there are scenarios where project managers did not strictly rank the employees; therefore, there are ties in the preference list. We developed a stable matching with ties-based optimization model to create a minimum cost stable allocation. Our results suggest that a software firm can reduce allocation cost and improve the average preferences for both the workforce and the project managers in the presence of ties in the preference list.
- 1 December 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1146-1150
Minimal cost stable workforce allocation in presence of ties
In this paper, we address the problem of allocating workforce to software projects, considering bilateral (project managers' and employees') preferences and cost of allocation. Earlier research has addressed the workforce allocation to software projects as stable matching problem with strict preferences ranking. However, in practice, there are scenarios where project managers did not strictly rank the employees; therefore, there are ties in the preference list. We developed a stable matching with ties-based optimization model to create a minimum cost stable allocation. Our results suggest that a software firm can reduce allocation cost and improve the average preferences for both the workforce and the project managers in the presence of ties in the preference list.
- 1 December 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 98, 1583-1587
Comparison of IT services organizational units on the basis of Human Capital measures
In this paper, we compare organizational units using Data Envelopment Analysis (DEA) on the basis of Human Capital (HC) measures. HC based performance measurement has become an important aspect for organizations to sustain long-term growth. With the inclusion of HC measures, the variable selection for DEAmodel becomes challenging. We propose an automated model discovery method for variable selection. The guideline for variable selection is based on the information obtained from the executives about the variables. This information about the variables could be complete, partial or incomplete. We demonstrate our method under these various scenarios. The methodology is applied to compare 40 units of an IT service firm. Further, we discuss in detail the managerial insights for improvement of the inefficient units.
- 1 December 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 98, 1583-1587
Comparison of IT services organizational units on the basis of Human Capital measures
In this paper, we compare organizational units using Data Envelopment Analysis (DEA) on the basis of Human Capital (HC) measures. HC based performance measurement has become an important aspect for organizations to sustain long-term growth. With the inclusion of HC measures, the variable selection for DEAmodel becomes challenging. We propose an automated model discovery method for variable selection. The guideline for variable selection is based on the information obtained from the executives about the variables. This information about the variables could be complete, partial or incomplete. We demonstrate our method under these various scenarios. The methodology is applied to compare 40 units of an IT service firm. Further, we discuss in detail the managerial insights for improvement of the inefficient units.