Research Publications/Reports
Listing last 25 publications. (View All) View/Hide Filter- Matchings under One-Sided Preferences with Soft Quotas
Santhini K A, Meghana Nasre, Raghu Raman Ravi, Appeared in International Joint Conference on Artificial Intelligence (IJCAI), Aug 2023.
- Optimal Cost based allocation under Two sided preferences
Girija Limaye, Meghana Nasre, Appeared in International Workshop on Combinatorial Algorithms (IWOCA), pp.259--270, Jun 2023.
- Critical Relaxed Stable Matchings with Two-Sided Ties
Keshav Ranjan, Meghana Nasre, Prajakta Nimbhorkar, Appeared in 49th International Workshop on Graph-Theoretic Concepts in Computer Science, Jun 2023.
- Envy-freeness and relaxed stability: hardness and approximation algorithms
Prem Krishnaa, Girija Limaye, Meghana Nasre, Prajakta Nimbhorkar, Appeared in Journal of Combinatorial Optimization, Vol 45, No.1, pp.41, Jan 2023.
- Trade-Offs in Dynamic Coloring for Bipartite and General Graphs
Manas Jyothi Kashyap, Narayanaswamy N S, Meghana Nasre, Sai Mohith Potluri, Appeared in Algorithmica, Vol 85, No.4, pp.854--878, Jan 2023.
- Optimal Matchings with One-sided Preferences : Fixed and Cost Based Quotas
Santhini K A, Govind S. Sankar, Meghana Nasre, Appeared in Proc. of the 21st International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2022),, To Appear, Jan 2022.
- Popular Matchings in the Hospital-Residents Problem with Two-sided Lower Quotas
Meghana Nasre, Prajakta Nimbhorkar, Keshav Ranjan, Ankita Sarkar, Appeared in 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS), Dec 2021.
- Matchings with Group Fairness Constraints: Online and Offline Algorithms
Govind S. Sankar, Anand Louis, Meghana Nasre, Prajakta Nimbhorkar, Appeared in 30th International Joint Conference on Artificial Intelligence (IJCAI 2021), Aug 2021.
- Envy-Freeness and Relaxed Stability: Hardness and Approximation Algorithms
Prem Krishnaa, Girija Limaye, Meghana Nasre, Prajakta Nimbhorkar, Appeared in 13th International Symposium Algorithmic Game Theory (SAGT 2020), Sep 2020.
- Classified Rank-Maximal Matchings and Popular Matchings -- Algorithms and Hardness
Meghana Nasre, Prajakta Nimbhorkar, Nada Abdul Majeed Pulath, Appeared in 45th International Workshop on Graph-Theoretic Concepts in Computer Science, May 2019.
- How good are popular matchings?
Krishnapriya A M, Meghana Nasre, Prajakta Nimbhorkar, Amit Rawat, Appeared in 17th International Symposium on Experimental Algorithms (SEA 2018), Jun 2018.
- Facility location on planar graphs with unreliable links
Narayanaswamy N S, Meghana Nasre, Vijayaraghunathan Ramamoorthi, Appeared in The 13th International Computer Science Symposium in Russia, Jun 2018.
- Popular Matchings with Lower Quotas
Meghana Nasre, Prajakta Nimbhorkar, Appeared in 37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2017), Dec 2017.
- Popularity in the generalized Hospital Residents setting
Meghana Nasre, Amit Rawat, Appeared in The 12th International Computer Science Symposium in Russia (CSR 2017), Jun 2017.
- Rank Maximal Matchings -- Structure and Algorithms.
Pratik Ghoshal, Meghana Nasre, Prajakta Nimbhorkar, Appeared in Accepted for publication at the 25th International Symposium on Algorithms and Computation, Dec 2014.
- Decremenal ALL-Pairs ALL Shortest Paths and Betweenness Centrality.
Meghana Nasre, Matteo Pontecorvi, Vijaya Ramachandran, Appeared in Accepted for publication at the 25th International Symposium on Algorithms and Computation, Dec 2014.
- Betweenness centrality -- Incremental and faster
Meghana Nasre, Matteo Pontecorvi, Vijaya Ramachandran, Appeared in 39th International Symposium on Mathematical Foundations of Computer Science (MFCS 2014), Aug 2014.