Meghana Nasre

According to our database, Meghana Nasre authored at least 40 papers between 2009 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Popular critical matchings in the many-to-many setting.

Meghana Nasre, Prajakta Nimbhorkar, Keshav Ranjan, Ankita Sarkar

Theor. Comput. Sci., January, 2024

Approximation Algorithms for School Assignment: Group Fairness and Multi-criteria Optimization.

Santhini K. A., Kamesh Munagala, Meghana Nasre, Govind S. Sankar

CoRR, 2024

2023

Trade-Offs in Dynamic Coloring for Bipartite and General Graphs.

Manas Jyoti Kashyop, N. S. Narayanaswamy, Meghana Nasre, Sai Mohith Potluri

Algorithmica, April, 2023

Envy-freeness and relaxed stability: hardness and approximation algorithms.

Prem Krishnaa, Girija Limaye, Meghana Nasre, Prajakta Nimbhorkar

J. Comb. Optim., 2023

Critical Relaxed Stable Matchings with Two-Sided Ties.

Meghana Nasre, Prajakta Nimbhorkar, Keshav Ranjan

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2023

Optimal Cost-Based Allocations Under Two-Sided Preferences.

Girija Limaye, Meghana Nasre

Proceedings of the Combinatorial Algorithms - 34th International Workshop, 2023

Matchings under One-Sided Preferences with Soft Quotas.

Santhini K. A., Raghu Raman Ravi, Meghana Nasre

Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

Online Algorithms for Matchings with Proportional Fairness Constraints and Diversity Constraints.

Anand Louis, Meghana Nasre, Prajakta Nimbhorkar, Govind S. Sankar

Proceedings of the ECAI 2023 - 26th European Conference on Artificial Intelligence, September 30 - October 4, 2023, Kraków, Poland, 2023

2022

Matchings Under Diversity Constraints.

Govind S. Sankar, Anand Louis, Meghana Nasre, Prajakta Nimbhorkar

CoRR, 2022

Popular Critical Matchings in the Many-to-Many Setting.

Meghana Nasre, Prajakta Nimbhorkar, Keshav Ranjan

CoRR, 2022

Optimal Matchings with One-Sided Preferences: Fixed and Cost-Based Quotas.

Santhini K. A., Govind S. Sankar, Meghana Nasre

Proceedings of the 21st International Conference on Autonomous Agents and Multiagent Systems, 2022

2021

Stable Matchings with Flexible Quotas.

Girija Limaye, Meghana Nasre

CoRR, 2021

Matchings with Group Fairness Constraints: Online and Offline Algorithms.

Govind S. Sankar, Anand Louis, Meghana Nasre, Prajakta Nimbhorkar

Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, 2021

Popular Matchings in the Hospital-Residents Problem with Two-Sided Lower Quotas.

Meghana Nasre, Prajakta Nimbhorkar, Keshav Ranjan, Ankita Sarkar

Proceedings of the 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2021

2019

Rank-maximal matchings - structure and algorithms.

Pratik Ghosal, Meghana Nasre, Prajakta Nimbhorkar

Theor. Comput. Sci., 2019

Maximum-Size Envy-free Matchings.

Prem Krishnaa, Girija Limaye, Meghana Nasre, Prajakta Nimbhorkar

CoRR, 2019

Dynamic coloring for Bipartite and General Graphs.

Manas Jyoti Kashyop, N. S. Narayanaswamy, Meghana Nasre, Sai Mohith Potluri

CoRR, 2019

Classified Rank-Maximal Matchings and Popular Matchings - Algorithms and Hardness.

Meghana Nasre, Prajakta Nimbhorkar, Nada Pulath

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2019

Student Course Allocation with Constraints.

Akshay Utture, Vedant Somani, Prem Krishnaa, Meghana Nasre

Proceedings of the Analysis of Experimental Algorithms - Special Event, 2019

Many-to-One Popular Matchings with Two-Sided Preferences and One-Sided Ties.

Kavitha Gopal, Meghana Nasre, Prajakta Nimbhorkar, T. Pradeep Reddy

Proceedings of the Computing and Combinatorics - 25th International Conference, 2019

2018

Dichotomy Results for Classified Rank-Maximal Matchings and Popular Matchings.

Meghana Nasre, Prajakta Nimbhorkar, Nada Pulath

CoRR, 2018

How Good Are Popular Matchings?.

Krishnapriya A. M, Meghana Nasre, Prajakta Nimbhorkar, Amit Rawat

Proceedings of the 17th International Symposium on Experimental Algorithms, 2018

Facility Location on Planar Graphs with Unreliable Links.

N. S. Narayanaswamy, Meghana Nasre, R. Vijayaragunathan

Proceedings of the Computer Science - Theory and Applications, 2018

2017

Popular Matching with Lower Quotas.

Meghana Nasre, Prajakta Nimbhorkar

CoRR, 2017

Popular Matchings with Lower Quotas.

Meghana Nasre, Prajakta Nimbhorkar

Proceedings of the 37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2017

Popularity in the Generalized Hospital Residents Setting.

Meghana Nasre, Amit Rawat

Proceedings of the Computer Science - Theory and Applications, 2017

2016

List Coloring of Planar Graphs with Forbidden Cycles.

Sreekanth Gorla, Meghana Nasre

Electron. Notes Discret. Math., 2016

2014

Popular Matchings: Structure and Strategic Issues.

Meghana Nasre

SIAM J. Discret. Math., 2014

Popularity at minimum cost.

Telikepalli Kavitha, Meghana Nasre, Prajakta Nimbhorkar

J. Comb. Optim., 2014

Betweenness Centrality - Incremental and Faster.

Meghana Nasre, Matteo Pontecorvi, Vijaya Ramachandran

Proceedings of the Mathematical Foundations of Computer Science 2014, 2014

Decremental All-Pairs ALL Shortest Paths and Betweenness Centrality.

Meghana Nasre, Matteo Pontecorvi, Vijaya Ramachandran

Proceedings of the Algorithms and Computation - 25th International Symposium, 2014

2013

Popular Matchings: Structure and Cheating Strategies.

Meghana Nasre

Proceedings of the 30th International Symposium on Theoretical Aspects of Computer Science, 2013

2011

Popular matchings with variable item copies.

Telikepalli Kavitha, Meghana Nasre

Theor. Comput. Sci., 2011

Popular mixed matchings.

Telikepalli Kavitha, Julián Mestre, Meghana Nasre

Theor. Comput. Sci., 2011

Hardness and Parameterized Algorithms on Rainbow Connectivity problem

Prabhanjan Ananth, Meghana Nasre, Kanthi K. Sarpatwar

CoRR, 2011

New Hardness Results in Rainbow Connectivity

Prabhanjan Ananth, Meghana Nasre

CoRR, 2011

Bounded Unpopularity Matchings.

Chien-Chung Huang, Telikepalli Kavitha, Dimitrios Michail, Meghana Nasre

Algorithmica, 2011

Rainbow Connectivity: Hardness and Tractability.

Prabhanjan Ananth, Meghana Nasre, Kanthi K. Sarpatwar

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2011

2009

Optimal popular matchings.

Telikepalli Kavitha, Meghana Nasre

Discret. Appl. Math., 2009

Popular Matchings with Variable Job Capacities.

Telikepalli Kavitha, Meghana Nasre

Proceedings of the Algorithms and Computation, 20th International Symposium, 2009