Telikepalli Kavitha

Loading Google Thumbnails...
2012
13Efficient algorithms for maximum weight matchings in general graphs with small edge weights. Chien-Chung Huang, Telikepalli Kavitha. SODA 2012, 1400-1412. Web SearchBibTeXDownload
2011
12Bounded Unpopularity Matchings. Chien-Chung Huang, Telikepalli Kavitha, Dimitrios Michail, Meghana Nasre. Algorithmica (61): 738-757 (2011). Web SearchBibTeXDownload
11Near-Popular Matchings in the Roommates Problem. Chien-Chung Huang, Telikepalli Kavitha. ESA 2011, 167-179. Web SearchBibTeXDownload
10Popular Matchings in the Stable Marriage Problem. Chien-Chung Huang, Telikepalli Kavitha. ICALP (1) 2011, 666-677. Web SearchBibTeXDownload
2010
9Assigning Papers to Referees. Naveen Garg, Telikepalli Kavitha, Amit Kumar, Kurt Mehlhorn, Julián Mestre. Algorithmica (58): 119-136 (2010). Web SearchBibTeXDownload
2008
8Fast edge splitting and Edmonds' arborescence construction for unweighted graphs. Anand Bhalgat, Ramesh Hariharan, Telikepalli Kavitha, Debmalya Panigrahi. SODA 2008, 455-464. Web SearchBibTeXDownload
7Bounded Unpopularity Matchings. Chien-Chung Huang, Telikepalli Kavitha, Dimitrios Michail, Meghana Nasre. SWAT 2008, 127-137. Web SearchBibTeXDownload
2007
6Popular Matchings. David J. Abraham, Robert W. Irving, Telikepalli Kavitha, Kurt Mehlhorn. SIAM J. Comput. (37): 1030-1045 (2007). Web SearchBibTeXDownload
5Efficient algorithms for computing all low s-t edge connectivities and related problems. Ramesh Hariharan, Telikepalli Kavitha, Debmalya Panigrahi. SODA 2007, 127-136. Web SearchBibTeXDownload
4An Õ(mn) Gomory-Hu tree construction algorithm for unweighted graphs. Ramesh Hariharan, Telikepalli Kavitha, Debmalya Panigrahi, Anand Bhalgat. STOC 2007, 605-614. Web SearchBibTeXDownload
2006
3Rank-maximal matchings. Robert W. Irving, Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail, Katarzyna E. Paluch. ACM Transactions on Algorithms (2): 602-610 (2006). Web SearchBibTeXDownload
2005
2Popular matchings. David J. Abraham, Robert W. Irving, Telikepalli Kavitha, Kurt Mehlhorn. SODA 2005, 424-432. Web SearchBibTeXDownload
2004
1Rank-maximal matchings. Robert W. Irving, Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail, Katarzyna E. Paluch. SODA 2004, 68-75. Web SearchBibTeXDownload
from DBLP and Google Scholar
Developed by the Database Group at the University of Wisconsin and Yahoo! Research