Telikepalli Kavitha

	2012
62		Telikepalli Kavitha: Popularity vs maximum cardinality in the stable marriage setting. SODA 2012: 123-134
61		Chien-Chung Huang, Telikepalli Kavitha: Efficient algorithms for maximum weight matchings in general graphs with small edge weights. SODA 2012: 1400-1412
60		Bernhard Haeupler, Telikepalli Kavitha, Rogers Mathew, Siddhartha Sen, Robert Endre Tarjan: Incremental Cycle Detection, Topological Ordering, and Strong Component Maintenance. ACM Transactions on Algorithms 8(1): 3 (2012)
59		Telikepalli Kavitha: Faster Algorithms for All-Pairs Small Stretch Distances in Weighted Graphs. Algorithmica 63(1-2): 224-245 (2012)
58		Telikepalli Kavitha, Julián Mestre: Max-coloring paths: tight bounds and extensions. J. Comb. Optim. 24(1): 1-14 (2012)
57		Telikepalli Kavitha: Properties of Gomory-Hu co-cycle bases. Theor. Comput. Sci. 420: 48-55 (2012)
	2011
56		Chien-Chung Huang, Telikepalli Kavitha: Near-Popular Matchings in the Roommates Problem. ESA 2011: 167-179
55		Chien-Chung Huang, Telikepalli Kavitha: Popular Matchings in the Stable Marriage Problem. ICALP (1) 2011: 666-677
54		Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail: New Approximation Algorithms for Minimum Cycle Bases of Graphs. Algorithmica 59(4): 471-488 (2011)
53		Chien-Chung Huang, Telikepalli Kavitha, Dimitrios Michail, Meghana Nasre: Bounded Unpopularity Matchings. Algorithmica 61(3): 738-757 (2011)
52		Bernhard Haeupler, Telikepalli Kavitha, Rogers Mathew, Siddhartha Sen, Robert Endre Tarjan: Incremental Cycle Detection, Topological Ordering, and Strong Component Maintenance CoRR abs/1105.2397: (2011)
51		Telikepalli Kavitha, Meghana Nasre: Popular matchings with variable item copies. Theor. Comput. Sci. 412(12-14): 1263-1274 (2011)
50		Telikepalli Kavitha, Julián Mestre, Meghana Nasre: Popular mixed matchings. Theor. Comput. Sci. 412(24): 2679-2690 (2011)
	2010
49		Telikepalli Kavitha, Meghana Nasre, Prajakta Nimbhorkar: Popularity at Minimum Cost. ISAAC (1) 2010: 145-156
48		Surender Baswana, Telikepalli Kavitha, Kurt Mehlhorn, Seth Pettie: Additive spanners and (alpha, beta)-spanners. ACM Transactions on Algorithms 7(1): 5 (2010)
47		Naveen Garg, Telikepalli Kavitha, Amit Kumar, Kurt Mehlhorn, Julián Mestre: Assigning Papers to Referees. Algorithmica 58(1): 119-136 (2010)
46		Telikepalli Kavitha, Meghana Nasre, Prajakta Nimbhorkar: Popularity at Minimum Cost CoRR abs/1009.2591: (2010)
45		Surender Baswana, Telikepalli Kavitha: Faster Algorithms for All-pairs Approximate Shortest Paths in Undirected Graphs. SIAM J. Comput. 39(7): 2865-2896 (2010)
44		David J. Abraham, Telikepalli Kavitha: Voting Paths. SIAM J. Discrete Math. 24(2): 520-537 (2010)
	2009
43		Telikepalli Kavitha, Julián Mestre, Meghana Nasre: Popular Mixed Matchings. ICALP (1) 2009: 574-584
42		Telikepalli Kavitha, Meghana Nasre: Popular Matchings with Variable Job Capacities. ISAAC 2009: 423-433
41		Telikepalli Kavitha, Julián Mestre: Max-Coloring Paths: Tight Bounds and Extensions. ISAAC 2009: 87-96
40		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 3(4): 199-243 (2009)
39		Telikepalli Kavitha, Meghana Nasre: Optimal popular matchings. Discrete Applied Mathematics 157(14): 3181-3186 (2009)
	2008
38		Telikepalli Kavitha: Dynamic matrix rank with partial lookahead. FSTTCS 2008: 268-279
37		Bernhard Haeupler, Telikepalli Kavitha, Rogers Mathew, Siddhartha Sen, Robert Endre Tarjan: Faster Algorithms for Incremental Topological Ordering. ICALP (1) 2008: 421-433
36		Anand Bhalgat, Ramesh Hariharan, Telikepalli Kavitha, Debmalya Panigrahi: Fast edge splitting and Edmonds' arborescence construction for unweighted graphs. SODA 2008: 455-464
35		Chien-Chung Huang, Telikepalli Kavitha, Dimitrios Michail, Meghana Nasre: Bounded Unpopularity Matchings. SWAT 2008: 127-137
34		Telikepalli Kavitha: On a Special Co-cycle Basis of Graphs. SWAT 2008: 343-354
33		Telikepalli Kavitha: Ranked Matching. Encyclopedia of Algorithms 2008
32		Telikepalli Kavitha, Katakam Vamsi Krishna: An improved heuristic for computing short integral cycle bases. ACM Journal of Experimental Algorithmics 13: (2008)
31		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 52(3): 333-349 (2008)
30		Ramesh Hariharan, Telikepalli Kavitha, Kurt Mehlhorn: Faster Algorithms for Minimum Cycle Basis in Directed Graphs. SIAM J. Comput. 38(4): 1430-1447 (2008)
	2007
29		Telikepalli Kavitha: Faster Algorithms for All-Pairs Small Stretch Distances in Weighted Graphs. FSTTCS 2007: 328-339
28		Ramesh Hariharan, Telikepalli Kavitha, Debmalya Panigrahi: Efficient algorithms for computing all low s-t edge connectivities and related problems. SODA 2007: 127-136
27		Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail: New Approximation Algorithms for Minimum Cycle Bases of Graphs. STACS 2007: 512-523
26		Ramesh Hariharan, Telikepalli Kavitha, Debmalya Panigrahi, Anand Bhalgat: An Õ(mn) Gomory-Hu tree construction algorithm for unweighted graphs. STOC 2007: 605-614
25		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 3(2): (2007)
24		Telikepalli Kavitha, Rogers Mathew: Faster Algorithms for Online Topological Ordering CoRR abs/0711.0251: (2007)
23		Telikepalli Kavitha: Linear time algorithms for Abelian group isomorphism and related problems. J. Comput. Syst. Sci. 73(6): 986-996 (2007)
22		David J. Abraham, Robert W. Irving, Telikepalli Kavitha, Kurt Mehlhorn: Popular Matchings. SIAM J. Comput. 37(4): 1030-1045 (2007)
21		Telikepalli Kavitha, Kurt Mehlhorn: Algorithms to Compute Minimum Cycle Basis in Directed Graphs. Theory Comput. Syst. 40(4): 485-505 (2007)
	2006
20		Surender Baswana, Telikepalli Kavitha: Faster Algorithms for Approximate Distance Oracles and All-Pairs Small Stretch Paths. FOCS 2006: 591-602
19		Ramesh Hariharan, Telikepalli Kavitha, Kurt Mehlhorn: A Faster Deterministic Algorithm for Minimum Cycle Bases in Directed Graphs. ICALP (1) 2006: 250-261
18		Telikepalli Kavitha, Chintan D. Shah: Efficient Algorithms for Weighted Rank-Maximal Matchings and Related Problems. ISAAC 2006: 153-162
17		David J. Abraham, Telikepalli Kavitha: Dynamic Matching Markets and Voting Paths. SWAT 2006: 65-76
16		Robert W. Irving, Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail, Katarzyna E. Paluch: Rank-maximal matchings. ACM Transactions on Algorithms 2(4): 602-610 (2006)
15		L. Sunil Chandran, Telikepalli Kavitha: The carvingwidth of hypercubes. Discrete Mathematics 306(18): 2270-2274 (2006)
14		L. Sunil Chandran, Telikepalli Kavitha: The treewidth and pathwidth of hypercubes. Discrete Mathematics 306(3): 359-365 (2006)
	2005
13		Telikepalli Kavitha: An Õ(m2n) Randomized Algorithm to Compute a Minimum Cycle Basis of a Directed Graph. ICALP 2005: 273-284
12		David J. Abraham, Robert W. Irving, Telikepalli Kavitha, Kurt Mehlhorn: Popular matchings. SODA 2005: 424-432
11		Surender Baswana, Telikepalli Kavitha, Kurt Mehlhorn, Seth Pettie: New constructions of (alpha, beta)-spanners and purely additive spanners. SODA 2005: 672-681
10		Telikepalli Kavitha, Kurt Mehlhorn: A Polynomial Time Algorithm for Minimum Cycle Basis in Directed Graphs. STACS 2005: 654-665
9		Amit 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
8		Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail, Katarzyna E. Paluch: A Faster Algorithm for Minimum Cycle Basis of Graphs. ICALP 2004: 846-857
7		Robert W. Irving, Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail, Katarzyna E. Paluch: Rank-maximal matchings. SODA 2004: 68-75
6		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: 222-233
	2003
5		Telikepalli Kavitha, Kasturi R. Varadarajan: On shortest paths in line arrangements. CCCG 2003: 170-173
4		L. Sunil Chandran, Telikepalli Kavitha, C. R. Subramanian: Isoperimetric Inequalities and the Width Parameters of Graphs. COCOON 2003: 385-393
3		Telikepalli Kavitha: Efficient Algorithms for Abelian Group Isomorphism and Related Problems. FSTTCS 2003: 277-288
	2002
2		Amit 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
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 34(2): 109-156 (2002)

Coauthor Index

1	David J. Abraham	[12] [17] [22] [44]
2	Surender Baswana	[11] [20] [45] [48]
3	Anand Bhalgat	[26] [36]
4	Jean-Daniel Boissonnat	[1]
5	L. Sunil Chandran	[4] [14] [15]
6	Amit Deshpande	[2] [9]
7	Naveen Garg	[47]
8	Subir Kumar Ghosh	[1]
9	Bernhard Haeupler	[37] [52] [60]
10	Ramesh Hariharan	[19] [26] [28] [30] [36]
11	Chien-Chung Huang	[35] [53] [55] [56] [61]
12	Robert W. Irving	[7] [12] [16] [22]
13	Rahul Jain	[2] [9]
14	Katakam Vamsi Krishna	[32]
15	Amit Kumar	[47]
16	Sylvain Lazard	[1]
17	Christian Liebchen	[40]
18	Satyanarayana V. Lokam	[2] [9]
19	Rogers Mathew	[24] [37] [52] [60]
20	Kurt Mehlhorn	[6] [7] [8] [10] [11] [12] [16] [19] [21] [22] [25] [27] [30] [31] [40] [47] [48] [54]
21	Julián Mestre	[41] [43] [47] [50] [58]
22	Dimitrios Michail	[6] [7] [8] [16] [25] [27] [31] [35] [40] [53] [54]
23	Meghana Nasre	[35] [39] [42] [43] [46] [49] [50] [51] [53]
24	Prajakta Nimbhorkar	[46] [49]
25	Katarzyna E. Paluch	[6] [7] [8] [16] [25] [31]
26	Debmalya Panigrahi	[26] [28] [36]
27	Seth Pettie	[11] [48]
28	Jaikumar Radhakrishnan	[2] [9]
29	Romeo Rizzi	[40]
30	Siddhartha Sen	[37] [52] [60]
31	Chintan D. Shah	[18]
32	C. R. Subramanian	[4]
33	Robert Endre Tarjan	[37] [52] [60]
34	Torsten Ueckerdt	[40]
35	Kasturi R. Varadarajan	[5]
36	Katharina Anna Zweig (Katharina Anna Lehmann)	[40]

Colors in the list of coauthors

Last update Sat Jun 2 20:57:36 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page