Telikepalli Kavitha

ORCID

Publication Activity (10 Years)

Years Active: 2002-2024
Publications (10 Years): 57

Top Venues

CoRR

FSTTCS

SODA

SIAM J. Discret. Math.

Publications

Telikepalli Kavitha, Kazuhisa Makino, Ildikó Schlotter, Yu Yokoi
Arborescences, Colorful Forests, and Popularity. SODA (2024)
Kristóf Bérczi, Erika R. Bérczi-Kovács, Endre Boros, Fekadu Tolessa Gedefa, Naoyuki Kamiyama, Telikepalli Kavitha, Yusuke Kobayashi, Kazuhisa Makino
Envy-free relaxations for goods, chores, and mixed items. Theor. Comput. Sci. 1002 (2024)
Telikepalli Kavitha
Maximum Matchings and Popularity. SIAM J. Discret. Math. 38 (2) (2024)
Telikepalli Kavitha
Popular Matchings with One-Sided Bias. ACM Trans. Algorithms 20 (1) (2024)
Telikepalli Kavitha
Stable Matchings, One-Sided Ties, and Approximate Popularity. Algorithmica 86 (6) (2024)
Telikepalli Kavitha, Rohit Vaish
Semi-Popular Matchings and Copeland Winners. AAMAS (2023)
Telikepalli Kavitha, Kazuhisa Makino
Perfect Matchings and Popularity in the Many-To-Many Setting. FSTTCS (2023)
Telikepalli Kavitha, Kazuhisa Makino, Ildikó Schlotter, Yu Yokoi
Arborescences, Colorful Forests, and Popularity. CoRR (2023)
Telikepalli Kavitha
Stable Matchings with One-Sided Ties and Approximate Popularity. FSTTCS (2022)
Telikepalli Kavitha, Tamás Király, Jannik Matuschke, Ildikó Schlotter, Ulrike Schmidt-Kraepelin
Popular branchings and their dual certificates. Math. Program. 192 (1) (2022)
Telikepalli Kavitha
Popular Matchings with One-Sided Bias. CoRR (2022)
Ágnes Cseh, Yuri Faenza, Telikepalli Kavitha, Vladlena Powers
Understanding Popular Matchings via Stable Matchings. SIAM J. Discret. Math. 36 (1) (2022)
Telikepalli Kavitha, Tamás Király, Jannik Matuschke, Ildikó Schlotter, Ulrike Schmidt-Kraepelin
The popular assignment problem: when cardinality is more important than popularity. SODA (2022)
Telikepalli Kavitha
Fairly Popular Matchings and Optimality. STACS (2022)
Yuri Faenza, Telikepalli Kavitha
Quasi-Popular Matchings, Optimality, and Extended Formulations. Math. Oper. Res. 47 (1) (2022)
Telikepalli Kavitha
Maximum Matchings and Popularity. ICALP (2021)
Telikepalli Kavitha, Rohit Vaish
Matchings and Copeland's Method. CoRR (2021)
Telikepalli Kavitha, Tamás Király, Jannik Matuschke, Ildikó Schlotter, Ulrike Schmidt-Kraepelin
The popular assignment problem: when cardinality is more important than popularity. CoRR (2021)
Bhaskar Ray Chaudhury, Telikepalli Kavitha, Kurt Mehlhorn, Alkmini Sgouritsa
A Little Charity Guarantees Almost Envy-Freeness. SIAM J. Comput. 50 (4) (2021)
Chien-Chung Huang, Telikepalli Kavitha
Popularity, Mixed Matchings, and Self-Duality. Math. Oper. Res. 46 (2) (2021)
Telikepalli Kavitha
Matchings, Critical Nodes, and Popular Solutions. FSTTCS (2021)
Ágnes Cseh, Telikepalli Kavitha
Popular Matchings in Complete Graphs. Algorithmica 83 (5) (2021)
Yuri Faenza, Telikepalli Kavitha
Quasi-popular Matchings, Optimality, and Extended Formulations. SODA (2020)
Kristóf Bérczi, Erika R. Bérczi-Kovács, Endre Boros, Fekadu Tolessa Gedefa, Naoyuki Kamiyama, Telikepalli Kavitha, Yusuke Kobayashi, Kazuhisa Makino
Envy-free Relaxations for Goods, Chores, and Mixed Items. CoRR (2020)
Telikepalli Kavitha
Popular Matchings with One-Sided Bias. ICALP (2020)
Bhaskar Ray Chaudhury, Telikepalli Kavitha, Kurt Mehlhorn, Alkmini Sgouritsa
A Little Charity Guarantees Almost Envy-Freeness. SODA (2020)
Telikepalli Kavitha, Tamás Király, Jannik Matuschke, Ildikó Schlotter, Ulrike Schmidt-Kraepelin
Popular Branchings and Their Dual Certificates. IPCO (2020)
Telikepalli Kavitha
Min-Cost Popular Matchings. FSTTCS (2020)
Telikepalli Kavitha
Maximum Matchings and Popularity. CoRR (2020)
Telikepalli Kavitha, Tamás Király, Jannik Matuschke, Ildikó Schlotter, Ulrike Schmidt-Kraepelin
Popular Branchings and Their Dual Certificates. CoRR (2019)
Yuri Faenza, Telikepalli Kavitha
Quasi-popular Matchings, Optimality, and Extended Formulations. CoRR (2019)
Telikepalli Kavitha
Popular Roommates in Simply Exponential Time. FSTTCS (2019)
Telikepalli Kavitha
Popular Matchings: Good, Bad, and Mixed (Invited Talk). MFCS (2019)
Yuri Faenza, Telikepalli Kavitha, Vladlena Powers, Xingyu Zhang
Popular Matchings and Limits to Tractability. SODA (2019)
Florian Brandl, Telikepalli Kavitha
Two Problems in Max-Size Popular Matchings. Algorithmica 81 (7) (2019)
Bhaskar Ray Chaudhury, Telikepalli Kavitha, Kurt Mehlhorn, Alkmini Sgouritsa
A Little Charity Guarantees Almost Envy-Freeness. CoRR (2019)
Ágnes Cseh, Yuri Faenza, Telikepalli Kavitha, Vladlena Powers
Popularity, stability, and the dominant matching polytope. CoRR (2018)
Ágnes Cseh, Telikepalli Kavitha
Popular Matchings in Complete Graphs. FSTTCS (2018)
Yuri Faenza, Telikepalli Kavitha, Vladlena Powers, Xingyu Zhang
Popular Matchings and Limits to Tractability. CoRR (2018)
Keren Censor-Hillel, Telikepalli Kavitha, Ami Paz, Amir Yehudayoff
Distributed construction of purely additive spanners. Distributed Comput. 31 (3) (2018)
Ágnes Cseh, Telikepalli Kavitha
Popular edges and dominant matchings. Math. Program. 172 (1-2) (2018)
Telikepalli Kavitha
The Popular Roommates problem. CoRR (2018)
Telikepalli Kavitha
Max-size popular matchings and extensions. CoRR (2018)
Telikepalli Kavitha
Popular Matchings of Desired Size. WG (2018)
Ágnes Cseh, Telikepalli Kavitha
Popular Matchings in Complete Graphs. CoRR (2018)
Florian Brandl, Telikepalli Kavitha
Popular Matchings with Multiple Partners. FSTTCS (2017)
Chien-Chung Huang, Telikepalli Kavitha
New Algorithms for Maximum Weight Matching and a Decomposition Theorem. Math. Oper. Res. 42 (2) (2017)
Chien-Chung Huang, Telikepalli Kavitha
Popularity, Mixed Matchings, and Self-duality. SODA (2017)
Telikepalli Kavitha
New Pairwise Spanners. Theory Comput. Syst. 61 (4) (2017)
Ágnes Cseh, Chien-Chung Huang, Telikepalli Kavitha
Popular Matchings with Two-Sided Preferences and One-Sided Ties. SIAM J. Discret. Math. 31 (4) (2017)
Ágnes Cseh, Telikepalli Kavitha
Popular Edges and Dominant Matchings. IPCO (2016)
Keren Censor-Hillel, Telikepalli Kavitha, Ami Paz, Amir Yehudayoff
Distributed Construction of Purely Additive Spanners. DISC (2016)
Telikepalli Kavitha
Popular Half-Integral Matchings. ICALP (2016)
Keren Censor-Hillel, Telikepalli Kavitha, Ami Paz, Amir Yehudayoff
Distributed Construction of Purely Additive Spanners. CoRR (2016)
Chien-Chung Huang, Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail
Fair Matchings and Related Problems. Algorithmica 74 (3) (2016)
Florian Brandl, Telikepalli Kavitha
Popular Matchings with Multiple Partners. CoRR (2016)
Ágnes Cseh, Chien-Chung Huang, Telikepalli Kavitha
Popular matchings with two-sided preferences and one-sided ties. CoRR (2016)
Ágnes Cseh, Telikepalli Kavitha
Popular Edges and Dominant Matchings. CoRR (2015)
Sayan Bhattacharya, Martin Hoefer, Chien-Chung Huang, Telikepalli Kavitha, Lisa Wagner
Maintaining Near-Popular Matchings. ICALP (2) (2015)
Ágnes Cseh, Chien-Chung Huang, Telikepalli Kavitha
Popular Matchings with Two-Sided Preferences and One-Sided Ties. ICALP (1) (2015)
Telikepalli Kavitha
New Pairwise Spanners. STACS (2015)
Telikepalli Kavitha, Nithin M. Varma
Small Stretch Pairwise Spanners and Approximate D-Preservers. SIAM J. Discret. Math. 29 (4) (2015)
Chien-Chung Huang, Telikepalli Kavitha
Improved approximation algorithms for two variants of the stable marriage problem with ties. Math. Program. 154 (1-2) (2015)
Telikepalli Kavitha, Meghana Nasre, Prajakta Nimbhorkar
Popularity at minimum cost. J. Comb. Optim. 27 (3) (2014)
Chien-Chung Huang, Telikepalli Kavitha
An Improved Approximation Algorithm for the Stable Marriage Problem with One-Sided Ties. IPCO (2014)
Telikepalli Kavitha
Dynamic Matrix Rank with Partial Lookahead. Theory Comput. Syst. 55 (1) (2014)
Telikepalli Kavitha
A Size-Popularity Tradeoff in the Stable Marriage Problem. SIAM J. Comput. 43 (1) (2014)
Chien-Chung Huang, Telikepalli Kavitha
Popular matchings in the stable marriage problem. Inf. Comput. 222 (2013)
Chien-Chung Huang, Telikepalli Kavitha
Near-Popular Matchings in the Roommates Problem. SIAM J. Discret. Math. 27 (1) (2013)
Marek Cygan, Fabrizio Grandoni, Telikepalli Kavitha
On Pairwise Spanners CoRR (2013)
Marek Cygan, Fabrizio Grandoni, Telikepalli Kavitha
On Pairwise Spanners. STACS (2013)
Telikepalli Kavitha, Nithin M. Varma
Small Stretch Pairwise Spanners. ICALP (1) (2013)
Chien-Chung Huang, Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail
Fair Matchings and Related Problems. FSTTCS (2013)
Telikepalli Kavitha
Properties of Gomory-Hu co-cycle bases. Theor. Comput. Sci. 420 (2012)
Bernhard Haeupler, Telikepalli Kavitha, Rogers Mathew, Siddhartha Sen, Robert Endre Tarjan
Incremental Cycle Detection, Topological Ordering, and Strong Component Maintenance. ACM Trans. Algorithms 8 (1) (2012)
Chien-Chung Huang, Telikepalli Kavitha
Efficient algorithms for maximum weight matchings in general graphs with small edge weights. SODA (2012)
Telikepalli Kavitha
Faster Algorithms for All-Pairs Small Stretch Distances in Weighted Graphs. Algorithmica 63 (1-2) (2012)
Telikepalli Kavitha
Popularity vs maximum cardinality in the stable marriage setting. SODA (2012)
Telikepalli Kavitha, Julián Mestre
Max-coloring paths: tight bounds and extensions. J. Comb. Optim. 24 (1) (2012)
Telikepalli Kavitha, Julián Mestre, Meghana Nasre
Popular mixed matchings. Theor. Comput. Sci. 412 (24) (2011)
Chien-Chung Huang, Telikepalli Kavitha, Dimitrios Michail, Meghana Nasre
Bounded Unpopularity Matchings. Algorithmica 61 (3) (2011)
Bernhard Haeupler, Telikepalli Kavitha, Rogers Mathew, Siddhartha Sen, Robert Endre Tarjan
Incremental Cycle Detection, Topological Ordering, and Strong Component Maintenance CoRR (2011)
Telikepalli Kavitha, Meghana Nasre
Popular matchings with variable item copies. Theor. Comput. Sci. 412 (12-14) (2011)
Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail
New Approximation Algorithms for Minimum Cycle Bases of Graphs. Algorithmica 59 (4) (2011)
Chien-Chung Huang, Telikepalli Kavitha
Near-Popular Matchings in the Roommates Problem. ESA (2011)
Chien-Chung Huang, Telikepalli Kavitha
Popular Matchings in the Stable Marriage Problem. ICALP (1) (2011)
Naveen Garg, Telikepalli Kavitha, Amit Kumar, Kurt Mehlhorn, Julián Mestre
Assigning Papers to Referees. Algorithmica 58 (1) (2010)
Surender Baswana, Telikepalli Kavitha, Kurt Mehlhorn, Seth Pettie
Additive spanners and (alpha, beta)-spanners. ACM Trans. Algorithms 7 (1) (2010)
Telikepalli Kavitha, Meghana Nasre, Prajakta Nimbhorkar
Popularity at Minimum Cost. ISAAC (1) (2010)
Telikepalli Kavitha, Meghana Nasre, Prajakta Nimbhorkar
Popularity at Minimum Cost CoRR (2010)
David J. Abraham, Telikepalli Kavitha
Voting Paths. SIAM J. Discret. Math. 24 (2) (2010)
Surender Baswana, Telikepalli Kavitha
Faster Algorithms for All-pairs Approximate Shortest Paths in Undirected Graphs. SIAM J. Comput. 39 (7) (2010)
Telikepalli Kavitha, Julián Mestre, Meghana Nasre
Popular Mixed Matchings. ICALP (1) (2009)
Telikepalli Kavitha, Julián Mestre
Max-Coloring Paths: Tight Bounds and Extensions. ISAAC (2009)
Telikepalli Kavitha, Meghana Nasre
Optimal popular matchings. Discret. Appl. Math. 157 (14) (2009)
Telikepalli Kavitha, Christian Liebchen, Kurt Mehlhorn, Dimitrios Michail, Romeo Rizzi, Torsten Ueckerdt, Katharina Anna Zweig
Cycle bases in graphs characterization, algorithms, complexity, and applications. Comput. Sci. Rev. 3 (4) (2009)
Telikepalli Kavitha, Meghana Nasre
Popular Matchings with Variable Job Capacities. ISAAC (2009)
Telikepalli Kavitha, Katakam Vamsi Krishna
An improved heuristic for computing short integral cycle bases. ACM J. Exp. Algorithmics 13 (2008)
Telikepalli Kavitha
On a Special Co-cycle Basis of Graphs. SWAT (2008)
Anand Bhalgat, Ramesh Hariharan, Telikepalli Kavitha, Debmalya Panigrahi
Fast edge splitting and Edmonds' arborescence construction for unweighted graphs. SODA (2008)

Telikepalli Kavitha.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Telikepalli Kavitha