dblp.uni-trier.dewww.uni-trier.de

Telikepalli Kavitha Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

*2009
40EETelikepalli Kavitha, Julián Mestre, Meghana Nasre: Popular Mixed Matchings. ICALP (1) 2009: 574-584
39EETelikepalli Kavitha, Meghana Nasre: Optimal popular matchings. Discrete Applied Mathematics 157(14): 3181-3186 (2009)
2008
38EETelikepalli Kavitha: Dynamic matrix rank with partial lookahead. FSTTCS 2008
37EEBernhard Haeupler, Telikepalli Kavitha, Rogers Mathew, Siddhartha Sen, Robert Endre Tarjan: Faster Algorithms for Incremental Topological Ordering. ICALP (1) 2008: 421-433
36EEAnand Bhalgat, Ramesh Hariharan, Telikepalli Kavitha, Debmalya Panigrahi: Fast edge splitting and Edmonds' arborescence construction for unweighted graphs. SODA 2008: 455-464
35EEChien-Chung Huang, Telikepalli Kavitha, Dimitrios Michail, Meghana Nasre: Bounded Unpopularity Matchings. SWAT 2008: 127-137
34EETelikepalli Kavitha: On a Special Co-cycle Basis of Graphs. SWAT 2008: 343-354
33EETelikepalli Kavitha: Ranked Matching. Encyclopedia of Algorithms 2008
32EETelikepalli Kavitha, Katakam Vamsi Krishna: An improved heuristic for computing short integral cycle bases. ACM Journal of Experimental Algorithmics 13: (2008)
31EETelikepalli 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 52(3): 333-349 (2008)
30EERamesh Hariharan, Telikepalli Kavitha, Kurt Mehlhorn: Faster Algorithms for Minimum Cycle Basis in Directed Graphs. SIAM J. Comput. 38(4): 1430-1447 (2008)
2007
29EETelikepalli Kavitha: Faster Algorithms for All-Pairs Small Stretch Distances in Weighted Graphs. FSTTCS 2007: 328-339
28EERamesh Hariharan, Telikepalli Kavitha, Debmalya Panigrahi: Efficient algorithms for computing all low s-t edge connectivities and related problems. SODA 2007: 127-136
27EETelikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail: New Approximation Algorithms for Minimum Cycle Bases of Graphs. STACS 2007: 512-523
26EERamesh Hariharan, Telikepalli Kavitha, Debmalya Panigrahi, Anand Bhalgat: An Õ(mn) Gomory-Hu tree construction algorithm for unweighted graphs. STOC 2007: 605-614
25EETelikepalli 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 3(2): (2007)
24EETelikepalli Kavitha, Rogers Mathew: Faster Algorithms for Online Topological Ordering CoRR abs/0711.0251: (2007)
23EETelikepalli Kavitha: Linear time algorithms for Abelian group isomorphism and related problems. J. Comput. Syst. Sci. 73(6): 986-996 (2007)
22EEDavid J. Abraham, Robert W. Irving, Telikepalli Kavitha, Kurt Mehlhorn: Popular Matchings. SIAM J. Comput. 37(4): 1030-1045 (2007)
21EETelikepalli Kavitha, Kurt Mehlhorn: Algorithms to Compute Minimum Cycle Basis in Directed Graphs. Theory Comput. Syst. 40(4): 485-505 (2007)
2006
20EESurender Baswana, Telikepalli Kavitha: Faster Algorithms for Approximate Distance Oracles and All-Pairs Small Stretch Paths. FOCS 2006: 591-602
19EERamesh Hariharan, Telikepalli Kavitha, Kurt Mehlhorn: A Faster Deterministic Algorithm for Minimum Cycle Bases in Directed Graphs. ICALP (1) 2006: 250-261
18EETelikepalli Kavitha, Chintan D. Shah: Efficient Algorithms for Weighted Rank-Maximal Matchings and Related Problems. ISAAC 2006: 153-162
17EEDavid J. Abraham, Telikepalli Kavitha: Dynamic Matching Markets and Voting Paths. SWAT 2006: 65-76
16EERobert W. Irving, Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail, Katarzyna E. Paluch: Rank-maximal matchings. ACM Transactions on Algorithms 2(4): 602-610 (2006)
15EEL. Sunil Chandran, Telikepalli Kavitha: The carvingwidth of hypercubes. Discrete Mathematics 306(18): 2270-2274 (2006)
14EEL. Sunil Chandran, Telikepalli Kavitha: The treewidth and pathwidth of hypercubes. Discrete Mathematics 306(3): 359-365 (2006)
2005
13EETelikepalli Kavitha: An Õ(m2n) Randomized Algorithm to Compute a Minimum Cycle Basis of a Directed Graph. ICALP 2005: 273-284
12EEDavid J. Abraham, Robert W. Irving, Telikepalli Kavitha, Kurt Mehlhorn: Popular matchings. SODA 2005: 424-432
11EESurender Baswana, Telikepalli Kavitha, Kurt Mehlhorn, Seth Pettie: New constructions of (alpha, beta)-spanners and purely additive spanners. SODA 2005: 672-681
10EETelikepalli Kavitha, Kurt Mehlhorn: A Polynomial Time Algorithm for Minimum Cycle Basis in Directed Graphs. STACS 2005: 654-665
9EEAmit Deshpande, Rahul Jain, Telikepalli Kavitha, Satyanarayana V. Lokam, Jaikumar Radhakrishnan: Lower bounds for adaptive locally decodable codes. Random Struct. Algorithms 27(3): 358-378 (2005)
2004
8EETelikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail, Katarzyna E. Paluch: A Faster Algorithm for Minimum Cycle Basis of Graphs. ICALP 2004: 846-857
7EERobert W. Irving, Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail, Katarzyna E. Paluch: Rank-maximal matchings. SODA 2004: 68-75
6EETelikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail, Katarzyna E. Paluch: Strongly Stable Matchings in Time O(nm) and Extension to the Hospitals-Residents Problem. STACS 2004: 222-233
2003
5 Telikepalli Kavitha, Kasturi R. Varadarajan: On shortest paths in line arrangements. CCCG 2003: 170-173
4EEL. Sunil Chandran, Telikepalli Kavitha, C. R. Subramanian: Isoperimetric Inequalities and the Width Parameters of Graphs. COCOON 2003: 385-393
3EETelikepalli Kavitha: Efficient Algorithms for Abelian Group Isomorphism and Related Problems. FSTTCS 2003: 277-288
2002
2EEAmit Deshpande, Rahul Jain, Telikepalli Kavitha, Jaikumar Radhakrishnan, Satyanarayana V. Lokam: Better Lower Bounds for Locally Decodable Codes. IEEE Conference on Computational Complexity 2002: 184-193
1EEJean-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 34(2): 109-156 (2002)

Coauthor Index

1David J. Abraham [12] [17] [22]
2Surender Baswana [11] [20]
3Anand Bhalgat [26] [36]
4Jean-Daniel Boissonnat [1]
5L. Sunil Chandran [4] [14] [15]
6Amit Deshpande [2] [9]
7Subir Kumar Ghosh [1]
8Bernhard Haeupler [37]
9Ramesh Hariharan [19] [26] [28] [30] [36]
10Chien-Chung Huang [35]
11Robert W. Irving [7] [12] [16] [22]
12Rahul Jain [2] [9]
13Katakam Vamsi Krishna [32]
14Sylvain Lazard [1]
15Satyanarayana V. Lokam [2] [9]
16Rogers Mathew [24] [37]
17Kurt Mehlhorn [6] [7] [8] [10] [11] [12] [16] [19] [21] [22] [25] [27] [30] [31]
18Julián Mestre [40]
19Dimitrios Michail [6] [7] [8] [16] [25] [27] [31] [35]
20Meghana Nasre [35] [39] [40]
21Katarzyna E. Paluch [6] [7] [8] [16] [25] [31]
22Debmalya Panigrahi [26] [28] [36]
23Seth Pettie [11]
24Jaikumar Radhakrishnan [2] [9]
25Siddhartha Sen [37]
26Chintan D. Shah [18]
27C. R. Subramanian [4]
28Robert Endre Tarjan [37]
29Kasturi R. Varadarajan [5]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)