Telikepalli Kavitha

According to our database, Telikepalli Kavitha authored at least 95 papers between 2002 and 2024.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2024

Stable Matchings, One-Sided Ties, and Approximate Popularity.

Telikepalli Kavitha

Algorithmica, June, 2024

Popular Matchings with One-Sided Bias.

Telikepalli Kavitha

ACM Trans. Algorithms, January, 2024

Envy-free relaxations for goods, chores, and mixed items.

Kristóf Bérczi, Erika R. Bérczi-Kovács, Endre Boros, Fekadu Tolessa Gedefa, Naoyuki Kamiyama, Telikepalli Kavitha, Yusuke Kobayashi, Kazuhisa Makino

Theor. Comput. Sci., 2024

Maximum Matchings and Popularity.

Telikepalli Kavitha

SIAM J. Discret. Math., 2024

Arborescences, Colorful Forests, and Popularity.

Telikepalli Kavitha, Kazuhisa Makino, Ildikó Schlotter, Yu Yokoi

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

2023

Perfect Matchings and Popularity in the Many-To-Many Setting.

Telikepalli Kavitha, Kazuhisa Makino

Proceedings of the 43rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2023

Semi-Popular Matchings and Copeland Winners.

Telikepalli Kavitha, Rohit Vaish

Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems, 2023

2022

Understanding Popular Matchings via Stable Matchings.

Ágnes Cseh, Yuri Faenza, Telikepalli Kavitha, Vladlena Powers

SIAM J. Discret. Math., 2022

Popular branchings and their dual certificates.

Telikepalli Kavitha, Tamás Király, Jannik Matuschke, Ildikó Schlotter, Ulrike Schmidt-Kraepelin

Math. Program., 2022

Quasi-Popular Matchings, Optimality, and Extended Formulations.

Yuri Faenza, Telikepalli Kavitha

Math. Oper. Res., 2022

Fairly Popular Matchings and Optimality.

Telikepalli Kavitha

Proceedings of the 39th International Symposium on Theoretical Aspects of Computer Science, 2022

The popular assignment problem: when cardinality is more important than popularity.

Telikepalli Kavitha, Tamás Király, Jannik Matuschke, Ildikó Schlotter, Ulrike Schmidt-Kraepelin

Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

2021

A Little Charity Guarantees Almost Envy-Freeness.

Bhaskar Ray Chaudhury, Telikepalli Kavitha, Kurt Mehlhorn, Alkmini Sgouritsa

SIAM J. Comput., 2021

Popularity, Mixed Matchings, and Self-Duality.

Chien-Chung Huang, Telikepalli Kavitha

Math. Oper. Res., 2021

Matchings and Copeland's Method.

Telikepalli Kavitha, Rohit Vaish

CoRR, 2021

Popular Matchings in Complete Graphs.

Ágnes Cseh, Telikepalli Kavitha

Algorithmica, 2021

Matchings, Critical Nodes, and Popular Solutions.

Telikepalli Kavitha

Proceedings of the 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2021

2020

Min-Cost Popular Matchings.

Telikepalli Kavitha

Proceedings of the 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2020

2019

Two Problems in Max-Size Popular Matchings.

Florian Brandl, Telikepalli Kavitha

Algorithmica, 2019

Popular Matchings and Limits to Tractability.

Yuri Faenza, Telikepalli Kavitha, Vladlena Powers, Xingyu Zhang

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Popular Matchings: Good, Bad, and Mixed (Invited Talk).

Telikepalli Kavitha

Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science, 2019

Popular Roommates in Simply Exponential Time.

Telikepalli Kavitha

Proceedings of the 39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2019

2018

Popular edges and dominant matchings.

Ágnes Cseh, Telikepalli Kavitha

Math. Program., 2018

Distributed construction of purely additive spanners.

Keren Censor-Hillel, Telikepalli Kavitha, Ami Paz, Amir Yehudayoff

Distributed Comput., 2018

Popularity, stability, and the dominant matching polytope.

Ágnes Cseh, Yuri Faenza, Telikepalli Kavitha, Vladlena Powers

CoRR, 2018

The Popular Roommates problem.

Telikepalli Kavitha

CoRR, 2018

Max-size popular matchings and extensions.

Telikepalli Kavitha

CoRR, 2018

Popular Matchings of Desired Size.

Telikepalli Kavitha

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2018

2017

Popular Matchings with Two-Sided Preferences and One-Sided Ties.

Ágnes Cseh, Chien-Chung Huang, Telikepalli Kavitha

SIAM J. Discret. Math., 2017

New Pairwise Spanners.

Telikepalli Kavitha

Theory Comput. Syst., 2017

New Algorithms for Maximum Weight Matching and a Decomposition Theorem.

Chien-Chung Huang, Telikepalli Kavitha

Math. Oper. Res., 2017

Popular Matchings with Multiple Partners.

Florian Brandl, Telikepalli Kavitha

Proceedings of the 37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2017

2016

Ranked Matching.

Telikepalli Kavitha

Encyclopedia of Algorithms, 2016

Fair Matchings and Related Problems.

Chien-Chung Huang, Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail

Algorithmica, 2016

Popular Half-Integral Matchings.

Telikepalli Kavitha

Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

2015

Small Stretch Pairwise Spanners and Approximate D-Preservers.

Telikepalli Kavitha, Nithin M. Varma

SIAM J. Discret. Math., 2015

Improved approximation algorithms for two variants of the stable marriage problem with ties.

Chien-Chung Huang, Telikepalli Kavitha

Math. Program., 2015

Maintaining Near-Popular Matchings.

Sayan Bhattacharya, Martin Hoefer, Chien-Chung Huang, Telikepalli Kavitha, Lisa Wagner

Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

2014

A Size-Popularity Tradeoff in the Stable Marriage Problem.

Telikepalli Kavitha

SIAM J. Comput., 2014

Dynamic Matrix Rank with Partial Lookahead.

Telikepalli Kavitha

Theory Comput. Syst., 2014

Popularity at minimum cost.

Telikepalli Kavitha, Meghana Nasre, Prajakta Nimbhorkar

J. Comb. Optim., 2014

An Improved Approximation Algorithm for the Stable Marriage Problem with One-Sided Ties.

Chien-Chung Huang, Telikepalli Kavitha

Proceedings of the Integer Programming and Combinatorial Optimization, 2014

2013

Near-Popular Matchings in the Roommates Problem.

Chien-Chung Huang, Telikepalli Kavitha

SIAM J. Discret. Math., 2013

Popular matchings in the stable marriage problem.

Chien-Chung Huang, Telikepalli Kavitha

Inf. Comput., 2013

On Pairwise Spanners.

Marek Cygan, Fabrizio Grandoni, Telikepalli Kavitha

Proceedings of the 30th International Symposium on Theoretical Aspects of Computer Science, 2013

Small Stretch Pairwise Spanners.

Telikepalli Kavitha, Nithin M. Varma

Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

2012

Properties of Gomory-Hu co-cycle bases.

Telikepalli Kavitha

Theor. Comput. Sci., 2012

Incremental Cycle Detection, Topological Ordering, and Strong Component Maintenance.

Bernhard Haeupler, Telikepalli Kavitha, Rogers Mathew, Siddhartha Sen, Robert Endre Tarjan

ACM Trans. Algorithms, 2012

Max-coloring paths: tight bounds and extensions.

Telikepalli Kavitha, Julián Mestre

J. Comb. Optim., 2012

Faster Algorithms for All-Pairs Small Stretch Distances in Weighted Graphs.

Telikepalli Kavitha

Algorithmica, 2012

Popularity vs maximum cardinality in the stable marriage setting.

Telikepalli Kavitha

Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

Efficient algorithms for maximum weight matchings in general graphs with small edge weights.

Chien-Chung Huang, Telikepalli Kavitha

Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

2011

Popular matchings with variable item copies.

Telikepalli Kavitha, Meghana Nasre

Theor. Comput. Sci., 2011

Popular mixed matchings.

Telikepalli Kavitha, Julián Mestre, Meghana Nasre

Theor. Comput. Sci., 2011

New Approximation Algorithms for Minimum Cycle Bases of Graphs.

Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail

Algorithmica, 2011

Bounded Unpopularity Matchings.

Chien-Chung Huang, Telikepalli Kavitha, Dimitrios Michail, Meghana Nasre

Algorithmica, 2011

2010

Additive spanners and (alpha, beta)-spanners.

Surender Baswana, Telikepalli Kavitha, Kurt Mehlhorn, Seth Pettie

ACM Trans. Algorithms, 2010

Voting Paths.

David J. Abraham, Telikepalli Kavitha

SIAM J. Discret. Math., 2010

Faster Algorithms for All-pairs Approximate Shortest Paths in Undirected Graphs.

Surender Baswana, Telikepalli Kavitha

SIAM J. Comput., 2010

Assigning Papers to Referees.

Naveen Garg, Telikepalli Kavitha, Amit Kumar, Kurt Mehlhorn, Julián Mestre

Algorithmica, 2010

2009

Optimal popular matchings.

Telikepalli Kavitha, Meghana Nasre

Discret. Appl. Math., 2009

Cycle bases in graphs characterization, algorithms, complexity, and applications.

Telikepalli Kavitha, Christian Liebchen, Kurt Mehlhorn, Dimitrios Michail, Romeo Rizzi, Torsten Ueckerdt, Katharina Anna Zweig

Comput. Sci. Rev., 2009

Popular Matchings with Variable Job Capacities.

Telikepalli Kavitha, Meghana Nasre

Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

2008

Ranked Matching.

Telikepalli Kavitha

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Faster Algorithms for Minimum Cycle Basis in Directed Graphs.

Ramesh Hariharan, Telikepalli Kavitha, Kurt Mehlhorn

SIAM J. Comput., 2008

An improved heuristic for computing short integral cycle bases.

Telikepalli Kavitha, Katakam Vamsi Krishna

ACM J. Exp. Algorithmics, 2008

An [(<i>O</i>)\tilde](<i>m</i>²<i>n</i>)\tilde{O}(m^{2}n) Algorithm for Minimum Cycle Basis of Graphs.

Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail, Katarzyna E. Paluch

Algorithmica, 2008

On a Special Co-cycle Basis of Graphs.

Telikepalli Kavitha

Proceedings of the Algorithm Theory, 2008

Fast edge splitting and Edmonds' arborescence construction for unweighted graphs.

Anand Bhalgat, Ramesh Hariharan, Telikepalli Kavitha, Debmalya Panigrahi

Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

Faster Algorithms for Incremental Topological Ordering.

Bernhard Haeupler, Telikepalli Kavitha, Rogers Mathew, Siddhartha Sen, Robert Endre Tarjan

Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

2007

Strongly stable matchings in time <i>O</i>(<i>nm</i>) and extension to the hospitals-residents problem.

Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail, Katarzyna E. Paluch

ACM Trans. Algorithms, 2007

Popular Matchings.

David J. Abraham, Robert W. Irving, Telikepalli Kavitha, Kurt Mehlhorn

SIAM J. Comput., 2007

Algorithms to Compute Minimum Cycle Basis in Directed Graphs.

Telikepalli Kavitha, Kurt Mehlhorn

Theory Comput. Syst., 2007

Linear time algorithms for Abelian group isomorphism and related problems.

Telikepalli Kavitha

J. Comput. Syst. Sci., 2007

Faster Algorithms for Online Topological Ordering

Telikepalli Kavitha, Rogers Mathew

CoRR, 2007

An Õ(mn) Gomory-Hu tree construction algorithm for unweighted graphs.

Ramesh Hariharan, Telikepalli Kavitha, Debmalya Panigrahi, Anand Bhalgat

Proceedings of the 39th Annual ACM Symposium on Theory of Computing, 2007

Efficient algorithms for computing all low <i>s-t</i> edge connectivities and related problems.

Ramesh Hariharan, Telikepalli Kavitha, Debmalya Panigrahi

Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

2006

Rank-maximal matchings.

Robert W. Irving, Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail, Katarzyna E. Paluch

ACM Trans. Algorithms, 2006

The carvingwidth of hypercubes.

L. Sunil Chandran, Telikepalli Kavitha

Discret. Math., 2006

The treewidth and pathwidth of hypercubes.

L. Sunil Chandran, Telikepalli Kavitha

Discret. Math., 2006

Dynamic Matching Markets and Voting Paths.

David J. Abraham, Telikepalli Kavitha

Proceedings of the Algorithm Theory, 2006

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

Telikepalli Kavitha, Chintan D. Shah

Proceedings of the Algorithms and Computation, 17th International Symposium, 2006

A Faster Deterministic Algorithm for Minimum Cycle Bases in Directed Graphs.

Ramesh Hariharan, Telikepalli Kavitha, Kurt Mehlhorn

Proceedings of the Automata, Languages and Programming, 33rd International Colloquium, 2006

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

Surender Baswana, Telikepalli Kavitha

Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), 2006

2005

Lower bounds for adaptive locally decodable codes.

Amit Deshpande, Rahul Jain, Telikepalli Kavitha, Satyanarayana V. Lokam, Jaikumar Radhakrishnan

Random Struct. Algorithms, 2005

A Polynomial Time Algorithm for Minimum Cycle Basis in Directed Graphs.

Telikepalli Kavitha, Kurt Mehlhorn

Proceedings of the STACS 2005, 2005

New constructions of (alpha, beta)-spanners and purely additive spanners.

Surender Baswana, Telikepalli Kavitha, Kurt Mehlhorn, Seth Pettie

Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

An Õ(<i>m</i>²<i>n</i>) Randomized Algorithm to Compute a Minimum Cycle Basis of a Directed Graph.

Telikepalli Kavitha

Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005

2004

Strongly Stable Matchings in Time O(nm) and Extension to the Hospitals-Residents Problem.

Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail, Katarzyna E. Paluch

Proceedings of the STACS 2004, 2004

A Faster Algorithm for Minimum Cycle Basis of Graphs.

Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail, Katarzyna E. Paluch

Proceedings of the Automata, Languages and Programming: 31st International Colloquium, 2004

2003

Efficient Algorithms for Abelian Group Isomorphism and Related Problems.

Telikepalli Kavitha

Proceedings of the FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science, 2003

Isoperimetric Inequalities and the Width Parameters of Graphs.

L. Sunil Chandran, Telikepalli Kavitha, C. R. Subramanian

Proceedings of the Computing and Combinatorics, 9th Annual International Conference, 2003

On shortest paths in line arrangements.

Telikepalli Kavitha, Kasturi R. Varadarajan

Proceedings of the 15th Canadian Conference on Computational Geometry, 2003

2002

An Algorithm for Computing a Convex and Simple Path of Bounded Curvature in a Simple Polygon.

Jean-Daniel Boissonnat, Subir Kumar Ghosh, Telikepalli Kavitha, Sylvain Lazard

Algorithmica, 2002

Better Lower Bounds for Locally Decodable Codes.

Amit Deshpande, Rahul Jain, Telikepalli Kavitha, Jaikumar Radhakrishnan, Satyanarayana V. Lokam

Proceedings of the 17th Annual IEEE Conference on Computational Complexity, 2002