Popular Matchings with Variable Job Capacities. - Telikepalli Kavitha; Meghana Nasre (ISAAC, 2009)

Optimal popular matchings. - Telikepalli Kavitha; Meghana Nasre (Discret. Appl. Math., 2009)

Rainbow Connectivity: Hardness and Tractability. - Prabhanjan Ananth; Meghana Nasre; Kanthi K. Sarpatwar (FSTTCS, 2011)

Bounded Unpopularity Matchings. - Chien-Chung Huang 001; Telikepalli Kavitha; Dimitrios Michail 001; Meghana Nasre (Algorithmica, 2011)

New Hardness Results in Rainbow Connectivity - Prabhanjan Ananth; Meghana Nasre (CoRR, 2011)

Hardness and Parameterized Algorithms on Rainbow Connectivity problem - Prabhanjan Ananth; Meghana Nasre; Kanthi K. Sarpatwar (CoRR, 2011)

Popular mixed matchings. - Telikepalli Kavitha; Julián Mestre; Meghana Nasre (Theor. Comput. Sci., 2011)

Popular matchings with variable item copies. - Telikepalli Kavitha; Meghana Nasre (Theor. Comput. Sci., 2011)

Popular Matchings: Structure and Cheating Strategies. - Meghana Nasre (STACS, 2013)

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 (2), 2014)

Popularity at minimum cost. - Telikepalli Kavitha; Meghana Nasre; Prajakta Nimbhorkar (J. Comb. Optim., 2014)

Popular Matchings: Structure and Strategic Issues. - Meghana Nasre (SIAM J. Discret. Math., 2014)

List Coloring of Planar Graphs with Forbidden Cycles. - Sreekanth Gorla; Meghana Nasre (Electron. Notes Discret. Math., 2016)

Popularity in the Generalized Hospital Residents Setting. - Meghana Nasre; Amit Rawat (CSR, 2017)

Popular Matchings with Lower Quotas. - Meghana Nasre; Prajakta Nimbhorkar (FSTTCS, 2017)

Popular Matching with Lower Quotas. - Meghana Nasre; Prajakta Nimbhorkar (CoRR, 2017)

Facility Location on Planar Graphs with Unreliable Links. - N. S. Narayanaswamy; Meghana Nasre; R. Vijayaragunathan (CSR, 2018)

How Good Are Popular Matchings?. - Krishnapriya A. M; Meghana Nasre; Prajakta Nimbhorkar; Amit Rawat (SEA, 2018)

Dichotomy Results for Classified Rank-Maximal Matchings and Popular Matchings. - Meghana Nasre; Prajakta Nimbhorkar; Nada Pulath (CoRR, 2018)

Many-to-One Popular Matchings with Two-Sided Preferences and One-Sided Ties. - Kavitha Gopal; Meghana Nasre; Prajakta Nimbhorkar; T. Pradeep Reddy (COCOON, 2019)

Student Course Allocation with Constraints. - Akshay Utture; Vedant Somani; Prem Krishnaa; Meghana Nasre (SEA², 2019)

Classified Rank-Maximal Matchings and Popular Matchings - Algorithms and Hardness. - Meghana Nasre; Prajakta Nimbhorkar; Nada Pulath (WG, 2019)

Dynamic coloring for Bipartite and General Graphs. - Manas Jyoti Kashyop; N. S. Narayanaswamy; Meghana Nasre; Sai Mohith Potluri (CoRR, 2019)

Maximum-Size Envy-free Matchings. - Prem Krishnaa; Girija Limaye; Meghana Nasre; Prajakta Nimbhorkar (CoRR, 2019)

Rank-maximal matchings - structure and algorithms. - Pratik Ghosal; Meghana Nasre; Prajakta Nimbhorkar (Theor. Comput. Sci., 2019)

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)

Stable Matchings with Flexible Quotas. - Girija Limaye; Meghana Nasre (CoRR, 2021)

Popular Critical Matchings in the Many-to-Many Setting. - Meghana Nasre; Prajakta Nimbhorkar; Keshav Ranjan (CoRR, 2022)

Matchings Under Diversity Constraints. - Govind S. Sankar; Anand Louis; Meghana Nasre; Prajakta Nimbhorkar (CoRR, 2022)

Online Algorithms for Matchings with Proportional Fairness Constraints and Diversity Constraints. - Anand Louis; Meghana Nasre; Prajakta Nimbhorkar; Govind S. Sankar (ECAI, 2023)

Matchings under One-Sided Preferences with Soft Quotas. - Santhini K. A.; Raghu Raman Ravi; Meghana Nasre (IJCAI, 2023)

Optimal Cost-Based Allocations Under Two-Sided Preferences. - Girija Limaye; Meghana Nasre (IWOCA, 2023)

Critical Relaxed Stable Matchings with Two-Sided Ties. - Meghana Nasre; Prajakta Nimbhorkar; Keshav Ranjan (WG, 2023)

Envy-freeness and relaxed stability: hardness and approximation algorithms. - Prem Krishnaa; Girija Limaye; Meghana Nasre; Prajakta Nimbhorkar (J. Comb. Optim., 2023)

Trade-Offs in Dynamic Coloring for Bipartite and General Graphs. - Manas Jyoti Kashyop; N. S. Narayanaswamy; Meghana Nasre; Sai Mohith Potluri (Algorithmica, 2023)

Approximation Algorithms for School Assignment: Group Fairness and Multi-criteria Optimization. - Santhini K. A.; Kamesh Munagala; Meghana Nasre; Govind S. Sankar (CoRR, 2024)

Optimal Capacity Modification for Strongly Stable Matchings. - Keshav Ranjan; Meghana Nasre; Prajakta Nimbhorkar (CoRR, 2024)

Popular critical matchings in the many-to-many setting. - Meghana Nasre; Prajakta Nimbhorkar; Keshav Ranjan; Ankita Sarkar (Theor. Comput. Sci., 2024)

Group Fairness and Multi-Criteria Optimization in School Assignment. - Santhini K. A.; Kamesh Munagala; Meghana Nasre; Govind S. Sankar (FORC, 2025)

Generalized Capacity Planning for the Hospital-Residents Problem. - Haricharan Balasundaram; Girija Limaye; Meghana Nasre; Abhinav Raja (CoRR, 2025)

Optimal matchings with one-sided preferences: fixed and cost-based quotas. - Santhini K. A.; Govind S. Sankar; Meghana Nasre (Auton. Agents Multi Agent Syst., 2025)

Stability Notions for Hospital Residents with Sizes. - Haricharan Balasundaram; J. B. Krishnashree; Girija Limaye; Meghana Nasre (CoRR, 2025)