default search action
Meghana Nasre
Person information
- affiliation: IIT Madras, Chennai, India
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j11]Meghana Nasre, Prajakta Nimbhorkar, Keshav Ranjan
, Ankita Sarkar:
Popular critical matchings in the many-to-many setting. Theor. Comput. Sci. 982: 114281 (2024) - [i19]Santhini K. A., Kamesh Munagala, Meghana Nasre, Govind S. Sankar:
Approximation Algorithms for School Assignment: Group Fairness and Multi-criteria Optimization. CoRR abs/2403.15623 (2024) - 2023
- [j10]Manas Jyoti Kashyop
Trade-Offs in Dynamic Coloring for Bipartite and General Graphs. Algorithmica 85(4): 854-878 (2023) - [j9]Prem Krishnaa, Girija Limaye, Meghana Nasre, Prajakta Nimbhorkar:
Envy-freeness and relaxed stability: hardness and approximation algorithms. J. Comb. Optim. 45(1): 41 (2023) - [c24]Anand Louis
Online Algorithms for Matchings with Proportional Fairness Constraints and Diversity Constraints. ECAI 2023: 1601-1608 - [c23]Santhini K. A.
Matchings under One-Sided Preferences with Soft Quotas. IJCAI 2023: 2774-2782 - [c22]Girija Limaye, Meghana Nasre:
Optimal Cost-Based Allocations Under Two-Sided Preferences. IWOCA 2023: 259-270 - [c21]Meghana Nasre, Prajakta Nimbhorkar, Keshav Ranjan:
Critical Relaxed Stable Matchings with Two-Sided Ties. WG 2023: 447-461 - [i18]Meghana Nasre, Prajakta Nimbhorkar, Keshav Ranjan:
Critical Relaxed Stable Matchings with Two-Sided Ties. CoRR abs/2303.12325 (2023) - 2022
- [c20]Santhini K. A., Govind S. Sankar, Meghana Nasre:
Optimal Matchings with One-Sided Preferences: Fixed and Cost-Based Quotas. AAMAS 2022: 696-704 - [i17]Meghana Nasre, Prajakta Nimbhorkar, Keshav Ranjan:
Popular Critical Matchings in the Many-to-Many Setting. CoRR abs/2206.12394 (2022) - [i16]Govind S. Sankar, Anand Louis, Meghana Nasre, Prajakta Nimbhorkar:
Matchings Under Diversity Constraints. CoRR abs/2208.11378 (2022) - 2021
- [c19]Meghana Nasre, Prajakta Nimbhorkar, Keshav Ranjan, Ankita Sarkar
Popular Matchings in the Hospital-Residents Problem with Two-Sided Lower Quotas. FSTTCS 2021: 30:1-30:21 - [c18]Govind S. Sankar
Matchings with Group Fairness Constraints: Online and Offline Algorithms. IJCAI 2021: 377-383 - [i15]Girija Limaye, Meghana Nasre:
Stable Matchings with Flexible Quotas. CoRR abs/2101.04425 (2021) - [i14]Govind S. Sankar, Anand Louis, Meghana Nasre, Prajakta Nimbhorkar:
Matchings with Group Fairness Constraints: Online and Offline Algorithms. CoRR abs/2105.09522 (2021) - 2020
- [c17]Prem Krishnaa, Girija Limaye, Meghana Nasre, Prajakta Nimbhorkar
Envy-Freeness and Relaxed Stability: Hardness and Approximation Algorithms. SAGT 2020: 193-208
2010 – 2019
- 2019
- [j8]Pratik Ghosal
Rank-maximal matchings - structure and algorithms. Theor. Comput. Sci. 767: 73-82 (2019) - [c16]Kavitha Gopal, Meghana Nasre, Prajakta Nimbhorkar
Many-to-One Popular Matchings with Two-Sided Preferences and One-Sided Ties. COCOON 2019: 193-205 - [c15]Akshay Utture, Vedant Somani, Prem Krishnaa, Meghana Nasre:
Student Course Allocation with Constraints. SEA² 2019: 51-68 - [c14]Meghana Nasre, Prajakta Nimbhorkar
Classified Rank-Maximal Matchings and Popular Matchings - Algorithms and Hardness. WG 2019: 244-257 - [i13]Manas Jyoti Kashyop, N. S. Narayanaswamy, Meghana Nasre, Sai Mohith Potluri:
Dynamic coloring for Bipartite and General Graphs. CoRR abs/1909.07854 (2019) - [i12]Prem Krishnaa, Girija Limaye, Meghana Nasre, Prajakta Nimbhorkar:
Maximum-Size Envy-free Matchings. CoRR abs/1910.07159 (2019) - 2018
- [c13]N. S. Narayanaswamy, Meghana Nasre, R. Vijayaragunathan
Facility Location on Planar Graphs with Unreliable Links. CSR 2018: 269-281 - [c12]Krishnapriya A. M, Meghana Nasre, Prajakta Nimbhorkar
How Good Are Popular Matchings?. SEA 2018: 9:1-9:14 - [i11]Krishnapriya A. M, Meghana Nasre, Prajakta Nimbhorkar, Amit Rawat:
How good are Popular Matchings? CoRR abs/1805.01311 (2018) - [i10]Meghana Nasre, Prajakta Nimbhorkar, Nada Pulath:
Dichotomy Results for Classified Rank-Maximal Matchings and Popular Matchings. CoRR abs/1805.02851 (2018) - 2017
- [c11]Meghana Nasre
Popularity in the Generalized Hospital Residents Setting. CSR 2017: 245-259 - [c10]Meghana Nasre
Popular Matchings with Lower Quotas. FSTTCS 2017: 44:1-44:15 - [i9]Meghana Nasre, Prajakta Nimbhorkar:
Popular Matching with Lower Quotas. CoRR abs/1704.07546 (2017) - 2016
- [j7]Sreekanth Gorla, Meghana Nasre
List Coloring of Planar Graphs with Forbidden Cycles. Electron. Notes Discret. Math. 55: 117-121 (2016) - [i8]Meghana Nasre, Amit Rawat:
Popularity in the generalized Hospital Residents Setting. CoRR abs/1609.07650 (2016) - 2014
- [j6]Telikepalli Kavitha, Meghana Nasre
Popularity at minimum cost. J. Comb. Optim. 27(3): 574-596 (2014) - [j5]Meghana Nasre
Popular Matchings: Structure and Strategic Issues. SIAM J. Discret. Math. 28(3): 1423-1448 (2014) - [c9]Pratik Ghosal
Rank-Maximal Matchings - Structure and Algorithms. ISAAC 2014: 593-605 - [c8]Meghana Nasre
Decremental All-Pairs ALL Shortest Paths and Betweenness Centrality. ISAAC 2014: 766-778 - [c7]Meghana Nasre
Betweenness Centrality - Incremental and Faster. MFCS (2) 2014: 577-588 - [i7]Pratik Ghosal, Meghana Nasre, Prajakta Nimbhorkar:
Rank Maximal Matchings - Structure and Algorithms. CoRR abs/1409.4977 (2014) - [i6]Meghana Nasre, Matteo Pontecorvi, Vijaya Ramachandran:
Decremental All-Pairs ALL Shortest Paths and Betweenness Centrality. CoRR abs/1411.4073 (2014) - 2013
- [c6]Meghana Nasre
Popular Matchings: Structure and Cheating Strategies. STACS 2013: 412-423 - [i5]Meghana Nasre:
Popular Matchings -- structure and cheating strategies. CoRR abs/1301.0902 (2013) - [i4]Meghana Nasre, Matteo Pontecorvi, Vijaya Ramachandran:
Betweenness Centrality - Incremental and Faster. CoRR abs/1311.2147 (2013) - 2011
- [j4]Chien-Chung Huang, Telikepalli Kavitha, Dimitrios Michail
Bounded Unpopularity Matchings. Algorithmica 61(3): 738-757 (2011) - [j3]Telikepalli Kavitha, Meghana Nasre
Popular matchings with variable item copies. Theor. Comput. Sci. 412(12-14): 1263-1274 (2011) - [j2]Telikepalli Kavitha, Julián Mestre, Meghana Nasre
Popular mixed matchings. Theor. Comput. Sci. 412(24): 2679-2690 (2011) - [c5]Prabhanjan Ananth, Meghana Nasre
Rainbow Connectivity: Hardness and Tractability. FSTTCS 2011: 241-251 - [i3]Prabhanjan Ananth, Meghana Nasre:
New Hardness Results in Rainbow Connectivity. CoRR abs/1104.2074 (2011) - [i2]Prabhanjan Ananth, Meghana Nasre, Kanthi K. Sarpatwar:
Hardness and Parameterized Algorithms on Rainbow Connectivity problem. CoRR abs/1105.0979 (2011) - 2010
- [c4]Telikepalli Kavitha, Meghana Nasre
Popularity at Minimum Cost. ISAAC (1) 2010: 145-156 - [i1]Telikepalli Kavitha, Meghana Nasre, Prajakta Nimbhorkar:
Popularity at Minimum Cost. CoRR abs/1009.2591 (2010)
2000 – 2009
- 2009
- [j1]Telikepalli Kavitha, Meghana Nasre
Optimal popular matchings. Discret. Appl. Math. 157(14): 3181-3186 (2009) - [c3]Telikepalli Kavitha, Julián Mestre, Meghana Nasre
Popular Mixed Matchings. ICALP (1) 2009: 574-584 - [c2]Telikepalli Kavitha, Meghana Nasre
Popular Matchings with Variable Job Capacities. ISAAC 2009: 423-433 - 2008
- [c1]Chien-Chung Huang, Telikepalli Kavitha, Dimitrios Michail
Bounded Unpopularity Matchings. SWAT 2008: 127-137
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:53 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: