Meghana Nasre.
Meghana Nasre.
Assistant Professor, CSE, IIT Madras, Chennai, India.
Verified email at cse.iitm.ac.in - Homepage
Title
Cited by
Cited by
Year
Popular mixed matchings
T Kavitha, J Mestre, M Nasre
Theoretical Computer Science 412 (24), 2679-2690, 2011
772011
Betweenness centrality–incremental and faster
M Nasre, M Pontecorvi, V Ramachandran
International Symposium on Mathematical Foundations of Computer Science, 577-588, 2014
502014
Optimal popular matchings
T Kavitha, M Nasre
Discrete Applied Mathematics 157 (14), 3181-3186, 2009
492009
Rainbow connectivity: Hardness and tractability
P Ananth, M Nasre, KK Sarpatwar
IARCS Annual Conference on Foundations of Software Technology and …, 2011
302011
Bounded unpopularity matchings
CC Huang, T Kavitha, D Michail, M Nasre
Algorithmica 61 (3), 738-757, 2011
282011
Popular mixed matchings
T Kavitha, J Mestre, M Nasre
International Colloquium on Automata, Languages, and Programming, 574-584, 2009
212009
Enumerating all possible biosynthetic pathways in metabolic networks
A Ravikrishnan, M Nasre, K Raman
Scientific reports 8 (1), 1-11, 2018
202018
A polyhedron with all s—t cuts as vertices, and adjacency of cuts
N Garg, VV Vazirani
Mathematical programming 70 (1), 17-25, 1995
141995
Popular matchings with variable item copies
T Kavitha, M Nasre
Theoretical Computer Science 412 (12-14), 1263-1274, 2011
122011
Popularity in the generalized hospital residents setting
M Nasre, A Rawat
International Computer Science Symposium in Russia, 245-259, 2017
102017
Decremental all-pairs all shortest paths and betweenness centrality
M Nasre, M Pontecorvi, V Ramachandran
International Symposium on Algorithms and Computation, 766-778, 2014
102014
How good are Popular Matchings?
M Nasre, P Nimbhorkar, A Rawat
arXiv preprint arXiv:1805.01311, 2018
92018
Popular Matching with Lower Quotas
M Nasre, P Nimbhorkar
arXiv preprint arXiv:1704.07546, 2017
92017
Popularity at minimum cost
T Kavitha, M Nasre, P Nimbhorkar
Journal of Combinatorial Optimization 27 (3), 574-596, 2014
92014
Popular matchings with variable job capacities
T Kavitha, M Nasre
International Symposium on Algorithms and Computation, 423-433, 2009
92009
Popular matchings: Structure and strategic issues
M Nasre
SIAM Journal on Discrete Mathematics 28 (3), 1423-1448, 2014
82014
Popular Matchings--structure and cheating strategies
M Nasre
arXiv preprint arXiv:1301.0902, 2013
82013
Rank-maximal matchings–structure and algorithms
P Ghosal, M Nasre, P Nimbhorkar
International Symposium on Algorithms and Computation, 593-605, 2014
5*2014
Popularity at minimum cost
T Kavitha, M Nasre, P Nimbhorkar
International Symposium on Algorithms and Computation, 145-156, 2010
52010
Facility location on planar graphs with unreliable links
NS Narayanaswamy, M Nasre, R Vijayaragunathan
International Computer Science Symposium in Russia, 269-281, 2018
42018
The system can't perform the operation now. Try again later.
Articles 1–20