- Popular matchings with multiple partners.

F. Brandl and T. Kavitha.

In FSTTCS 2017. - New Algorithms for Maximum Weight Matching and a Decomposition Theorem.

C.-C. Huang and T. Kavitha.

In Mathematics of Operations Research, 2017. - Popularity, Mixed Matchings, and Self-duality.

C.-C. Huang and T. Kavitha.

In SODA 2017. - Distributed Construction of Purely Additive Spanners.

K. Censor-Hillel, A. Paz, T. Kavitha, and A. Yehudayoff.

In DISC 2016 (full version in*Distributed Computing*). - Popular Half-Integral Matchings.

T. Kavitha.

In ICALP 2016. - Popular edges and dominant matchings.

Á. Cseh and T. Kavitha.

In IPCO 2016 (full version in*Mathematical Programming, Ser. B*). - Popular matchings with two-sided preferences and one-sided ties.

Á. Cseh, C.-C. Huang, and T. Kavitha.

In ICALP 2015 (full version in*SIAM Journal on Discrete Mathematics*). - Maintaining near-popular matchings.

S. Bhattacharya, M. Hoefer, C.-C. Huang, T. Kavitha, and L. Wagner.

In ICALP 2015. - New pairwise spanners.

T. Kavitha.

Invited to a special issue of*Theory of Computing Systems*on STACS 2015. - An improved algorithm for the stable-marriage problem with one-sided ties.

C.-C. Huang and T. Kavitha.

In IPCO 2014 (full version in*Mathematical Programming, Ser. B*). - Fair matchings and related problems.

C.-C. Huang, T. Kavitha, K. Mehlhorn, and D. Michail.

In FSTTCS 2013 (full version in*Algorithmica*). - Small stretch pairwise spanners.

T. Kavitha and N. M. Varma.

In ICALP 2013 (full version in*SIAM Journal on Discrete Mathematics*). - On pairwise spanners.

M. Cygan, F. Grandoni, and T. Kavitha.

In STACS 2013. - Popularity vs Maximum cardinality in the stable marriage setting.

T. Kavitha.

In SODA 2012 (full version in*SIAM Journal on Computing*). - Efficient Algorithms for Maximum Weight Matchings in General Graphs with Small Edge Weights.

C.-C. Huang and T. Kavitha.

In SODA 2012. - Near-popular matchings in the Roommates problem.

C.-C. Huang and T. Kavitha.

In ESA 2011 (full version in*SIAM Journal on Discrete Mathematics*). - Popular Matchings in the Stable Marriage Problem.

C.-C. Huang and T. Kavitha.

Invited to a special issue of*Information and Computation*on ICALP 2011. - Popularity at minimum cost.

T. Kavitha, M. Nasre, and P. Nimbhorkar.

In ISAAC 2010 (full version in*Journal of Combinatorial Optimization*). - Popular Matchings with variable item capacities.

T. Kavitha and M. Nasre.

In*Theoretical Computer Science, 2011.* - Max-coloring paths: Tight bounds and extensions.

T. Kavitha and J. Mestre.

Invited to a special issue of*Journal of Combinatorial Optimization*on ISAAC 2009. - Popular Mixed Matchings.

T. Kavitha, J. Mestre, and M. Nasre.

Invited to a special issue of*Theoretical Computer Science*on ICALP 2009. - Optimal Popular Matchings.

T. Kavitha and M. Nasre.

In Discrete Applied Mathematics, 2009. - Dynamic matrix rank with partial look-ahead.

T. Kavitha.

In FSTTCS 2008 (full version in*Theory of Computing Systems*). - Faster Algorithms for Incremental Topological Ordering.

B. Haeupler, T. Kavitha, R. Mathew, S. Sen, and R. Tarjan.

In ICALP 2008 (full version in*ACM Transactions on Algorithms*). - On a special co-cycle basis of graphs.

T. Kavitha.

In SWAT 2008 (full version in*Theoretical Computer Science*). - Bounded Unpopularity Matchings.

C.-C. Huang, T. Kavitha, D. Michail, and M. Nasre.

In SWAT 2008 (full version in*Algorithmica*). - Fast Edge Splitting and Edmonds' Arborescence Construction for Unweighted Graphs.

A. Bhalgat, R. Hariharan, T. Kavitha, and D. Panigrahi.

In SODA 2008. - Linear Time Algorithms for Abelian Group Isomorphism and Related Results.

T. Kavitha.

In Journal of Computer and System Sciences, 2007. - Faster Algorithms for All-Pairs Small Stretch Distances in Weighted Graphs.

T. Kavitha.

In FSTTCS 2007 (full version in*Algorithmica*). - An Õ(mn) Gomory-Hu tree construction algorithm for unweighted graphs.

A. Bhalgat, R. Hariharan, T. Kavitha, and D. Panigrahi.

In STOC 2007. - New Approximation Algorithms for Minimum Cycle Bases of Graphs.

T. Kavitha, K. Mehlhorn, and D. Michail.

In STACS 2007 (full version in*Algorithmica*). - Efficient Algorithms for computing all low s-t connectivities and Related Problems.

R. Hariharan, T. Kavitha, and D. Panigrahi.

In SODA 2007. - Efficient Algorithms for Weighted Rank-Maximal Matchings and Related Problems.

T. Kavitha and C. Shah.

In ISAAC 2006. - Faster Algorithms for Approximate Distance Oracles and All-Pairs Small Stretch Paths.

S. Baswana and T. Kavitha.

In FOCS 2006 (full version in*SIAM Journal on Computing*). - A Faster Deterministic Algorithm for Minimum Cycle Bases in Directed Graphs.

R. Hariharan, T. Kavitha, and K. Mehlhorn.

In ICALP 2006 (full version in*SIAM Journal on Computing*). - Dynamic Matching Markets and Voting Paths.

D. J. Abraham and T. Kavitha.

In SWAT 2006 (full version in*SIAM Journal on Discrete Mathematics*). - An Õ(m^2n) Randomized Algorithm to Compute a Minimum Cycle Basis of a Directed Graph.

T. Kavitha.

In ICALP 2005. - A Polynomial Time Algorithm for Minimum Cycle Basis in directed graphs.

T. Kavitha and K. Mehlhorn.

Invited to a special issue of*Theory of Computing Systems*on STACS 2005. - Efficient Construction of (α,β)-Spanners and Purely Additive Spanners.

S. Baswana, T. Kavitha, K. Mehlhorn, and S. Pettie.

In SODA 2005 (full version in*ACM Transactions on Algorithms*). - Popular Matchings.

D. J. Abraham, R. W. Irving, T. Kavitha, and K. Mehlhorn.

In SODA 2005 (full version in*SIAM Journal on Computing*). - Rank-Maximal Matchings.

R. W. Irving, T. Kavitha, K. Mehlhorn, D. Michail, and K. Paluch.

Invited to a special issue of*ACM Transactions on Algorithms*on SODA 2004. - Strongly Stable Matchings in Time O(mn) and Extension to the Hospitals-Residents Problem.

T. Kavitha, K. Mehlhorn, D. Michail, and K. Paluch.

In STACS 2004 (full version in*ACM Transactions on Algorithms*). - A faster algorithm for Minimum Cycle Basis of graphs.

T. Kavitha, K. Mehlhorn, D. Michail, and K. Paluch.

In ICALP 2004 (full version in*Algorithmica*). - On Shortest Paths in Line Arrangements.

T. Kavitha and K. Varadarajan.

In CCCG 2003. - Isoperimetric Inequalities and Width Parameters of Graphs.

L. S. Chandran, T. Kavitha, and C. R. Subramanian.

In COCOON 2003. - Efficient Algorithms for Abelian Group Isomorphism and Related Problems.

T. Kavitha.

In FSTTCS 2003. - An algorithm for computing a convex and simple path of bounded curvature in a simple polygon.

J.-D. Boissonnat, S.K. Ghosh, T. Kavitha, and S. Lazard.

In Algorithmica, 2002. - Better Lower Bounds for Locally Decodable Codes.

A. Deshpande, R. Jain, T. Kavitha, S.V. Lokam, and J. Radhakrishnan.

In Computational Complexity Conference 2002 (full version in*Random Structures and Algorithms*).