Meghana Nasre


		Meghana Nasre Associate Professor CSE, IIT Madras Office: CSB-10, CSE Dept. Contact: {firstname}@iitm.ac.in

Research Interests: Graph Algorithms, Matchings in Graphs.

List of Publications

Optimal Matchings with One-Sided Preferences: Fixed and Cost-Based Quotas
Santhini K. A., Govind S. Sankar, Meghana Nasre
AAMAS 2022

Popular Matchings in the Hospital-Residents Problem with Two-Sided Lower Quotas.
Meghana Nasre, Prajakta Nimbhorkar, Keshav Ranjan, Ankita Sarkar
FSTTCS 2021

Matchings with Group Fairness Constraints: Online and Offline Algorithms.
Govind S. Sankar, Anand Louis, Meghana Nasre, Prajakta Nimbhorkar.
IJCAI 2021

Envy-Freeness and Relaxed Stability: Hardness and Approximation Algorithms.
Prem Krishnaa, Girija Limaye, Meghana Nasre, Prajakta Nimbhorkar.
SAGT 2020.

Student Course Allocation Problem with Constraints
Akshay Utture, Vedant Somani, Prem Krishnaa, Meghana Nasre.
SEA 2019.

Popular Matchings with two-sided preferences and one-sided ties.
Kavitha Gopal, Meghana Nasre, Prajakta Nimbhorkar, T. Pradeep Reddy.
COCOON 2019.

Classified Rank-maximal Matchings and Popular Matchings -- Algorithms and Hardness.
Meghana Nasre, Prajakta Nimbhorkar, Nada Pulath.
WG 2019.

How good are Popular Matchings?
Krishnapriya A M, Meghana Nasre, Prajakta Nimbhorkar, Amit Rawat.
SEA 2018.

Facility Location on planar graphs with unreliable links.
Narayaswamy N S, Meghana Nasre, Vijayaraghunathan Ramamoorthi.
CSR 2018.

Popular Matchings with Lower Quotas.
Meghana Nasre, Prajakta Nimbhorkar.
FSTTCS 2017.
Popularity in the Generalized Hospital Residents Setting.
Meghana Nasre, Amit Rawat.
CSR 2017.
Rank Maximal Matchings -- Structure and Algorithms.
Pratik Ghoshal, Meghana Nasre, Prajakta Nimbhorkar.
ISAAC 2014. Theoretical Computer Science 2019.
Decremental All Pairs ALL Shortest Paths and Betweenness Centrality.
Meghana Nasre, Matteo Pontecorvi, Vijaya Ramachandran.
ISAAC 2014.
Betweenness Centrality -- Incremental and Faster.
Meghana Nasre, Matteo Pontecorvi, Vijaya Ramachandran.
MFCS 2014.
Popular Matchings: Structure and Strategic Issues.
Meghana Nasre.
Accepted for publication at SIAM Journal on Discrete Mathematics (SIDMA).
Preliminary version in STACS 2013.
Rainbow Connectivity: Hardness and Tractability.
Prabhanjan Ananth, Meghana Nasre, Kanthi Kiran Sarpatwar.
FSTTCS 2011.
Popularity at Minimum Cost.
Telikepalli Kavitha, Meghana Nasre, Prajakta Nimbhorkar.
Journal of Combinatorial Optimization, 2014.
Preliminary version in ISAAC 2010.
Popular Matchings with Variable Item copies.
Telikepalli Kavitha, Meghana Nasre.
Theoretical Computer Science, 2011.
Preliminary version in ISAAC 2009.
Popular Mixed Matchings.
Telikepalli Kavitha, Julian Mestre, Meghana Nasre.
Theoretical Computer Science, 2011. (Special Issue for ICALP)
Preliminary version in ICALP 2009.
Optimal Popular Matchings.
Telikepalli Kavitha, Meghana Nasre.
Discrete Applied Mathematics 2009.
Preliminary version in MATCH-UP 2009.
Bounded Unpopularity Matchings.
Chien-Chung Huang, Telikepalli Kavitha, Dimitrios Michail, Meghana Nasre.
Algorithmica 2011.
Preliminary version in SWAT 2008.