Product
Help
Pricing
About
Jobs
Log in
Get started
Author
Add to collection
Meghana Nasre
Observed name:
Nasre, Meghana
Institution:
Indian Institute of Technology Madras
Observed institutions:
Indian Institute of Technology Madras,
Indian Institute of Science Bangalore,
The University of Texas at Austin
ORCID:
0000-0003-0290-4444
Observed ORCID:
0000-0003-0290-4444
OpenAlex ID:
A5022225101
Popular Mixed Matchings
2009
·
Telikepalli Kavitha
, Julián Mestre
, et al.
·
Lecture notes in computer science
·
93
PDF
Betweenness Centrality – Incremental and Faster
2014
·
Meghana Nasre
, Matteo Pontecorvi
, et al.
·
Lecture notes in computer science
·
51
Enumerating all possible biosynthetic pathways in metabolic networks
2018
·
Aarthi Ravikrishnan
, Meghana Nasre
, et al.
·
Scientific Reports
·
46
PDF
Optimal popular matchings
2009
·
Telikepalli Kavitha
, Meghana Nasre
·
Discrete Applied Mathematics
·
42
Rainbow Connectivity: Hardness and Tractability
2011
·
Ananth, Prabhanjan
, Nasre, Meghana
, et al.
·
NOT FOUND REPOSITORY (Indian Institute of Science Bangalore)
·
30
PDF
Bounded Unpopularity Matchings
2008
·
Chien-Chung Huang
, Telikepalli Kavitha
, et al.
·
Lecture notes in computer science
·
21
New Hardness Results in Rainbow Connectivity
2011
·
Ananth, Prabhanjan
, Nasre, Meghana
·
arXiv (Cornell University)
·
18
PDF
Popular Matchings with Lower Quotas
2018
·
Nasre, Meghana
, Nimbhorkar, Prajakta
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
·
13
PDF
Bounded Unpopularity Matchings
2010
·
Chien-Chung Huang
, Telikepalli Kavitha
, et al.
·
Algorithmica
·
13
Popularity at minimum cost
2012
·
Telikepalli Kavitha
, Meghana Nasre
, et al.
·
Journal of Combinatorial Optimization
·
11
Popular matchings with variable item copies
2011
·
Telikepalli Kavitha
, Meghana Nasre
·
Theoretical Computer Science
·
11
Popular Matchings with Variable Job Capacities
2009
·
Telikepalli Kavitha
, Meghana Nasre
·
Lecture notes in computer science
·
11
Envy-Freeness and Relaxed Stability: Hardness and Approximation Algorithms
2020
·
Prem Krishnaa
, Girija Limaye
, et al.
·
Lecture notes in computer science
·
10
Matchings with Group Fairness Constraints: Online and Offline Algorithms
2021
·
Govind S. Sankar
, Anand Louis
, et al.
·
International Joint Conference on Artificial Intelligence
·
9
PDF
How Good Are Popular Matchings?
2018
·
A M, Krishnapriya
, Nasre, Meghana
, et al.
·
arXiv (Cornell University)
·
9
PDF
Popular Matchings: Structure and Strategic Issues
2014
·
Meghana Nasre
·
SIAM Journal on Discrete Mathematics
·
9
Popularity in the Generalized Hospital Residents Setting
2017
·
Meghana Nasre
, Amit Rawat
·
Lecture notes in computer science
·
8
Envy-freeness and relaxed stability: hardness and approximation algorithms
2022
·
Prem Krishnaa
, Girija Limaye
, et al.
·
Journal of Combinatorial Optimization
·
7
Decremental All-Pairs ALL Shortest Paths and Betweenness Centrality
2014
·
Meghana Nasre
, Matteo Pontecorvi
, et al.
·
Lecture notes in computer science
·
7
Facility Location on Planar Graphs with Unreliable Links
2018
·
N. S. Narayanaswamy
, Meghana Nasre
, et al.
·
Lecture notes in computer science
·
6
Rank-Maximal Matchings – Structure and Algorithms
2014
·
Pratik Ghosal
, Meghana Nasre
, et al.
·
Lecture notes in computer science
·
6
Many-to-One Popular Matchings with Two-Sided Preferences and One-Sided Ties
2019
·
Kavitha Gopal
, Meghana Nasre
, et al.
·
Lecture notes in computer science
·
5
Classified Rank-Maximal Matchings and Popular Matchings – Algorithms and Hardness
2019
·
Meghana Nasre
, Prajakta Nimbhorkar
, et al.
·
Lecture notes in computer science
·
5
Popular Matching with Lower Quotas
2017
·
Nasre, Meghana
, Nimbhorkar, Prajakta
·
arXiv (Cornell University)
·
5
PDF
Popular Matchings -- structure and cheating strategies
2013
·
Nasre, Meghana
·
arXiv (Cornell University)
·
5
PDF
Show more works
View as search
Works count:
59
Citation count:
494
H-index:
11
I10-index:
13
Year
Topic
Type
