ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

Browse by Author

Up a level
Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Group by: Item Type | No Grouping
Number of items: 29.

Book Chapter

Kavitha, Telikepalli and Mestre, Julian and Nasre, Meghana (2009) Popular Mixed Matchings. [Book Chapter]

Kavitha, Telikepalli and Shah, Chintan D (2006) Efficient algorithms for weighted rank-maximal matchings and related problems. [Book Chapter]

Conference Proceedings

Bhalgat, Anand and Hariharan, Ramesh and Kavitha, Telikepalli and Panigrahi, Debmalya (2007) An (O)over-tilde(mn) Gomory-Hu Tree Construction Algorithm for Unweighted Graphs. In: ACM, Jun 11-13, San Diegeo, pp. 605-614.

Conference Paper

Kavitha, Telikepalli and Mestre, Julian (2009) Max-Coloring Paths: Tight Bounds and Extensions. In: 20th International Symposium on Algorithms and Computations (ISAAC 2009), DEC 16-18, 2009, Honolulu, pp. 87-96.

Kavitha, Telikepalli and Nasre, Meghana (2009) Popular Matchings with Variable Job Capacities. In: 20th International Symposium on Algorithms and Computations (ISAAC 2009), DEC 16-18, 2009, Honolulu, pp. 423-433.

Kavitha, Telikepalli (2008) Dynamic matrix rank with partial lookahead. In: Foundations of Software Technology and Theoretical Computer Science (Bangalore) 2008, 05.12.2008.

Bhalgat, Anand and Hariharan, Ramesh and Kavitha, Telikepalli and Panigrahi, Debmalya (2008) Fast edge splitting and Edmonds' arborescence construction for unweighted graphs. In: SODA '08 Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms, Philadelphia, PA.

Haeupler, Bernhard and Kavitha, Telikepalli and Mathew, Rogers and Sen, Siddhartha (2008) Faster Algorithms for Incremental Topological Ordering.Robert Tarjan. In: ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I, Berlin, Heidelberg.

Kavitha, Telikepalli (2008) On a Special Co-cycle Basis of Graphs. In: 11th Scandinavian Workshop on Algorithm Theory (SWAT 2008), JUL 02-04, 2008, Gothenburg.

Hariharan, Ramesh and Kavitha, Telikepalli and Panigrahi, Debmalya (2007) Efficient Algorithms for Computing All Low s-t Edge Connectivities and Related Problems. In: SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms, Philadelphia, PA.

Kavitha, Telikepalli (2007) Faster algorithms for all-pairs small stretch distances in weighted graphs. In: Proceedings of Foundations of Software Software Technology and Theoretical Computer Science FSTTCS 2007.

Kavitha, Telikepalli and Mehlhorn, Kurt and Michail, Dimitrios (2007) New approximation algorithms for minimum cycle bases of graphs. In: 24th Annual Symposium on Theoretical Aspects of Computer Science, FEB 22-24, 2007, Aachen.

Bhalgat, Anand and Hariharan, Ramesh and Kavitha, Telikepalli and Panigrahi, Debmalya (2007) An O(mn) Gomory-Hu Tree Construction Algorithm for Unweighted Graphs. In: STOC '07 Proceedings of the thirty-ninth annual ACM symposium on Theory of computing, New York, NY.

Hariharan, Ramesh and Kavitha, Telikepalli and Mehlhorn, Kurt (2006) A Faster Deterministic Algorithm for Minimum Cycle Bases in Directed Graphs. In: 33rd ICALP 2006, 10 July 2006, Venice, Italy, pp. 250-261.

Kavitha, Telikepalli (2005) An $\~{O}(m^2n)$ randomized algorithm to compute a minimum cycle basis of a directed graph. In: ICALP, Jul 11-15 2005, Lisbon, Portugal, pp. 273-284.

Journal Article

Haeupler, Bernhard and Kavitha, Telikepalli and Mathew, Rogers and Sen, Siddhartha and Tarjan, Robert E (2012) Incremental Cycle Detection, Topological Ordering, and Strong Component Maintenance. In: ACM TRANSACTIONS ON ALGORITHMS, 8 (1).

Huang, Chien-Chung and Kavitha, Telikepalli and Michail, Dimitrios and Nasre, Meghana (2011) Bounded Unpopularity Matchings. In: Algorithmica, 61 (3). pp. 738-757.

Kavitha, Telikepalli and Mestre, Julian and Nasre, Meghana (2011) Popular mixed matchings. In: Theoretical Computer Science, 412 (24). pp. 2679-2690.

Kavitha, Telikepalli and Mehlhorn, Kurt and Michail, Dimitrios (2011) New Approximation Algorithms for Minimum Cycle Bases of Graphs. In: Algorithmica, 59 (4). pp. 471-488.

Kavitha, Telikepalli and Nasre, Meghana (2011) Popular matchings with variable item copies. In: Theoretical Computer Science, 412 (12-14). pp. 1263-1274.

Baswana, Surender and Kavitha, Telikepalli and Mehlhorn, Kurt and Pettie, Seth (2011) Additive Spanners and (alpha, beta)-Spanners. In: ACM Transactions on Algorithms, 7 (1).

Abraham, David J and Kavitha, Telikepalli (2010) Voting Paths. In: Siam Journal On DiscreteMathematics, 24 (2). pp. 520-537.

Baswana, Surender and Kavitha, Telikepalli (2010) Faster Algorithms for All-pairs Approximate Shortest Paths in Undirected Graphs. In: SIAM Journal on Computing, 39 (7). pp. 2865-2896.

Kavitha, Telikepalli and Nasre, Meghana (2009) Optimal popular matchings. In: Discrete Applied Mathematics, 157 (14). pp. 3181-3186.

Kavitha, Telikepalli and Mehlhorn, Kurt and Michail, Dimitrios and Paluch, Katarzyna E (2008) An (O)over-tilde (m(2)n) Algorithm for Minimum Cycle Basis of Graphs. In: Algorithmica, 52 (3). pp. 333-349.

Hariharan, Ramesh and Kavitha, Telikepalli and Mehlhorn, Kurt (2008) Faster Algorithms for Minimum Cycle Basis in Directed Graphs. In: SIAM JOURNAL ON COMPUTING, 38 (4). pp. 1430-1447.

Kavitha, Telikepalli (2007) Linear time algorithms for Abelian group isomorphism and related problems. In: Journal of Computer and System Sciences, 73 (6). pp. 986-996.

Kavitha, Telikepalli and Mehlhorn, Kurt (2007) Algorithms to Compute Minimum Cycle Basis in Directed Graphs. In: Theory of Computing Systems, 40 (4). pp. 485-505.

Abraham, David J and Irving, Robert W and Kavitha, Telikepalli and Mehlhorn, Kurt (2007) Popular Matchings. In: SIAM Journal on Computing, 37 (4). pp. 1030-1045.

This list was generated on Fri Oct 31 18:08:52 2014 IST.