Meghana Nasre

Publication Activity (10 Years)

Years Active: 2008-2024
Publications (10 Years): 32

Top Topics

Betweenness Centrality

Top Venues

J. Comb. Optim.

Publications

Santhini K. A., Kamesh Munagala, Meghana Nasre, Govind S. Sankar
Approximation Algorithms for School Assignment: Group Fairness and Multi-criteria Optimization. CoRR (2024)
Meghana Nasre, Prajakta Nimbhorkar, Keshav Ranjan, Ankita Sarkar
Popular critical matchings in the many-to-many setting. Theor. Comput. Sci. 982 (2024)
Prem Krishnaa, Girija Limaye, Meghana Nasre, Prajakta Nimbhorkar
Envy-freeness and relaxed stability: hardness and approximation algorithms. J. Comb. Optim. 45 (1) (2023)
Meghana Nasre, Prajakta Nimbhorkar, Keshav Ranjan
Critical Relaxed Stable Matchings with Two-Sided Ties. CoRR (2023)
Anand Louis, Meghana Nasre, Prajakta Nimbhorkar, Govind S. Sankar
Online Algorithms for Matchings with Proportional Fairness Constraints and Diversity Constraints. ECAI (2023)
Girija Limaye, Meghana Nasre
Optimal Cost-Based Allocations Under Two-Sided Preferences. IWOCA (2023)
Manas Jyoti Kashyop, N. S. Narayanaswamy, Meghana Nasre, Sai Mohith Potluri
Trade-Offs in Dynamic Coloring for Bipartite and General Graphs. Algorithmica 85 (4) (2023)
Meghana Nasre, Prajakta Nimbhorkar, Keshav Ranjan
Critical Relaxed Stable Matchings with Two-Sided Ties. WG (2023)
Santhini K. A., Raghu Raman Ravi, Meghana Nasre
Matchings under One-Sided Preferences with Soft Quotas. IJCAI (2023)
Govind S. Sankar, Anand Louis, Meghana Nasre, Prajakta Nimbhorkar
Matchings Under Diversity Constraints. CoRR (2022)
Meghana Nasre, Prajakta Nimbhorkar, Keshav Ranjan
Popular Critical Matchings in the Many-to-Many Setting. CoRR (2022)
Santhini K. A., Govind S. Sankar, Meghana Nasre
Optimal Matchings with One-Sided Preferences: Fixed and Cost-Based Quotas. AAMAS (2022)
Govind S. Sankar, Anand Louis, Meghana Nasre, Prajakta Nimbhorkar
Matchings with Group Fairness Constraints: Online and Offline Algorithms. IJCAI (2021)
Meghana Nasre, Prajakta Nimbhorkar, Keshav Ranjan, Ankita Sarkar
Popular Matchings in the Hospital-Residents Problem with Two-Sided Lower Quotas. FSTTCS (2021)
Govind S. Sankar, Anand Louis, Meghana Nasre, Prajakta Nimbhorkar
Matchings with Group Fairness Constraints: Online and Offline Algorithms. CoRR (2021)
Girija Limaye, Meghana Nasre
Stable Matchings with Flexible Quotas. CoRR (2021)
Prem Krishnaa, Girija Limaye, Meghana Nasre, Prajakta Nimbhorkar
Envy-Freeness and Relaxed Stability: Hardness and Approximation Algorithms. SAGT (2020)
Meghana Nasre, Prajakta Nimbhorkar, Nada Pulath
Classified Rank-Maximal Matchings and Popular Matchings - Algorithms and Hardness. WG (2019)
Akshay Utture, Vedant Somani, Prem Krishnaa, Meghana Nasre
Student Course Allocation with Constraints. SEA² (2019)
Pratik Ghosal, Meghana Nasre, Prajakta Nimbhorkar
Rank-maximal matchings - structure and algorithms. Theor. Comput. Sci. 767 (2019)
Prem Krishnaa, Girija Limaye, Meghana Nasre, Prajakta Nimbhorkar
Maximum-Size Envy-free Matchings. CoRR (2019)
Kavitha Gopal, Meghana Nasre, Prajakta Nimbhorkar, T. Pradeep Reddy
Many-to-One Popular Matchings with Two-Sided Preferences and One-Sided Ties. COCOON (2019)
Manas Jyoti Kashyop, N. S. Narayanaswamy, Meghana Nasre, Sai Mohith Potluri
Dynamic coloring for Bipartite and General Graphs. CoRR (2019)
Krishnapriya A. M, Meghana Nasre, Prajakta Nimbhorkar, Amit Rawat
How good are Popular Matchings? CoRR (2018)
Meghana Nasre, Prajakta Nimbhorkar, Nada Pulath
Dichotomy Results for Classified Rank-Maximal Matchings and Popular Matchings. CoRR (2018)
N. S. Narayanaswamy, Meghana Nasre, R. Vijayaragunathan
Facility Location on Planar Graphs with Unreliable Links. CSR (2018)
Krishnapriya A. M, Meghana Nasre, Prajakta Nimbhorkar, Amit Rawat
How Good Are Popular Matchings?. SEA (2018)
Meghana Nasre, Prajakta Nimbhorkar
Popular Matchings with Lower Quotas. FSTTCS (2017)
Meghana Nasre, Prajakta Nimbhorkar
Popular Matching with Lower Quotas. CoRR (2017)
Meghana Nasre, Amit Rawat
Popularity in the Generalized Hospital Residents Setting. CSR (2017)
Meghana Nasre, Amit Rawat
Popularity in the generalized Hospital Residents Setting. CoRR (2016)
Sreekanth Gorla, Meghana Nasre
List Coloring of Planar Graphs with Forbidden Cycles. Electron. Notes Discret. Math. 55 (2016)
Meghana Nasre, Matteo Pontecorvi, Vijaya Ramachandran
Decremental All-Pairs ALL Shortest Paths and Betweenness Centrality. CoRR (2014)
Telikepalli Kavitha, Meghana Nasre, Prajakta Nimbhorkar
Popularity at minimum cost. J. Comb. Optim. 27 (3) (2014)
Pratik Ghosal, Meghana Nasre, Prajakta Nimbhorkar
Rank Maximal Matchings - Structure and Algorithms. CoRR (2014)
Meghana Nasre
Popular Matchings: Structure and Strategic Issues. SIAM J. Discret. Math. 28 (3) (2014)
Meghana Nasre, Matteo Pontecorvi, Vijaya Ramachandran
Decremental All-Pairs ALL Shortest Paths and Betweenness Centrality. ISAAC (2014)
Pratik Ghosal, Meghana Nasre, Prajakta Nimbhorkar
Rank-Maximal Matchings - Structure and Algorithms. ISAAC (2014)
Meghana Nasre, Matteo Pontecorvi, Vijaya Ramachandran
Betweenness Centrality - Incremental and Faster. MFCS (2) (2014)
Meghana Nasre
Popular Matchings -- structure and cheating strategies CoRR (2013)
Meghana Nasre
Popular Matchings: Structure and Cheating Strategies. STACS (2013)
Meghana Nasre, Matteo Pontecorvi, Vijaya Ramachandran
Betweenness Centrality - Incremental and Faster. CoRR (2013)
Telikepalli Kavitha, Julián Mestre, Meghana Nasre
Popular mixed matchings. Theor. Comput. Sci. 412 (24) (2011)
Prabhanjan Ananth, Meghana Nasre, Kanthi K. Sarpatwar
Hardness and Parameterized Algorithms on Rainbow Connectivity problem CoRR (2011)
Prabhanjan Ananth, Meghana Nasre, Kanthi K. Sarpatwar
Rainbow Connectivity: Hardness and Tractability. FSTTCS (2011)
Chien-Chung Huang, Telikepalli Kavitha, Dimitrios Michail, Meghana Nasre
Bounded Unpopularity Matchings. Algorithmica 61 (3) (2011)
Telikepalli Kavitha, Meghana Nasre
Popular matchings with variable item copies. Theor. Comput. Sci. 412 (12-14) (2011)
Prabhanjan Ananth, Meghana Nasre
New Hardness Results in Rainbow Connectivity CoRR (2011)
Telikepalli Kavitha, Meghana Nasre, Prajakta Nimbhorkar
Popularity at Minimum Cost. ISAAC (1) (2010)
Telikepalli Kavitha, Meghana Nasre, Prajakta Nimbhorkar
Popularity at Minimum Cost CoRR (2010)
Telikepalli Kavitha, Julián Mestre, Meghana Nasre
Popular Mixed Matchings. ICALP (1) (2009)
Telikepalli Kavitha, Meghana Nasre
Optimal popular matchings. Discret. Appl. Math. 157 (14) (2009)
Telikepalli Kavitha, Meghana Nasre
Popular Matchings with Variable Job Capacities. ISAAC (2009)
Chien-Chung Huang, Telikepalli Kavitha, Dimitrios Michail, Meghana Nasre
Bounded Unpopularity Matchings. SWAT (2008)