Publications
Search

Publications :: Search

Show author

On this page you see the details of the selected author.

    Author information
    First name: Telikepalli
    Last name: Kavitha
    DBLP: 76/3493
    Rating: (not rated yet)
    Bookmark:

    Below you find the publications which have been written by this author.

    Show item 1 to 89 of 89  
    Select a publication
    Show Title Venue Rating Date
    Conference paper
    Chien-Chung Huang, Telikepalli Kavitha.
    Popularity, Mixed Matchings, and Self-duality.
    Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017, Barcelona, Spain, Hotel Porta Fira, January 16-19 2017 (0) 2017
    Conference paper
    Chien-Chung Huang, Telikepalli Kavitha.
    New Algorithms for Maximum Weight Matching and a Decomposition Theorem.
    Math. Oper. Res. 2017, Volume 42 (0) 2017
    Conference paper
    Telikepalli Kavitha.
    New Pairwise Spanners.
    Theory Comput. Syst. 2017, Volume 61 (0) 2017
    Conference paper
    Chien-Chung Huang, Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail 0001.
    Fair Matchings and Related Problems.
    Algorithmica 2016, Volume 74 (0) 2016
    Journal article
    Ágnes Cseh, Chien-Chung Huang, Telikepalli Kavitha.
    Popular matchings with two-sided preferences and one-sided ties.
    CoRR 2016, Volume 0 (0) 2016
    Conference paper
    Telikepalli Kavitha.
    Ranked Matching.
    Encyclopedia of Algorithms 2016 (0) 2016
    Conference paper
    Ágnes Cseh, Telikepalli Kavitha.
    Popular Edges and Dominant Matchings.
    Integer Programming and Combinatorial Optimization - 18th International Conference, IPCO 2016, Liège, Belgium, June 1-3, 2016, Proceedings 2016 (0) 2016
    Conference paper
    Keren Censor-Hillel, Telikepalli Kavitha, Ami Paz, Amir Yehudayoff.
    Distributed Construction of Purely Additive Spanners.
    CoRR 2016, Volume 0 (0) 2016
    Conference paper
    Telikepalli Kavitha.
    Popular Half-Integral Matchings.
    43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016, July 11-15, 2016, Rome, Italy 2016 (0) 2016
    Conference paper
    Keren Censor-Hillel, Telikepalli Kavitha, Ami Paz, Amir Yehudayoff.
    Distributed Construction of Purely Additive Spanners.
    Distributed Computing - 30th International Symposium, DISC 2016, Paris, France, September 27-29, 2016. Proceedings 2016 (0) 2016
    Conference paper
    Florian Brandl, Telikepalli Kavitha.
    Popular Matchings with Multiple Partners.
    CoRR 2016, Volume 0 (0) 2016
    Conference paper
    Telikepalli Kavitha.
    New Pairwise Spanners.
    32nd International Symposium on Theoretical Aspects of Computer Science, STACS 2015, March 4-7, 2015, Garching, Germany 2015 (0) 2015
    Conference paper
    Sayan Bhattacharya, Martin Hoefer, Chien-Chung Huang, Telikepalli Kavitha, Lisa Wagner.
    Maintaining Near-Popular Matchings.
    Automata, Languages, and Programming - 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part II 2015 (0) 2015
    Conference paper
    Ágnes Cseh, Chien-Chung Huang, Telikepalli Kavitha.
    Popular Matchings with Two-Sided Preferences and One-Sided Ties.
    Automata, Languages, and Programming - 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part I 2015 (0) 2015
    Journal article
    Ágnes Cseh, Telikepalli Kavitha.
    Popular Edges and Dominant Matchings.
    CoRR 2015, Volume 0 (0) 2015
    Conference paper
    Chien-Chung Huang, Telikepalli Kavitha.
    Improved approximation algorithms for two variants of the stable marriage problem with ties.
    Math. Program. 2015, Volume 154 (0) 2015
    Conference paper
    Telikepalli Kavitha, Nithin M. Varma.
    Small Stretch Pairwise Spanners and Approximate D-Preservers.
    SIAM J. Discrete Math. 2015, Volume 29 (0) 2015
    Conference paper
    Telikepalli Kavitha, Meghana Nasre, Prajakta Nimbhorkar.
    Popularity at minimum cost.
    J. Comb. Optim. 2014, Volume 27 (0) 2014
    Journal article
    Telikepalli Kavitha.
    A Size-Popularity Tradeoff in the Stable Marriage Problem.
    SIAM J. Comput. 2014, Volume 43 (0) 2014
    Conference paper
    Chien-Chung Huang, Telikepalli Kavitha.
    An Improved Approximation Algorithm for the Stable Marriage Problem with One-Sided Ties.
    Integer Programming and Combinatorial Optimization - 17th International Conference, IPCO 2014, Bonn, Germany, June 23-25, 2014. Proceedings 2014 (0) 2014
    Journal article
    Telikepalli Kavitha.
    Dynamic Matrix Rank with Partial Lookahead.
    Theory Comput. Syst. 2014, Volume 55 (0) 2014
    Journal article
    Chien-Chung Huang, Telikepalli Kavitha.
    Popular matchings in the stable marriage problem.
    Inf. Comput. 2013, Volume 222 (0) 2013
    Journal article
    Marek Cygan, Fabrizio Grandoni, Telikepalli Kavitha.
    On Pairwise Spanners
    CoRR 2013, Volume 0 (0) 2013
    Journal article
    Chien-Chung Huang, Telikepalli Kavitha.
    Near-Popular Matchings in the Roommates Problem.
    SIAM J. Discrete Math. 2013, Volume 27 (0) 2013
    Conference paper
    Marek Cygan, Fabrizio Grandoni, Telikepalli Kavitha.
    On Pairwise Spanners.
    30th International Symposium on Theoretical Aspects of Computer Science, STACS 2013, February 27 - March 2, 2013, Kiel, Germany 2013 (0) 2013
    Conference paper
    Telikepalli Kavitha, Nithin M. Varma.
    Small Stretch Pairwise Spanners.
    Automata, Languages, and Programming - 40th International Colloquium, ICALP 2013, Riga, Latvia, July 8-12, 2013, Proceedings, Part I 2013 (0) 2013
    Conference paper
    Chien-Chung Huang, Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail 0001.
    Fair Matchings and Related Problems.
    IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2013, December 12-14, 2013, Guwahati, India 2013 (0) 2013
    Journal article
    Telikepalli Kavitha.
    Faster Algorithms for All-Pairs Small Stretch Distances in Weighted Graphs.
    Algorithmica 2012, Volume 63 (0) 2012
    Journal article
    Bernhard Haeupler, Telikepalli Kavitha, Rogers Mathew, Siddhartha Sen, Robert E. Tarjan.
    Incremental Cycle Detection, Topological Ordering, and Strong Component Maintenance.
    ACM Transactions on Algorithms 2012, Volume 8 (0) 2012
    Journal article
    Telikepalli Kavitha.
    Properties of Gomory-Hu co-cycle bases.
    Theor. Comput. Sci. 2012, Volume 420 (0) 2012
    Journal article
    Telikepalli Kavitha, Julián Mestre.
    Max-coloring paths: tight bounds and extensions.
    J. Comb. Optim. 2012, Volume 24 (0) 2012
    Conference paper
    Chien-Chung Huang, Telikepalli Kavitha.
    Efficient algorithms for maximum weight matchings in general graphs with small edge weights.
    Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2012, Kyoto, Japan, January 17-19, 2012 2012 (0) 2012
    Conference paper
    Telikepalli Kavitha.
    Popularity vs maximum cardinality in the stable marriage setting.
    Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2012, Kyoto, Japan, January 17-19, 2012 2012 (0) 2012
    Conference paper
    Telikepalli Kavitha, Meghana Nasre.
    Popular matchings with variable item copies.
    Theor. Comput. Sci. 2011, Volume 412 (0) 2011
    Conference paper
    Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail.
    New Approximation Algorithms for Minimum Cycle Bases of Graphs.
    Algorithmica 2011, Volume 59 (0) 2011
    Conference paper
    Telikepalli Kavitha, Julián Mestre, Meghana Nasre.
    Popular mixed matchings.
    Theor. Comput. Sci. 2011, Volume 412 (0) 2011
    Journal article
    Bernhard Haeupler, Telikepalli Kavitha, Rogers Mathew, Siddhartha Sen, Robert E. Tarjan.
    Incremental Cycle Detection, Topological Ordering, and Strong Component Maintenance
    CoRR 2011, Volume 0 (0) 2011
    Conference paper
    Chien-Chung Huang, Telikepalli Kavitha.
    Popular Matchings in the Stable Marriage Problem.
    Automata, Languages and Programming - 38th International Colloquium, ICALP 2011, Zurich, Switzerland, July 4-8, 2011, Proceedings, Part I 2011 (0) 2011
    Conference paper
    Chien-Chung Huang, Telikepalli Kavitha, Dimitrios Michail, Meghana Nasre.
    Bounded Unpopularity Matchings.
    Algorithmica 2011, Volume 61 (0) 2011
    Conference paper
    Chien-Chung Huang, Telikepalli Kavitha.
    Near-Popular Matchings in the Roommates Problem.
    Algorithms - ESA 2011 - 19th Annual European Symposium, Saarbrücken, Germany, September 5-9, 2011. Proceedings 2011 (0) 2011
    Conference paper
    Surender Baswana, Telikepalli Kavitha.
    Faster Algorithms for All-pairs Approximate Shortest Paths in Undirected Graphs.
    SIAM J. Comput. 2009, Volume 39 (0) 2010
    Journal article
    David J. Abraham, Telikepalli Kavitha.
    Voting Paths.
    SIAM J. Discrete Math. 2010, Volume 24 (0) 2010
    Journal article
    Telikepalli Kavitha, Meghana Nasre, Prajakta Nimbhorkar.
    Popularity at Minimum Cost
    CoRR 2010, Volume 0 (0) 2010
    Journal article
    Naveen Garg, Telikepalli Kavitha, Amit Kumar, Kurt Mehlhorn, Julián Mestre.
    Assigning Papers to Referees.
    Algorithmica 2010, Volume 58 (0) 2010
    Conference paper
    Telikepalli Kavitha, Meghana Nasre, Prajakta Nimbhorkar.
    Popularity at Minimum Cost.
    Algorithms and Computation - 21st International Symposium, ISAAC 2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part I 2010 (0) 2010
    Journal article
    Surender Baswana, Telikepalli Kavitha, Kurt Mehlhorn, Seth Pettie.
    Additive spanners and (alpha, beta)-spanners.
    ACM Transactions on Algorithms 2010, Volume 7 (0) 2010
    Conference paper
    Telikepalli Kavitha, Meghana Nasre.
    Popular Matchings with Variable Job Capacities.
    Algorithms and Computation, 20th International Symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings 2009 (0) 2009
    Conference paper
    Telikepalli Kavitha, Julián Mestre, Meghana Nasre.
    Popular Mixed Matchings.
    Automata, Languages and Programming, 36th International Colloquium, ICALP 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part I 2009 (0) 2009
    Conference paper
    Telikepalli Kavitha, Julián Mestre.
    Max-Coloring Paths: Tight Bounds and Extensions.
    Algorithms and Computation, 20th International Symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings 2009 (0) 2009
    Conference paper
    Telikepalli Kavitha, Meghana Nasre.
    Optimal popular matchings.
    Discrete Applied Mathematics 2009, Volume 157 (0) 2009
    Conference paper
    Telikepalli Kavitha, Christian Liebchen, Kurt Mehlhorn, Dimitrios Michail, Romeo Rizzi, Torsten Ueckerdt, Katharina Anna Zweig.
    Cycle bases in graphs characterization, algorithms, complexity, and applications.
    Computer Science Review 2009, Volume 3 (0) 2009
    Conference paper
    Bernhard Haeupler, Telikepalli Kavitha, Rogers Mathew, Siddhartha Sen, Robert E. Tarjan.
    Faster Algorithms for Incremental Topological Ordering.
    Automata, Languages and Programming, 35th International Colloquium, ICALP 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part I: Tack A: Algorithms, Automata, Complexity, and Games 2008 (0) 2008
    Conference paper
    Anand Bhalgat, Ramesh Hariharan, Telikepalli Kavitha, Debmalya Panigrahi.
    Fast edge splitting and Edmonds' arborescence construction for unweighted graphs.
    Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San Francisco, California, USA, January 20-22, 2008 2008 (0) 2008
    Conference paper
    Chien-Chung Huang, Telikepalli Kavitha, Dimitrios Michail, Meghana Nasre.
    Bounded Unpopularity Matchings.
    Algorithm Theory - SWAT 2008, 11th Scandinavian Workshop on Algorithm Theory, Gothenburg, Sweden, July 2-4, 2008, Proceedings 2008 (0) 2008
    Conference paper
    Telikepalli Kavitha.
    On a Special Co-cycle Basis of Graphs.
    Algorithm Theory - SWAT 2008, 11th Scandinavian Workshop on Algorithm Theory, Gothenburg, Sweden, July 2-4, 2008, Proceedings 2008 (0) 2008
    Conference paper
    Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail, Katarzyna E. Paluch.
    An [(
    Algorithmica 2008, Volume 52 (0) 2008
    Conference paper
    Telikepalli Kavitha, Katakam Vamsi Krishna.
    An improved heuristic for computing short integral cycle bases.
    ACM Journal of Experimental Algorithmics 2008, Volume 13 (0) 2008
    Conference paper
    Ramesh Hariharan, Telikepalli Kavitha, Kurt Mehlhorn.
    Faster Algorithms for Minimum Cycle Basis in Directed Graphs.
    SIAM J. Comput. 2008, Volume 38 (0) 2008
    Book chapter
    Telikepalli Kavitha.
    Ranked Matching.
    Encyclopedia of Algorithms 2008 (0) 2008
    Conference paper
    Telikepalli Kavitha.
    Dynamic matrix rank with partial lookahead.
    IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2008, December 9-11, 2008, Bangalore, India 2008 (0) 2008
    Conference paper
    Telikepalli Kavitha.
    Faster Algorithms for All-Pairs Small Stretch Distances in Weighted Graphs.
    FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science, 27th International Conference, New Delhi, India, December 12-14, 2007, Proceedings 2007 (0) 2007
    Conference paper
    Ramesh Hariharan, Telikepalli Kavitha, Debmalya Panigrahi.
    Efficient algorithms for computing all low
    Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007, New Orleans, Louisiana, USA, January 7-9, 2007 2007 (0) 2007
    Conference paper
    Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail.
    New Approximation Algorithms for Minimum Cycle Bases of Graphs.
    STACS 2007, 24th Annual Symposium on Theoretical Aspects of Computer Science, Aachen, Germany, February 22-24, 2007, Proceedings 2007 (0) 2007
    Conference paper
    Ramesh Hariharan, Telikepalli Kavitha, Debmalya Panigrahi, Anand Bhalgat.
    An Õ(mn) Gomory-Hu tree construction algorithm for unweighted graphs.
    Proceedings of the 39th Annual ACM Symposium on Theory of Computing, San Diego, California, USA, June 11-13, 2007 2007 (0) 2007
    Conference paper
    Telikepalli Kavitha, Rogers Mathew.
    Faster Algorithms for Online Topological Ordering
    CoRR 2007, Volume 0 (0) 2007
    Conference paper
    Telikepalli Kavitha.
    Linear time algorithms for Abelian group isomorphism and related problems.
    J. Comput. Syst. Sci. 2007, Volume 73 (0) 2007
    Conference paper
    Telikepalli Kavitha, Kurt Mehlhorn.
    Algorithms to Compute Minimum Cycle Basis in Directed Graphs.
    Theory Comput. Syst. 2007, Volume 40 (0) 2007
    Conference paper
    David J. Abraham, Robert W. Irving, Telikepalli Kavitha, Kurt Mehlhorn.
    Popular Matchings.
    SIAM J. Comput. 2007, Volume 37 (0) 2007
    Conference paper
    Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail, Katarzyna E. Paluch.
    Strongly stable matchings in time
    ACM Transactions on Algorithms 2007, Volume 3 (0) 2007
    Conference paper
    Surender Baswana, Telikepalli Kavitha.
    Faster Algorithms for Approximate Distance Oracles and All-Pairs Small Stretch Paths.
    47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), 21-24 October 2006, Berkeley, California, USA, Proceedings 2006 (0) 2006
    Conference paper
    Ramesh Hariharan, Telikepalli Kavitha, Kurt Mehlhorn.
    A Faster Deterministic Algorithm for Minimum Cycle Bases in Directed Graphs.
    Automata, Languages and Programming, 33rd International Colloquium, ICALP 2006, Venice, Italy, July 10-14, 2006, Proceedings, Part I 2006 (0) 2006
    Conference paper
    Telikepalli Kavitha, Chintan D. Shah.
    Efficient Algorithms for Weighted Rank-Maximal Matchings and Related Problems.
    Algorithms and Computation, 17th International Symposium, ISAAC 2006, Kolkata, India, December 18-20, 2006, Proceedings 2006 (0) 2006
    Conference paper
    David J. Abraham, Telikepalli Kavitha.
    Dynamic Matching Markets and Voting Paths.
    Algorithm Theory - SWAT 2006, 10th ScandinavianWorkshop on Algorithm Theory, Riga, Latvia, July 6-8, 2006, Proceedings 2006 (0) 2006
    Conference paper
    L. Sunil Chandran, Telikepalli Kavitha.
    The treewidth and pathwidth of hypercubes.
    Discrete Mathematics 2006, Volume 306 (0) 2006
    Conference paper
    L. Sunil Chandran, Telikepalli Kavitha.
    The carvingwidth of hypercubes.
    Discrete Mathematics 2006, Volume 306 (0) 2006
    Conference paper
    Robert W. Irving, Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail, Katarzyna E. Paluch.
    Rank-maximal matchings.
    ACM Transactions on Algorithms 2006, Volume 2 (0) 2006
    Conference paper
    Telikepalli Kavitha.
    An Õ
    Automata, Languages and Programming, 32nd International Colloquium, ICALP 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings 2005 (0) 2005
    Conference paper
    David J. Abraham, Robert W. Irving, Telikepalli Kavitha, Kurt Mehlhorn.
    Popular matchings.
    Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2005, Vancouver, British Columbia, Canada, January 23-25, 2005 2005 (0) 2005
    Conference paper
    Surender Baswana, Telikepalli Kavitha, Kurt Mehlhorn, Seth Pettie.
    New constructions of (alpha, beta)-spanners and purely additive spanners.
    Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2005, Vancouver, British Columbia, Canada, January 23-25, 2005 2005 (0) 2005
    Conference paper
    Telikepalli Kavitha, Kurt Mehlhorn.
    A Polynomial Time Algorithm for Minimum Cycle Basis in Directed Graphs.
    STACS 2005, 22nd Annual Symposium on Theoretical Aspects of Computer Science, Stuttgart, Germany, February 24-26, 2005, Proceedings 2005 (0) 2005
    Conference paper
    Amit Deshpande, Rahul Jain, Telikepalli Kavitha, Satyanarayana V. Lokam, Jaikumar Radhakrishnan.
    Lower bounds for adaptive locally decodable codes.
    Random Struct. Algorithms 2005, Volume 27 (0) 2005
    Conference paper
    Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail, Katarzyna E. Paluch.
    A Faster Algorithm for Minimum Cycle Basis of Graphs.
    Automata, Languages and Programming: 31st International Colloquium, ICALP 2004, Turku, Finland, July 12-16, 2004. Proceedings 2004 (0) 2004
    Conference paper
    Robert W. Irving, Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail, Katarzyna E. Paluch.
    Rank-maximal matchings.
    Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2004, New Orleans, Louisiana, USA, January 11-14, 2004 2004 (0) 2004
    Conference paper
    Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail, Katarzyna E. Paluch.
    Strongly Stable Matchings in Time O(nm) and Extension to the Hospitals-Residents Problem.
    STACS 2004, 21st Annual Symposium on Theoretical Aspects of Computer Science, Montpellier, France, March 25-27, 2004, Proceedings 2004 (0) 2004
    Conference paper
    Telikepalli Kavitha, Kasturi R. Varadarajan.
    On shortest paths in line arrangements.
    CCCG 2003 (0) 2003
    Conference paper
    L. Sunil Chandran, Telikepalli Kavitha, C. R. Subramanian.
    Isoperimetric Inequalities and the Width Parameters of Graphs.
    Computing and Combinatorics, 9th Annual International Conference, COCOON 2003, Big Sky, MT, USA, July 25-28, 2003, Proceedings 2003 (0) 2003
    Conference paper
    Telikepalli Kavitha.
    Efficient Algorithms for Abelian Group Isomorphism and Related Problems.
    FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science, 23rd Conference, Mumbai, India, December 15-17, 2003, Proceedings 2003 (0) 2003
    Conference paper
    Amit Deshpande, Rahul Jain, Telikepalli Kavitha, Jaikumar Radhakrishnan, Satyanarayana V. Lokam.
    Better Lower Bounds for Locally Decodable Codes.
    IEEE Conference on Computational Complexity 2002 (0) 2002
    Conference paper
    Jean-Daniel Boissonnat, Subir Kumar Ghosh, Telikepalli Kavitha, Sylvain Lazard.
    An Algorithm for Computing a Convex and Simple Path of Bounded Curvature in a Simple Polygon.
    Algorithmica 2002, Volume 34 (0) 2002
    Show item 1 to 89 of 89  

    Your query returned 89 matches in the database.