Meghana Nasre - RankMe

62 papers A* 3A 3B 7C 1Misc 3Journal 35Unranked 10

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