MetaCart Sign in to MyCiteSeerX

Documents
Authors
Tables !

Searching for authors named "Telikepalli Kavitha" – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

14 documents found, showing 1 through 10. Next 10 →

ATOM

Dynamic matrix rank with partial lookahead
by Telikepalli Kavitha
…. Hariharan, M. Mukund, V. Vinay; pp 268-279 Dynamic matrix rank with partial lookahead Telikepalli Kavitha…
Add To MetaCart

Faster algorithms for approximate distance oracles and all-pairs small stretch paths
by Surender Baswana, Telikepalli Kavitha — 2006 — In Proceedings of the 47th Annual IEEE FOCS
… Baswana ∗ Telikepalli Kavitha † Abstract Let G = (V, E) be a weighted undirected graph with |V | = n…
Cited by 6 (2 self) – Add To MetaCart

A Polynomial Time Algorithm for Minimum Cycle Basis in Directed Graphs
by Telikepalli Kavitha, Kurt Mehlhorn — 2005 — In Proc. of STACS, LNCS 3404
…A Polynomial Time Algorithm for Minimum Cycle Basis in Directed Graphs Telikepalli Kavitha ⋆ Kurt…
Cited by 6 (3 self) – Add To MetaCart

Algorithms to Compute Minimum Cycle Basis in Directed Graphs
by Telikepalli Kavitha, Kurt Mehlhorn — 2005 — in Proc. of STACS, LNCS 3404
…Algorithms to Compute Minimum Cycle Basis in Directed Graphs ∗ Telikepalli Kavitha † Kurt Mehlhorn…
Cited by 1 (1 self) – Add To MetaCart

Faster algorithms for online topological ordering
by Telikepalli Kavitha, Rogers Mathew, Telikepalli Kavitha, Rogers Mathew — 2007
…Faster Algorithms for Online Topological Ordering Telikepalli Kavitha Rogers Mathew IISC…
Cited by 2 (0 self) – Add To MetaCart

Strongly Stable Matchings in Time O(nm)
by Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail, Katarzyna Paluch — 2003
…Strongly Stable Matchings in Time O nm . Telikepalli Kavitha£Kurt Mehlhorn£Dimitrios Michail…
Add To MetaCart

Dynamic matching markets and voting paths
by David J. Abraham, Telikepalli Kavitha — 2006 — In Proc. of the 10th Scandinavian Workshop on Algorithm Theory, Lecture Notes in Computer Science 4059
…Dynamic Matching Markets and Voting Paths ⋆ David J. Abraham 1 and Telikepalli Kavitha 2 1…
Cited by 2 (0 self) – Add To MetaCart

Efficient Algorithms for Weighted Rank-Maximal Matchings and Related Problems
by Telikepalli Kavitha, Chintan D. Shah — 2006 — ISAAC ’06: the 17th International Symposium on Algorithms and Computation
…Efficient Algorithms for Weighted Rank-Maximal Matchings and Related Problems Telikepalli Kavitha…
Cited by 2 (1 self) – Add To MetaCart

New approximation algorithms for minimum cycle bases of graphs
by Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail — 2007 — In 24th Annual Symposium on Theoretical Aspects of Computer Science (STACS), volume 4393 of Lecture Notes in Computer Science
…New Approximation Algorithms for Minimum Cycle Bases of Graphs ∗ Telikepalli Kavitha † Kurt…
Cited by 2 (2 self) – Add To MetaCart

A faster algorithm for minimum cycle basis of graphs
by Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail — 2004 — In 31st International Colloquium on Automata, Languages and Programming
…A faster algorithm for Minimum Cycle Basis of graphs Telikepalli Kavitha 1⋆ , Kurt Mehlhorn 1…
Cited by 15 (10 self) – Add To MetaCart

Showing 1 through 10. Next 10 →

ATOM

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB