| 2026 | MFCS | Maximum Matchings and Short Voting Paths. | Telikepalli Kavitha |
| 2024 | SODA | Arborescences, Colorful Forests, and Popularity. | Telikepalli Kavitha, Kazuhisa Makino, Ildik Schlotter, Yu Yokoi |
| 2024 | WG | Popular Solutions for Optimal Matchings. | Telikepalli Kavitha |
| 2022 | SODA | The popular assignment problem: when cardinality is more important than popularity. | Telikepalli Kavitha, Tams Kirly, Jannik Matuschke, Ildik Schlotter, Ulrike Schmidt-Kraepelin |
| 2022 | STACS | Fairly Popular Matchings and Optimality. | Telikepalli Kavitha |
| 2021 | ICALP | Maximum Matchings and Popularity. | Telikepalli Kavitha |
| 2020 | ICALP | Popular Matchings with One-Sided Bias. | Telikepalli Kavitha |
| 2020 | IPCO | Popular Branchings and Their Dual Certificates. | Telikepalli Kavitha, Tams Kirly, Jannik Matuschke, Ildik Schlotter, Ulrike Schmidt-Kraepelin |
| 2020 | SODA | A Little Charity Guarantees Almost Envy-Freeness. | Bhaskar Ray Chaudhury, Telikepalli Kavitha, Kurt Mehlhorn, Alkmini Sgouritsa |
| 2020 | SODA | Quasi-popular Matchings, Optimality, and Extended Formulations. | Yuri Faenza, Telikepalli Kavitha |
| 2019 | MFCS | Popular Matchings: Good, Bad, and Mixed (Invited Talk). | Telikepalli Kavitha |
| 2019 | SODA | Popular Matchings and Limits to Tractability. | Yuri Faenza, Telikepalli Kavitha, Vladlena Powers, Xingyu Zhang |
| 2018 | WG | Popular Matchings of Desired Size. | Telikepalli Kavitha |
| 2017 | SODA | Popularity, Mixed Matchings, and Self-duality. | Chien-Chung Huang, Telikepalli Kavitha |
| 2016 | ICALP | Popular Half-Integral Matchings. | Telikepalli Kavitha |
| 2016 | IPCO | Popular Edges and Dominant Matchings. | gnes Cseh, Telikepalli Kavitha |
| 2015 | ICALP | Maintaining Near-Popular Matchings. | Sayan Bhattacharya, Martin Hoefer, Chien-Chung Huang, Telikepalli Kavitha, Lisa Wagner |
| 2015 | ICALP | Popular Matchings with Two-Sided Preferences and One-Sided Ties. | gnes Cseh, Chien-Chung Huang, Telikepalli Kavitha |
| 2015 | STACS | New Pairwise Spanners. | Telikepalli Kavitha |
| 2014 | IPCO | An Improved Approximation Algorithm for the Stable Marriage Problem with One-Sided Ties. | Chien-Chung Huang, Telikepalli Kavitha |
| 2013 | ICALP | Small Stretch Pairwise Spanners. | Telikepalli Kavitha, Nithin M. Varma |
| 2013 | STACS | On Pairwise Spanners. | Marek Cygan, Fabrizio Grandoni, Telikepalli Kavitha |
| 2012 | SODA | Efficient algorithms for maximum weight matchings in general graphs with small edge weights. | Chien-Chung Huang, Telikepalli Kavitha |
| 2012 | SODA | Popularity vs maximum cardinality in the stable marriage setting. | Telikepalli Kavitha |
| 2011 | ESA | Near-Popular Matchings in the Roommates Problem. | Chien-Chung Huang, Telikepalli Kavitha |
| 2011 | ICALP | Popular Matchings in the Stable Marriage Problem. | Chien-Chung Huang, Telikepalli Kavitha |
| 2010 | ISAAC | Popularity at Minimum Cost. | Telikepalli Kavitha, Meghana Nasre, Prajakta Nimbhorkar |
| 2009 | ICALP | Popular Mixed Matchings. | Telikepalli Kavitha, Julin Mestre, Meghana Nasre |
| 2009 | ISAAC | Max-Coloring Paths: Tight Bounds and Extensions. | Telikepalli Kavitha, Julin Mestre |
| 2009 | ISAAC | Popular Matchings with Variable Job Capacities. | Telikepalli Kavitha, Meghana Nasre |
| 2008 | ICALP | Faster Algorithms for Incremental Topological Ordering. | Bernhard Haeupler, Telikepalli Kavitha, Rogers Mathew, Siddhartha Sen, Robert Endre Tarjan |
| 2008 | SODA | Fast edge splitting and Edmonds' arborescence construction for unweighted graphs. | Anand Bhalgat, Ramesh Hariharan, Telikepalli Kavitha, Debmalya Panigrahi |
| 2007 | SODA | Efficient algorithms for computing all low | Ramesh Hariharan, Telikepalli Kavitha, Debmalya Panigrahi |
| 2007 | STOC | An (mn) Gomory-Hu tree construction algorithm for unweighted graphs. | Ramesh Hariharan, Telikepalli Kavitha, Debmalya Panigrahi, Anand Bhalgat |
| 2007 | STACS | New Approximation Algorithms for Minimum Cycle Bases of Graphs. | Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail |
| 2006 | FOCS | Faster Algorithms for Approximate Distance Oracles and All-Pairs Small Stretch Paths. | Surender Baswana, Telikepalli Kavitha |
| 2006 | ICALP | A Faster Deterministic Algorithm for Minimum Cycle Bases in Directed Graphs. | Ramesh Hariharan, Telikepalli Kavitha, Kurt Mehlhorn |
| 2006 | ISAAC | Efficient Algorithms for Weighted Rank-Maximal Matchings and Related Problems. | Telikepalli Kavitha, Chintan D. Shah |
| 2005 | ICALP | An ( | Telikepalli Kavitha |
| 2005 | SODA | Popular matchings. | David J. Abraham, Robert W. Irving, Telikepalli Kavitha, Kurt Mehlhorn |
| 2005 | SODA | New constructions of (alpha, beta)-spanners and purely additive spanners. | Surender Baswana, Telikepalli Kavitha, Kurt Mehlhorn, Seth Pettie |
| 2005 | STACS | A Polynomial Time Algorithm for Minimum Cycle Basis in Directed Graphs. | Telikepalli Kavitha, Kurt Mehlhorn |
| 2004 | ICALP | A Faster Algorithm for Minimum Cycle Basis of Graphs. | Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail, Katarzyna E. Paluch |
| 2004 | SODA | Rank-maximal matchings. | Robert W. Irving, Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail, Katarzyna E. Paluch |
| 2004 | STACS | Strongly Stable Matchings in Time O(nm) and Extension to the Hospitals-Residents Problem. | Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail, Katarzyna E. Paluch |
| 2003 | COCOON | Isoperimetric Inequalities and the Width Parameters of Graphs. | L. Sunil Chandran, Telikepalli Kavitha, C. R. Subramanian |