The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Telikepalli Kavitha: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Telikepalli Kavitha, Kasturi R. Varadarajan
    On shortest paths in line arrangements. [Citation Graph (0, 0)][DBLP]
    CCCG, 2003, pp:170-173 [Conf]
  2. Amit Deshpande, Rahul Jain, Telikepalli Kavitha, Jaikumar Radhakrishnan, Satyanarayana V. Lokam
    Better Lower Bounds for Locally Decodable Codes. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2002, pp:184-193 [Conf]
  3. L. Sunil Chandran, Telikepalli Kavitha, C. R. Subramanian
    Isoperimetric Inequalities and the Width Parameters of Graphs. [Citation Graph (0, 0)][DBLP]
    COCOON, 2003, pp:385-393 [Conf]
  4. Surender Baswana, Telikepalli Kavitha
    Faster Algorithms for Approximate Distance Oracles and All-Pairs Small Stretch Paths. [Citation Graph (0, 0)][DBLP]
    FOCS, 2006, pp:591-602 [Conf]
  5. Telikepalli Kavitha
    Efficient Algorithms for Abelian Group Isomorphism and Related Problems. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2003, pp:277-288 [Conf]
  6. Ramesh Hariharan, Telikepalli Kavitha, Kurt Mehlhorn
    A Faster Deterministic Algorithm for Minimum Cycle Bases in Directed Graphs. [Citation Graph (0, 0)][DBLP]
    ICALP (1), 2006, pp:250-261 [Conf]
  7. Telikepalli Kavitha
    An Õ(m2n) Randomized Algorithm to Compute a Minimum Cycle Basis of a Directed Graph. [Citation Graph (0, 0)][DBLP]
    ICALP, 2005, pp:273-284 [Conf]
  8. Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail, Katarzyna E. Paluch
    A Faster Algorithm for Minimum Cycle Basis of Graphs. [Citation Graph (0, 0)][DBLP]
    ICALP, 2004, pp:846-857 [Conf]
  9. Telikepalli Kavitha, Chintan D. Shah
    Efficient Algorithms for Weighted Rank-Maximal Matchings and Related Problems. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2006, pp:153-162 [Conf]
  10. David J. Abraham, Robert W. Irving, Telikepalli Kavitha, Kurt Mehlhorn
    Popular matchings. [Citation Graph (0, 0)][DBLP]
    SODA, 2005, pp:424-432 [Conf]
  11. Surender Baswana, Telikepalli Kavitha, Kurt Mehlhorn, Seth Pettie
    New constructions of (alpha, beta)-spanners and purely additive spanners. [Citation Graph (0, 0)][DBLP]
    SODA, 2005, pp:672-681 [Conf]
  12. Robert W. Irving, Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail, Katarzyna E. Paluch
    Rank-maximal matchings. [Citation Graph (0, 0)][DBLP]
    SODA, 2004, pp:68-75 [Conf]
  13. Telikepalli Kavitha, Kurt Mehlhorn
    A Polynomial Time Algorithm for Minimum Cycle Basis in Directed Graphs. [Citation Graph (0, 0)][DBLP]
    STACS, 2005, pp:654-665 [Conf]
  14. Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail, Katarzyna E. Paluch
    Strongly Stable Matchings in Time O(nm) and Extension to the Hospitals-Residents Problem. [Citation Graph (0, 0)][DBLP]
    STACS, 2004, pp:222-233 [Conf]
  15. Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail
    New Approximation Algorithms for Minimum Cycle Bases of Graphs. [Citation Graph (0, 0)][DBLP]
    STACS, 2007, pp:512-523 [Conf]
  16. David J. Abraham, Telikepalli Kavitha
    Dynamic Matching Markets and Voting Paths. [Citation Graph (0, 0)][DBLP]
    SWAT, 2006, pp:65-76 [Conf]
  17. 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. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2002, v:34, n:2, pp:109-156 [Journal]
  18. L. Sunil Chandran, Telikepalli Kavitha
    The treewidth and pathwidth of hypercubes. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:3, pp:359-365 [Journal]
  19. L. Sunil Chandran, Telikepalli Kavitha
    The carvingwidth of hypercubes. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:18, pp:2270-2274 [Journal]
  20. Amit Deshpande, Rahul Jain, Telikepalli Kavitha, Satyanarayana V. Lokam, Jaikumar Radhakrishnan
    Lower bounds for adaptive locally decodable codes. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2005, v:27, n:3, pp:358-378 [Journal]
  21. Robert W. Irving, Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail, Katarzyna E. Paluch
    Rank-maximal matchings. [Citation Graph (0, 0)][DBLP]
    ACM Transactions on Algorithms, 2006, v:2, n:4, pp:602-610 [Journal]
  22. Ramesh Hariharan, Telikepalli Kavitha, Debmalya Panigrahi
    Efficient algorithms for computing all low s-t edge connectivities and related problems. [Citation Graph (0, 0)][DBLP]
    SODA, 2007, pp:127-136 [Conf]
  23. Ramesh Hariharan, Telikepalli Kavitha, Debmalya Panigrahi, Anand Bhalgat
    An Õ(mn) Gomory-Hu tree construction algorithm for unweighted graphs. [Citation Graph (0, 0)][DBLP]
    STOC, 2007, pp:605-614 [Conf]
  24. Telikepalli Kavitha
    Linear time algorithms for Abelian group isomorphism and related problems. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2007, v:73, n:6, pp:986-996 [Journal]
  25. Telikepalli Kavitha, Kurt Mehlhorn
    Algorithms to Compute Minimum Cycle Basis in Directed Graphs. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2007, v:40, n:4, pp:485-505 [Journal]
  26. David J. Abraham, Robert W. Irving, Telikepalli Kavitha, Kurt Mehlhorn
    Popular Matchings. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2007, v:37, n:4, pp:1030-1045 [Journal]
  27. Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail, Katarzyna E. Paluch
    Strongly stable matchings in time O(nm) and extension to the hospitals-residents problem. [Citation Graph (0, 0)][DBLP]
    ACM Transactions on Algorithms, 2007, v:3, n:2, pp:- [Journal]

  28. Faster Algorithms for All-Pairs Small Stretch Distances in Weighted Graphs. [Citation Graph (, )][DBLP]


  29. Dynamic matrix rank with partial lookahead. [Citation Graph (, )][DBLP]


  30. Faster Algorithms for Incremental Topological Ordering. [Citation Graph (, )][DBLP]


  31. Popular Mixed Matchings. [Citation Graph (, )][DBLP]


  32. Max-Coloring Paths: Tight Bounds and Extensions. [Citation Graph (, )][DBLP]


  33. Fast edge splitting and Edmonds' arborescence construction for unweighted graphs. [Citation Graph (, )][DBLP]


  34. Bounded Unpopularity Matchings. [Citation Graph (, )][DBLP]


  35. On a Special Co-cycle Basis of Graphs. [Citation Graph (, )][DBLP]


  36. An [(O)\tilde](m2n)\tilde{O}(m^{2}n) Algorithm for Minimum Cycle Basis of Graphs. [Citation Graph (, )][DBLP]


  37. Faster Algorithms for Online Topological Ordering [Citation Graph (, )][DBLP]


  38. Optimal popular matchings. [Citation Graph (, )][DBLP]


Search in 0.014secs, Finished in 0.016secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002