Meghana Nasre

	2011
12		Prabhanjan Ananth, Meghana Nasre, Kanthi K. Sarpatwar: Rainbow Connectivity: Hardness and Tractability. FSTTCS 2011: 241-251
11		Chien-Chung Huang, Telikepalli Kavitha, Dimitrios Michail, Meghana Nasre: Bounded Unpopularity Matchings. Algorithmica 61(3): 738-757 (2011)
10		Prabhanjan Ananth, Meghana Nasre: New Hardness Results in Rainbow Connectivity CoRR abs/1104.2074: (2011)
9		Prabhanjan Ananth, Meghana Nasre, Kanthi K. Sarpatwar: Hardness and Parameterized Algorithms on Rainbow Connectivity problem CoRR abs/1105.0979: (2011)
8		Telikepalli Kavitha, Meghana Nasre: Popular matchings with variable item copies. Theor. Comput. Sci. 412(12-14): 1263-1274 (2011)
7		Telikepalli Kavitha, Julián Mestre, Meghana Nasre: Popular mixed matchings. Theor. Comput. Sci. 412(24): 2679-2690 (2011)
	2010
6		Telikepalli Kavitha, Meghana Nasre, Prajakta Nimbhorkar: Popularity at Minimum Cost. ISAAC (1) 2010: 145-156
5		Telikepalli Kavitha, Meghana Nasre, Prajakta Nimbhorkar: Popularity at Minimum Cost CoRR abs/1009.2591: (2010)
	2009
4		Telikepalli Kavitha, Julián Mestre, Meghana Nasre: Popular Mixed Matchings. ICALP (1) 2009: 574-584
3		Telikepalli Kavitha, Meghana Nasre: Popular Matchings with Variable Job Capacities. ISAAC 2009: 423-433
2		Telikepalli Kavitha, Meghana Nasre: Optimal popular matchings. Discrete Applied Mathematics 157(14): 3181-3186 (2009)
	2008
1		Chien-Chung Huang, Telikepalli Kavitha, Dimitrios Michail, Meghana Nasre: Bounded Unpopularity Matchings. SWAT 2008: 127-137

Coauthor Index

1	Prabhanjan Ananth	[9] [10] [12]
2	Chien-Chung Huang	[1] [11]
3	Telikepalli Kavitha	[1] [2] [3] [4] [5] [6] [7] [8] [11]
4	Julián Mestre	[4] [7]
5	Dimitrios Michail	[1] [11]
6	Prajakta Nimbhorkar	[5] [6]
7	Kanthi K. Sarpatwar	[9] [12]

Colors in the list of coauthors

Last update Sun Jun 3 16:06:10 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page