| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Telikepalli Kavitha, Julián Mestre |
Max-coloring paths: tight bounds and extensions.  |
J. Comb. Optim.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Telikepalli Kavitha |
Properties of Gomory-Hu co-cycle bases. |
Theor. Comput. Sci. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Telikepalli Kavitha |
Faster Algorithms for All-Pairs Small Stretch Distances in Weighted Graphs. |
Algorithmica |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Bernhard Haeupler, Telikepalli Kavitha, Rogers Mathew, Siddhartha Sen, Robert Endre Tarjan |
Incremental Cycle Detection, Topological Ordering, and Strong Component Maintenance. |
ACM Transactions on Algorithms |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Chien-Chung Huang, Telikepalli Kavitha |
Efficient algorithms for maximum weight matchings in general graphs with small edge weights. |
SODA |
2012 |
DBLP BibTeX RDF |
|
| 1 | Telikepalli Kavitha |
Popularity vs maximum cardinality in the stable marriage setting. |
SODA |
2012 |
DBLP BibTeX RDF |
|
| 1 | Telikepalli Kavitha, Meghana Nasre |
Popular matchings with variable item copies. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Telikepalli Kavitha, Julián Mestre, Meghana Nasre |
Popular mixed matchings. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail |
New Approximation Algorithms for Minimum Cycle Bases of Graphs. |
Algorithmica |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Chien-Chung Huang, Telikepalli Kavitha, Dimitrios Michail, Meghana Nasre |
Bounded Unpopularity Matchings. |
Algorithmica |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Bernhard Haeupler, Telikepalli Kavitha, Rogers Mathew, Siddhartha Sen, Robert Endre Tarjan |
Incremental Cycle Detection, Topological Ordering, and Strong Component Maintenance |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Chien-Chung Huang, Telikepalli Kavitha |
Near-Popular Matchings in the Roommates Problem. |
ESA |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Chien-Chung Huang, Telikepalli Kavitha |
Popular Matchings in the Stable Marriage Problem. |
ICALP |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Naveen Garg, Telikepalli Kavitha, Amit Kumar, Kurt Mehlhorn, Julián Mestre |
Assigning Papers to Referees. |
Algorithmica |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Surender Baswana, Telikepalli Kavitha, Kurt Mehlhorn, Seth Pettie |
Additive spanners and (alpha, beta)-spanners. |
ACM Transactions on Algorithms |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Telikepalli Kavitha, Meghana Nasre, Prajakta Nimbhorkar |
Popularity at Minimum Cost |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | David J. Abraham, Telikepalli Kavitha |
Voting Paths. |
SIAM J. Discrete Math. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Surender Baswana, Telikepalli Kavitha |
Faster Algorithms for All-pairs Approximate Shortest Paths in Undirected Graphs. |
SIAM J. Comput. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Telikepalli Kavitha, Meghana Nasre, Prajakta Nimbhorkar |
Popularity at Minimum Cost. |
ISAAC |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Telikepalli Kavitha, Meghana Nasre |
Optimal popular matchings. |
Discrete Applied Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Telikepalli Kavitha, Julián Mestre, Meghana Nasre |
Popular Mixed Matchings. |
ICALP |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Telikepalli Kavitha, Meghana Nasre |
Popular Matchings with Variable Job Capacities. |
ISAAC |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Telikepalli Kavitha, Julián Mestre |
Max-Coloring Paths: Tight Bounds and Extensions. |
ISAAC |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail, Katarzyna E. Paluch |
An [(O)\tilde](m2n)\tilde{O}(m^{2}n) Algorithm for Minimum Cycle Basis of Graphs. |
Algorithmica |
2008 |
DBLP DOI BibTeX RDF |
Cycle basis, Cycle space, Matrix multiplication, Polynomial algorithms |
| 1 | Ramesh Hariharan, Telikepalli Kavitha, Kurt Mehlhorn |
Faster Algorithms for Minimum Cycle Basis in Directed Graphs. |
SIAM J. Comput. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Telikepalli Kavitha, Katakam Vamsi Krishna |
An improved heuristic for computing short integral cycle bases. |
ACM Journal of Experimental Algorithmics |
2008 |
DBLP DOI BibTeX RDF |
integral cycle basis, minimum cycle basis, combinatorial optimization, Directed graph |
| 1 | Telikepalli Kavitha |
Ranked Matching. |
Encyclopedia of Algorithms |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Anand Bhalgat, Ramesh Hariharan, Telikepalli Kavitha, Debmalya Panigrahi |
Fast edge splitting and Edmonds' arborescence construction for unweighted graphs. |
SODA |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Bernhard Haeupler, Telikepalli Kavitha, Rogers Mathew, Siddhartha Sen, Robert Endre Tarjan |
Faster Algorithms for Incremental Topological Ordering. |
ICALP |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Chien-Chung Huang, Telikepalli Kavitha, Dimitrios Michail, Meghana Nasre |
Bounded Unpopularity Matchings. |
SWAT |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Telikepalli Kavitha |
On a Special Co-cycle Basis of Graphs. |
SWAT |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Telikepalli Kavitha |
Dynamic matrix rank with partial lookahead. |
FSTTCS |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail, Katarzyna E. Paluch |
Strongly stable matchings in time O(nm) and extension to the hospitals-residents problem. |
ACM Transactions on Algorithms |
2007 |
DBLP DOI BibTeX RDF |
level maximal, Bipartite matching, strong stability, stable marriage |
| 1 | Telikepalli Kavitha, Rogers Mathew |
Faster Algorithms for Online Topological Ordering |
CoRR |
2007 |
DBLP BibTeX RDF |
|
| 1 | Telikepalli Kavitha, Kurt Mehlhorn |
Algorithms to Compute Minimum Cycle Basis in Directed Graphs. |
Theory Comput. Syst. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Telikepalli Kavitha |
Linear time algorithms for Abelian group isomorphism and related problems. |
J. Comput. Syst. Sci. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | David J. Abraham, Robert W. Irving, Telikepalli Kavitha, Kurt Mehlhorn |
Popular Matchings. |
SIAM J. Comput. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Ramesh Hariharan, Telikepalli Kavitha, Debmalya Panigrahi |
Efficient algorithms for computing all low s-t edge connectivities and related problems. |
SODA |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail |
New Approximation Algorithms for Minimum Cycle Bases of Graphs. |
STACS |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Telikepalli Kavitha |
Faster Algorithms for All-Pairs Small Stretch Distances in Weighted Graphs. |
FSTTCS |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Ramesh Hariharan, Telikepalli Kavitha, Debmalya Panigrahi, Anand Bhalgat |
An Õ(mn) Gomory-Hu tree construction algorithm for unweighted graphs. |
STOC |
2007 |
DBLP DOI BibTeX RDF |
Gomory-Hu tree, cut tree, steiner edge connectivity, edge connectivity, min cut |
| 1 | L. Sunil Chandran, Telikepalli Kavitha |
The carvingwidth of hypercubes. |
Discrete Mathematics |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | L. Sunil Chandran, Telikepalli Kavitha |
The treewidth and pathwidth of hypercubes. |
Discrete Mathematics |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert W. Irving, Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail, Katarzyna E. Paluch |
Rank-maximal matchings. |
ACM Transactions on Algorithms |
2006 |
DBLP DOI BibTeX RDF |
maximum cardinality matching, one-sided preference lists, Bipartite matching |
| 1 | Ramesh Hariharan, Telikepalli Kavitha, Kurt Mehlhorn |
A Faster Deterministic Algorithm for Minimum Cycle Bases in Directed Graphs. |
ICALP |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | David J. Abraham, Telikepalli Kavitha |
Dynamic Matching Markets and Voting Paths. |
SWAT |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Surender Baswana, Telikepalli Kavitha |
Faster Algorithms for Approximate Distance Oracles and All-Pairs Small Stretch Paths. |
FOCS |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Telikepalli Kavitha, Chintan D. Shah |
Efficient Algorithms for Weighted Rank-Maximal Matchings and Related Problems. |
ISAAC |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Amit Deshpande, Rahul Jain, Telikepalli Kavitha, Satyanarayana V. Lokam, Jaikumar Radhakrishnan |
Lower bounds for adaptive locally decodable codes. |
Random Struct. Algorithms |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Surender Baswana, Telikepalli Kavitha, Kurt Mehlhorn, Seth Pettie |
New constructions of (alpha, beta)-spanners and purely additive spanners. |
SODA |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | David J. Abraham, Robert W. Irving, Telikepalli Kavitha, Kurt Mehlhorn |
Popular matchings. |
SODA |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Telikepalli Kavitha |
An Õ(m2n) Randomized Algorithm to Compute a Minimum Cycle Basis of a Directed Graph. |
ICALP |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Telikepalli Kavitha, Kurt Mehlhorn |
A Polynomial Time Algorithm for Minimum Cycle Basis in Directed Graphs. |
STACS |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert W. Irving, Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail, Katarzyna E. Paluch |
Rank-maximal matchings. |
SODA |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail, Katarzyna E. Paluch |
A Faster Algorithm for Minimum Cycle Basis of Graphs. |
ICALP |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Telikepalli Kavitha, Kasturi R. Varadarajan |
On shortest paths in line arrangements. |
CCCG |
2003 |
DBLP BibTeX RDF |
|
| 1 | L. Sunil Chandran, Telikepalli Kavitha, C. R. Subramanian |
Isoperimetric Inequalities and the Width Parameters of Graphs. |
COCOON |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Telikepalli Kavitha |
Efficient Algorithms for Abelian Group Isomorphism and Related Problems. |
FSTTCS |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Amit Deshpande, Rahul Jain, Telikepalli Kavitha, Jaikumar Radhakrishnan, Satyanarayana V. Lokam |
Better Lower Bounds for Locally Decodable Codes. (PDF / PS) |
IEEE Conference on Computational Complexity |
2002 |
DBLP DOI BibTeX RDF |
Second Moment Method, Probabilistically Checkable Proof Systems, Error Correcting Codes, Pseudorandom Generators, Private Information Retrieval |
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")