×

Kavitha, Telikepalli

Author ID: kavitha.telikepalli Recent zbMATH articles by "Kavitha, Telikepalli"
Published as: Kavitha, Telikepalli; Kavitha, T.

Publications by Year

Citations contained in zbMATH Open

91 Publications have been cited 712 times in 343 Documents Cited by Year
Popular matchings. Zbl 1154.91033
Abraham, David J.; Irving, Robert W.; Kavitha, Telikepalli; Mehlhorn, Kurt
52
2007
Cycle bases in graphs characterization, algorithms, complexity, and applications. Zbl 1301.05195
Kavitha, Telikepalli; Liebchen, Christian; Mehlhorn, Kurt; Michail, Dimitrios; Rizzi, Romeo; Ueckerdt, Torsten; Zweig, Katharina A.
39
2009
Additive spanners and \(({\alpha}, {\beta})\)-spanners. Zbl 1295.05094
Baswana, Surender; Kavitha, Telikepalli; Mehlhorn, Kurt; Pettie, Seth
32
2010
Rank-maximal matchings. Zbl 1321.90116
Irving, Robert W.; Kavitha, Telikepalli; Mehlhorn, Kurt; Michail, Dimitrios; Paluch, Katarzyna E.
28
2006
The treewidth and pathwidth of hypercubes. Zbl 1083.05034
Sunil Chandran, L.; Kavitha, T.
21
2006
A faster algorithm for minimum cycle basis of graphs. Zbl 1103.05086
Kavitha, Telikepalli; Mehlhorn, Kurt; Michail, Dimitrios; Paluch, Katarzyna
21
2004
Popular matchings in the stable marriage problem. Zbl 1266.05120
Huang, Chien-Chung; Kavitha, Telikepalli
21
2013
Optimal popular matchings. Zbl 1213.05212
Kavitha, Telikepalli; Nasre, Meghana
18
2009
On pairwise spanners. Zbl 1354.05131
Cygan, Marek; Grandoni, Fabrizio; Kavitha, Telikepalli
18
2013
A size-popularity tradeoff in the stable marriage problem. Zbl 1310.68273
Kavitha, Telikepalli
17
2014
Assigning papers to referees. Zbl 1203.90092
Garg, Naveen; Kavitha, Telikepalli; Kumar, Amit; Mehlhorn, Kurt; Mestre, Julián
17
2010
Popular mixed matchings. Zbl 1220.68073
Kavitha, Telikepalli; Mestre, Julián; Nasre, Meghana
16
2011
New constructions of \(({\alpha}, {\beta})\)-spanners and purely additive spanners. Zbl 1297.05066
Baswana, Surender; Kavitha, Telikepalli; Mehlhorn, Kurt; Pettie, Seth
14
2005
An \(\widetilde O(mn)\) Gomory-Hu tree construction algorithm for unweighted graphs. Zbl 1231.05247
Hariharan, Ramesh; Kavitha, Telikepalli; Panigrahi, Debmalya; Bhalgat, Anand
13
2007
Popular matchings and limits to tractability. Zbl 1432.68162
Faenza, Yuri; Kavitha, Telikepalli; Powers, Vladlena; Zhang, Xingyu
12
2019
Linear time algorithms for Abelian group isomorphism and related problems. Zbl 1165.68036
Kavitha, T.
11
2007
Faster algorithms for all-pairs approximate shortest paths in undirected graphs. Zbl 1227.05231
Baswana, Surender; Kavitha, Telikepalli
11
2010
New pairwise spanners. Zbl 1356.05148
Kavitha, Telikepalli
11
2015
Popular mixed matchings. Zbl 1248.68249
Kavitha, Telikepalli; Mestre, Julián; Nasre, Meghana
11
2009
Popular half-integral matchings. Zbl 1388.68233
Kavitha, Telikepalli
11
2016
Bounded unpopularity matchings. Zbl 1155.91436
Huang, Chien-Chung; Kavitha, Telikepalli; Michail, Dimitrios; Nasre, Meghana
11
2008
Popular edges and dominant matchings. Zbl 1398.05162
Cseh, Ágnes; Kavitha, Telikepalli
11
2018
New approximation algorithms for minimum cycle bases of graphs. Zbl 1186.68561
Kavitha, Telikepalli; Mehlhorn, Kurt; Michail, Dimitrios
9
2007
Incremental cycle detection, topological ordering, and strong component maintenance. Zbl 1295.05234
Haeupler, Bernhard; Kavitha, Telikepalli; Mathew, Rogers; Sen, Siddhartha; Tarjan, Robert E.
9
2012
Popular matchings with two-sided preferences and one-sided ties. Zbl 1440.05166
Cseh, Ágnes; Huang, Chien-Chung; Kavitha, Telikepalli
9
2015
Strongly stable matchings in time \(O(nm)\) and extension to the hospitals-residents problem. Zbl 1321.05207
Kavitha, Telikepalli; Mehlhorn, Kurt; Michail, Dimitrios; Paluch, Katarzyna E.
9
2007
A little charity guarantees almost envy-freeness. Zbl 07304186
Chaudhury, Bhaskar Ray; Kavitha, Telikepalli; Mehlhorn, Kurt; Sgouritsa, Alkmini
9
2020
Popularity, mixed matchings, and self-duality. Zbl 1410.91354
Huang, Chien-Chung; Kavitha, Telikepalli
9
2017
Algorithms to compute minimum cycle basis in directed graphs. Zbl 1121.68087
Kavitha, Telikepalli; Mehlhorn, Kurt
8
2007
Efficient algorithms for weighted rank-maximal matchings and related problems. Zbl 1135.05314
Kavitha, Telikepalli; Shah, Chintan D.
8
2006
Max-coloring paths: tight bounds and extensions. Zbl 1254.90272
Kavitha, Telikepalli; Mestre, Julián
8
2012
Popular matchings with two-sided preferences and one-sided ties. Zbl 1372.05168
Cseh, Ágnes; Huang, Chien-Chung; Kavitha, Telikepalli
8
2017
Popular edges and dominant matchings. Zbl 1418.05107
Cseh, Ágnes; Kavitha, Telikepalli
8
2016
Small stretch pairwise spanners. Zbl 1336.68200
Kavitha, Telikepalli; Varma, Nithin M.
8
2013
Dynamic matching markets and voting paths. Zbl 1142.91690
Abraham, David J.; Kavitha, Telikepalli
7
2006
Popular matchings in the stable marriage problem. Zbl 1334.05168
Huang, Chien-Chung; Kavitha, Telikepalli
7
2011
Popular matchings. Zbl 1297.68087
Abraham, David J.; Irving, Robert W.; Kavitha, Telikepalli; Mehlhorn, Kurt
7
2005
New pairwise spanners. Zbl 1386.05185
Kavitha, Telikepalli
7
2017
Quasi-popular matchings, optimality, and extended formulations. Zbl 07304043
Faenza, Yuri; Kavitha, Telikepalli
7
2020
Distributed construction of purely additive spanners. Zbl 1393.68182
Censor-Hillel, Keren; Kavitha, Telikepalli; Paz, Ami; Yehudayoff, Amir
7
2016
The carvingwidth of hypercubes. Zbl 1102.05047
Chandran, L. Sunil; Kavitha, T.
6
2006
An \(\tilde{O}(m^{2}n)\) algorithm for minimum cycle basis of graphs. Zbl 1163.68329
Kavitha, Telikepalli; Mehlhorn, Kurt; Michail, Dimitrios; Paluch, Katarzyna E.
6
2008
Small stretch pairwise spanners and approximate \(D\)-preservers. Zbl 1327.05090
Kavitha, Telikepalli; Varma, Nithin M.
6
2015
Rank-maximal matchings. Zbl 1318.90060
Irving, Robert W.; Kavitha, Telikepalli; Mehlhorn, Kurt; Michail, Dimitrios; Paluch, Katarzyna
6
2004
Near-popular matchings in the roommates problem. Zbl 1267.68166
Huang, Chien-Chung; Kavitha, Telikepalli
6
2013
Popular matchings with variable item copies. Zbl 1217.68161
Kavitha, Telikepalli; Nasre, Meghana
5
2011
A polynomial time algorithm for minimum cycle basis in directed graphs. Zbl 1118.05314
Kavitha, Telikepalli; Mehlhorn, Kurt
5
2005
Efficient algorithms for maximum weight matchings in general graphs with small edge weights. Zbl 1423.05172
Huang, Chien-Chung; Kavitha, Telikepalli
5
2012
Popular branchings and their dual certificates. Zbl 1489.90156
Kavitha, Telikepalli; Király, Tamás; Matuschke, Jannik; Schlotter, Ildikó; Schmidt-Kraepelin, Ulrike
5
2022
Voting paths. Zbl 1214.68258
Abraham, David J.; Kavitha, Telikepalli
4
2010
Popular matchings with variable job capacities. Zbl 1273.68149
Kavitha, Telikepalli; Nasre, Meghana
4
2009
Faster algorithms for minimum cycle basis in directed graphs. Zbl 1178.68669
Hariharan, Ramesh; Kavitha, Telikepalli; Mehlhorn, Kurt
4
2008
Lower bounds for adaptive locally decodable codes. Zbl 1085.94024
Deshpande, Amit; Jain, Rahul; Kavitha, T.; Lokam, Satyanarayana V.; Radhakrishnan, Jaikumar
4
2005
A faster deterministic algorithm for minimum cycle bases in directed graphs. Zbl 1223.05298
Hariharan, Ramesh; Kavitha, Telikepalli; Mehlhorn, Kurt
4
2006
Maintaining near-popular matchings. Zbl 1440.68181
Bhattacharya, Sayan; Hoefer, Martin; Huang, Chien-Chung; Kavitha, Telikepalli; Wagner, Lisa
4
2015
Faster algorithms for incremental topological ordering. Zbl 1153.05329
Haeupler, Bernhard; Kavitha, Telikepalli; Mathew, Rogers; Sen, Siddhartha; Tarjan, Robert E.
4
2008
Improved approximation algorithms for two variants of the stable marriage problem with ties. Zbl 1411.91422
Huang, Chien-Chung; Kavitha, Telikepalli
4
2015
Popular matchings with multiple partners. Zbl 1491.68140
Brandl, Florian; Kavitha, Telikepalli
4
2018
Two problems in max-size popular matchings. Zbl 1426.91170
Brandl, Florian; Kavitha, Telikepalli
4
2019
A little charity guarantees almost envy-freeness. Zbl 1525.91102
Chaudhury, Bhaskar Ray; Kavitha, Telikepalli; Mehlhorn, Kurt; Sgouritsa, Alkmini
4
2021
Popularity, mixed matchings, and self-duality. Zbl 1471.90123
Huang, Chien-Chung; Kavitha, Telikepalli
4
2021
Strongly stable matchings in time \(O(nm)\) and extension to the hospitals-residents problem. Zbl 1122.68459
Kavitha, Telikepalli; Mehlhorn, Kurt; Michail, Dimitrios; Paluch, Katarzyna
3
2004
Max-coloring paths: tight bounds and extensions. Zbl 1272.68336
Kavitha, Telikepalli; Mestre, Julián
3
2009
An \(\tilde O( m^{2} n )\) randomized algorithm to compute a minimum cycle basis of a directed graph. Zbl 1082.68084
Kavitha, Telikepalli
3
2005
Popularity at minimum cost. Zbl 1296.90105
Kavitha, Telikepalli; Nasre, Meghana; Nimbhorkar, Prajakta
3
2014
Popular matchings of desired size. Zbl 1519.05204
Kavitha, Telikepalli
3
2018
Faster algorithms for all-pairs small stretch distances in weighted graphs. Zbl 1135.90424
Kavitha, Telikepalli
2
2007
Isoperimetric inequalities and the width parameters of graphs. Zbl 1276.05103
Chandran, L. Sunil; Kavitha, T.; Subramanian, C. R.
2
2003
New approximation algorithms for minimum cycle bases of graphs. Zbl 1215.68185
Kavitha, Telikepalli; Mehlhorn, Kurt; Michail, Dimitrios
2
2011
Distributed construction of purely additive spanners. Zbl 1451.68345
Censor-Hillel, Keren; Kavitha, Telikepalli; Paz, Ami; Yehudayoff, Amir
2
2018
Efficient algorithms for abelian group isomorphism and related problems. Zbl 1205.68521
Kavitha, T.
2
2003
Fair matchings and related problems. Zbl 1333.05241
Huang, Chien-Chung; Kavitha, Telikepalli; Mehlhorn, Kurt; Michail, Dimitrios
2
2016
Efficient algorithms for computing all low \(s\)-\(t\) edge connectivities and related problems. Zbl 1302.05188
Hariharan, Ramesh; Kavitha, Telikepalli; Panigrahi, Debmalya
2
2007
An algorithm for computing a convex and simple path of bounded curvature in a simple polygon. Zbl 1001.68180
Boissonnat, Jean-Daniel; Ghosh, S. K.; Kavitha, T.; Lazard, Sylvain
2
2002
Fast edge splitting and edmonds’ arborescence construction for unweighted graphs. Zbl 1192.05152
Bhalgat, Anand; Hariharan, Ramesh; Kavitha, Telikepalli; Panigrahi, Debmalya
2
2008
Popularity vs maximum cardinality in the stable marriage setting. Zbl 1423.05173
Kavitha, Telikepalli
2
2012
Popularity at minimum cost. Zbl 1310.68091
Kavitha, Telikepalli; Nasre, Meghana; Nimbhorkar, Prajakta
2
2010
Popular matchings in complete graphs. Zbl 1512.05333
Cseh, Ágnes; Kavitha, Telikepalli
2
2021
Understanding popular matchings via stable matchings. Zbl 1483.91135
Cseh, Ágnes; Faenza, Yuri; Kavitha, Telikepalli; Powers, Vladlena
2
2022
Popular branchings and their dual certificates. Zbl 1503.90149
Kavitha, Telikepalli; Király, Tamás; Matuschke, Jannik; Schlotter, Ildikó; Schmidt-Kraepelin, Ulrike
2
2020
Near-popular matchings in the roommates problem. Zbl 1346.05232
Huang, Chien-Chung; Kavitha, Telikepalli
1
2011
Dynamic matrix rank with partial lookahead. Zbl 1248.68543
Kavitha, Telikepalli
1
2008
Bounded unpopularity matchings. Zbl 1225.68097
Huang, Chien-Chung; Kavitha, Telikepalli; Michail, Dimitrios; Nasre, Meghana
1
2011
Faster algorithms for all-pairs small stretch distances in weighted graphs. Zbl 1239.05178
Kavitha, Telikepalli
1
2012
New algorithms for maximum weight matching and a decomposition theorem. Zbl 1364.05055
Huang, Chien-Chung; Kavitha, Telikepalli
1
2017
Fair matchings and related problems. Zbl 1359.05101
Huang, Chien-Chung; Kavitha, Telikepalli; Mehlhorn, Kurt; Michail, Dimitrios
1
2013
On a special co-cycle basis of graphs. Zbl 1155.05338
Kavitha, Telikepalli
1
2008
Quasi-popular matchings, optimality, and extended formulations. Zbl 1489.05116
Faenza, Yuri; Kavitha, Telikepalli
1
2022
An improved approximation algorithm for the stable marriage problem with one-sided ties. Zbl 1418.90230
Huang, Chien-Chung; Kavitha, Telikepalli
1
2014
Popular matchings in complete graphs. Zbl 1528.68283
Cseh, Ágnes; Kavitha, Telikepalli
1
2018
An improved heuristic for computing short integral cycle bases. Zbl 1284.05294
Kavitha, Telikepalli; Krishna, Katakam Vamsi
1
2009
Popular branchings and their dual certificates. Zbl 1489.90156
Kavitha, Telikepalli; Király, Tamás; Matuschke, Jannik; Schlotter, Ildikó; Schmidt-Kraepelin, Ulrike
5
2022
Understanding popular matchings via stable matchings. Zbl 1483.91135
Cseh, Ágnes; Faenza, Yuri; Kavitha, Telikepalli; Powers, Vladlena
2
2022
Quasi-popular matchings, optimality, and extended formulations. Zbl 1489.05116
Faenza, Yuri; Kavitha, Telikepalli
1
2022
A little charity guarantees almost envy-freeness. Zbl 1525.91102
Chaudhury, Bhaskar Ray; Kavitha, Telikepalli; Mehlhorn, Kurt; Sgouritsa, Alkmini
4
2021
Popularity, mixed matchings, and self-duality. Zbl 1471.90123
Huang, Chien-Chung; Kavitha, Telikepalli
4
2021
Popular matchings in complete graphs. Zbl 1512.05333
Cseh, Ágnes; Kavitha, Telikepalli
2
2021
A little charity guarantees almost envy-freeness. Zbl 07304186
Chaudhury, Bhaskar Ray; Kavitha, Telikepalli; Mehlhorn, Kurt; Sgouritsa, Alkmini
9
2020
Quasi-popular matchings, optimality, and extended formulations. Zbl 07304043
Faenza, Yuri; Kavitha, Telikepalli
7
2020
Popular branchings and their dual certificates. Zbl 1503.90149
Kavitha, Telikepalli; Király, Tamás; Matuschke, Jannik; Schlotter, Ildikó; Schmidt-Kraepelin, Ulrike
2
2020
Popular matchings and limits to tractability. Zbl 1432.68162
Faenza, Yuri; Kavitha, Telikepalli; Powers, Vladlena; Zhang, Xingyu
12
2019
Two problems in max-size popular matchings. Zbl 1426.91170
Brandl, Florian; Kavitha, Telikepalli
4
2019
Popular edges and dominant matchings. Zbl 1398.05162
Cseh, Ágnes; Kavitha, Telikepalli
11
2018
Popular matchings with multiple partners. Zbl 1491.68140
Brandl, Florian; Kavitha, Telikepalli
4
2018
Popular matchings of desired size. Zbl 1519.05204
Kavitha, Telikepalli
3
2018
Distributed construction of purely additive spanners. Zbl 1451.68345
Censor-Hillel, Keren; Kavitha, Telikepalli; Paz, Ami; Yehudayoff, Amir
2
2018
Popular matchings in complete graphs. Zbl 1528.68283
Cseh, Ágnes; Kavitha, Telikepalli
1
2018
Popularity, mixed matchings, and self-duality. Zbl 1410.91354
Huang, Chien-Chung; Kavitha, Telikepalli
9
2017
Popular matchings with two-sided preferences and one-sided ties. Zbl 1372.05168
Cseh, Ágnes; Huang, Chien-Chung; Kavitha, Telikepalli
8
2017
New pairwise spanners. Zbl 1386.05185
Kavitha, Telikepalli
7
2017
New algorithms for maximum weight matching and a decomposition theorem. Zbl 1364.05055
Huang, Chien-Chung; Kavitha, Telikepalli
1
2017
Popular half-integral matchings. Zbl 1388.68233
Kavitha, Telikepalli
11
2016
Popular edges and dominant matchings. Zbl 1418.05107
Cseh, Ágnes; Kavitha, Telikepalli
8
2016
Distributed construction of purely additive spanners. Zbl 1393.68182
Censor-Hillel, Keren; Kavitha, Telikepalli; Paz, Ami; Yehudayoff, Amir
7
2016
Fair matchings and related problems. Zbl 1333.05241
Huang, Chien-Chung; Kavitha, Telikepalli; Mehlhorn, Kurt; Michail, Dimitrios
2
2016
New pairwise spanners. Zbl 1356.05148
Kavitha, Telikepalli
11
2015
Popular matchings with two-sided preferences and one-sided ties. Zbl 1440.05166
Cseh, Ágnes; Huang, Chien-Chung; Kavitha, Telikepalli
9
2015
Small stretch pairwise spanners and approximate \(D\)-preservers. Zbl 1327.05090
Kavitha, Telikepalli; Varma, Nithin M.
6
2015
Maintaining near-popular matchings. Zbl 1440.68181
Bhattacharya, Sayan; Hoefer, Martin; Huang, Chien-Chung; Kavitha, Telikepalli; Wagner, Lisa
4
2015
Improved approximation algorithms for two variants of the stable marriage problem with ties. Zbl 1411.91422
Huang, Chien-Chung; Kavitha, Telikepalli
4
2015
A size-popularity tradeoff in the stable marriage problem. Zbl 1310.68273
Kavitha, Telikepalli
17
2014
Popularity at minimum cost. Zbl 1296.90105
Kavitha, Telikepalli; Nasre, Meghana; Nimbhorkar, Prajakta
3
2014
An improved approximation algorithm for the stable marriage problem with one-sided ties. Zbl 1418.90230
Huang, Chien-Chung; Kavitha, Telikepalli
1
2014
Popular matchings in the stable marriage problem. Zbl 1266.05120
Huang, Chien-Chung; Kavitha, Telikepalli
21
2013
On pairwise spanners. Zbl 1354.05131
Cygan, Marek; Grandoni, Fabrizio; Kavitha, Telikepalli
18
2013
Small stretch pairwise spanners. Zbl 1336.68200
Kavitha, Telikepalli; Varma, Nithin M.
8
2013
Near-popular matchings in the roommates problem. Zbl 1267.68166
Huang, Chien-Chung; Kavitha, Telikepalli
6
2013
Fair matchings and related problems. Zbl 1359.05101
Huang, Chien-Chung; Kavitha, Telikepalli; Mehlhorn, Kurt; Michail, Dimitrios
1
2013
Incremental cycle detection, topological ordering, and strong component maintenance. Zbl 1295.05234
Haeupler, Bernhard; Kavitha, Telikepalli; Mathew, Rogers; Sen, Siddhartha; Tarjan, Robert E.
9
2012
Max-coloring paths: tight bounds and extensions. Zbl 1254.90272
Kavitha, Telikepalli; Mestre, Julián
8
2012
Efficient algorithms for maximum weight matchings in general graphs with small edge weights. Zbl 1423.05172
Huang, Chien-Chung; Kavitha, Telikepalli
5
2012
Popularity vs maximum cardinality in the stable marriage setting. Zbl 1423.05173
Kavitha, Telikepalli
2
2012
Faster algorithms for all-pairs small stretch distances in weighted graphs. Zbl 1239.05178
Kavitha, Telikepalli
1
2012
Popular mixed matchings. Zbl 1220.68073
Kavitha, Telikepalli; Mestre, Julián; Nasre, Meghana
16
2011
Popular matchings in the stable marriage problem. Zbl 1334.05168
Huang, Chien-Chung; Kavitha, Telikepalli
7
2011
Popular matchings with variable item copies. Zbl 1217.68161
Kavitha, Telikepalli; Nasre, Meghana
5
2011
New approximation algorithms for minimum cycle bases of graphs. Zbl 1215.68185
Kavitha, Telikepalli; Mehlhorn, Kurt; Michail, Dimitrios
2
2011
Near-popular matchings in the roommates problem. Zbl 1346.05232
Huang, Chien-Chung; Kavitha, Telikepalli
1
2011
Bounded unpopularity matchings. Zbl 1225.68097
Huang, Chien-Chung; Kavitha, Telikepalli; Michail, Dimitrios; Nasre, Meghana
1
2011
Additive spanners and \(({\alpha}, {\beta})\)-spanners. Zbl 1295.05094
Baswana, Surender; Kavitha, Telikepalli; Mehlhorn, Kurt; Pettie, Seth
32
2010
Assigning papers to referees. Zbl 1203.90092
Garg, Naveen; Kavitha, Telikepalli; Kumar, Amit; Mehlhorn, Kurt; Mestre, Julián
17
2010
Faster algorithms for all-pairs approximate shortest paths in undirected graphs. Zbl 1227.05231
Baswana, Surender; Kavitha, Telikepalli
11
2010
Voting paths. Zbl 1214.68258
Abraham, David J.; Kavitha, Telikepalli
4
2010
Popularity at minimum cost. Zbl 1310.68091
Kavitha, Telikepalli; Nasre, Meghana; Nimbhorkar, Prajakta
2
2010
Cycle bases in graphs characterization, algorithms, complexity, and applications. Zbl 1301.05195
Kavitha, Telikepalli; Liebchen, Christian; Mehlhorn, Kurt; Michail, Dimitrios; Rizzi, Romeo; Ueckerdt, Torsten; Zweig, Katharina A.
39
2009
Optimal popular matchings. Zbl 1213.05212
Kavitha, Telikepalli; Nasre, Meghana
18
2009
Popular mixed matchings. Zbl 1248.68249
Kavitha, Telikepalli; Mestre, Julián; Nasre, Meghana
11
2009
Popular matchings with variable job capacities. Zbl 1273.68149
Kavitha, Telikepalli; Nasre, Meghana
4
2009
Max-coloring paths: tight bounds and extensions. Zbl 1272.68336
Kavitha, Telikepalli; Mestre, Julián
3
2009
An improved heuristic for computing short integral cycle bases. Zbl 1284.05294
Kavitha, Telikepalli; Krishna, Katakam Vamsi
1
2009
Bounded unpopularity matchings. Zbl 1155.91436
Huang, Chien-Chung; Kavitha, Telikepalli; Michail, Dimitrios; Nasre, Meghana
11
2008
An \(\tilde{O}(m^{2}n)\) algorithm for minimum cycle basis of graphs. Zbl 1163.68329
Kavitha, Telikepalli; Mehlhorn, Kurt; Michail, Dimitrios; Paluch, Katarzyna E.
6
2008
Faster algorithms for minimum cycle basis in directed graphs. Zbl 1178.68669
Hariharan, Ramesh; Kavitha, Telikepalli; Mehlhorn, Kurt
4
2008
Faster algorithms for incremental topological ordering. Zbl 1153.05329
Haeupler, Bernhard; Kavitha, Telikepalli; Mathew, Rogers; Sen, Siddhartha; Tarjan, Robert E.
4
2008
Fast edge splitting and edmonds’ arborescence construction for unweighted graphs. Zbl 1192.05152
Bhalgat, Anand; Hariharan, Ramesh; Kavitha, Telikepalli; Panigrahi, Debmalya
2
2008
Dynamic matrix rank with partial lookahead. Zbl 1248.68543
Kavitha, Telikepalli
1
2008
On a special co-cycle basis of graphs. Zbl 1155.05338
Kavitha, Telikepalli
1
2008
Popular matchings. Zbl 1154.91033
Abraham, David J.; Irving, Robert W.; Kavitha, Telikepalli; Mehlhorn, Kurt
52
2007
An \(\widetilde O(mn)\) Gomory-Hu tree construction algorithm for unweighted graphs. Zbl 1231.05247
Hariharan, Ramesh; Kavitha, Telikepalli; Panigrahi, Debmalya; Bhalgat, Anand
13
2007
Linear time algorithms for Abelian group isomorphism and related problems. Zbl 1165.68036
Kavitha, T.
11
2007
New approximation algorithms for minimum cycle bases of graphs. Zbl 1186.68561
Kavitha, Telikepalli; Mehlhorn, Kurt; Michail, Dimitrios
9
2007
Strongly stable matchings in time \(O(nm)\) and extension to the hospitals-residents problem. Zbl 1321.05207
Kavitha, Telikepalli; Mehlhorn, Kurt; Michail, Dimitrios; Paluch, Katarzyna E.
9
2007
Algorithms to compute minimum cycle basis in directed graphs. Zbl 1121.68087
Kavitha, Telikepalli; Mehlhorn, Kurt
8
2007
Faster algorithms for all-pairs small stretch distances in weighted graphs. Zbl 1135.90424
Kavitha, Telikepalli
2
2007
Efficient algorithms for computing all low \(s\)-\(t\) edge connectivities and related problems. Zbl 1302.05188
Hariharan, Ramesh; Kavitha, Telikepalli; Panigrahi, Debmalya
2
2007
Rank-maximal matchings. Zbl 1321.90116
Irving, Robert W.; Kavitha, Telikepalli; Mehlhorn, Kurt; Michail, Dimitrios; Paluch, Katarzyna E.
28
2006
The treewidth and pathwidth of hypercubes. Zbl 1083.05034
Sunil Chandran, L.; Kavitha, T.
21
2006
Efficient algorithms for weighted rank-maximal matchings and related problems. Zbl 1135.05314
Kavitha, Telikepalli; Shah, Chintan D.
8
2006
Dynamic matching markets and voting paths. Zbl 1142.91690
Abraham, David J.; Kavitha, Telikepalli
7
2006
The carvingwidth of hypercubes. Zbl 1102.05047
Chandran, L. Sunil; Kavitha, T.
6
2006
A faster deterministic algorithm for minimum cycle bases in directed graphs. Zbl 1223.05298
Hariharan, Ramesh; Kavitha, Telikepalli; Mehlhorn, Kurt
4
2006
New constructions of \(({\alpha}, {\beta})\)-spanners and purely additive spanners. Zbl 1297.05066
Baswana, Surender; Kavitha, Telikepalli; Mehlhorn, Kurt; Pettie, Seth
14
2005
Popular matchings. Zbl 1297.68087
Abraham, David J.; Irving, Robert W.; Kavitha, Telikepalli; Mehlhorn, Kurt
7
2005
A polynomial time algorithm for minimum cycle basis in directed graphs. Zbl 1118.05314
Kavitha, Telikepalli; Mehlhorn, Kurt
5
2005
Lower bounds for adaptive locally decodable codes. Zbl 1085.94024
Deshpande, Amit; Jain, Rahul; Kavitha, T.; Lokam, Satyanarayana V.; Radhakrishnan, Jaikumar
4
2005
An \(\tilde O( m^{2} n )\) randomized algorithm to compute a minimum cycle basis of a directed graph. Zbl 1082.68084
Kavitha, Telikepalli
3
2005
A faster algorithm for minimum cycle basis of graphs. Zbl 1103.05086
Kavitha, Telikepalli; Mehlhorn, Kurt; Michail, Dimitrios; Paluch, Katarzyna
21
2004
Rank-maximal matchings. Zbl 1318.90060
Irving, Robert W.; Kavitha, Telikepalli; Mehlhorn, Kurt; Michail, Dimitrios; Paluch, Katarzyna
6
2004
Strongly stable matchings in time \(O(nm)\) and extension to the hospitals-residents problem. Zbl 1122.68459
Kavitha, Telikepalli; Mehlhorn, Kurt; Michail, Dimitrios; Paluch, Katarzyna
3
2004
Isoperimetric inequalities and the width parameters of graphs. Zbl 1276.05103
Chandran, L. Sunil; Kavitha, T.; Subramanian, C. R.
2
2003
Efficient algorithms for abelian group isomorphism and related problems. Zbl 1205.68521
Kavitha, T.
2
2003
An algorithm for computing a convex and simple path of bounded curvature in a simple polygon. Zbl 1001.68180
Boissonnat, Jean-Daniel; Ghosh, S. K.; Kavitha, T.; Lazard, Sylvain
2
2002
all top 5

Cited by 596 Authors

36 Kavitha, Telikepalli
11 Huang, Chien-Chung
10 Kamiyama, Naoyuki
10 Nasre, Meghana
9 Cseh, Ágnes
9 Mehlhorn, Kurt
8 Michail, Dimitrios
7 Baswana, Surender
7 Censor-Hillel, Keren
7 Italiano, Giuseppe Francesco
6 Elkin, Michael
6 Liebchen, Christian
6 Rizzi, Romeo
6 Roditty, Liam
5 Bodwin, Greg
5 Király, Tamás
5 Manlove, David F.
5 Nimbhorkar, Prajakta
5 Peleg, David
5 Pettie, Seth
4 Abboud, Amir
4 Aziz, Haris
4 Biró, Peter
4 Darmann, Andreas
4 Irving, Robert W.
4 McDermid, Eric J.
4 Neiman, Ofer
4 Otachi, Yota
4 Sen, Sandeep
4 Vassilevska Williams, Virginia
4 Yamazaki, Koichi
3 Acuña, Vicente
3 Ahmed, Reyan
3 Araújo, Júlio César Silva
3 Ausiello, Giorgio
3 Bernstein, Aaron
3 Bilò, Davide
3 Brandl, Florian
3 Chandran, L. Sunil
3 Das, Bireswar
3 Faenza, Yuri
3 Franciosa, Paolo Giulio
3 Gavoille, Cyril
3 Gualà, Luciano
3 Gupta, Manoj Kumar
3 Hamm, Keaton
3 Itoh, Toshiya
3 Kobourov, Stephen G.
3 Kurapov, S. V.
3 Lam, Kam-Yiu
3 Leucci, Stefano
3 Liberti, Leo
3 Maculan, Nelson F.
3 Miyazaki, Shuichi
3 Paluch, Katarzyna E.
3 Parter, Merav
3 Paz, Ami
3 Proietti, Guido
3 Qiao, Youming
3 Sagot, Marie-France
3 Sau, Ignasi
3 Segal-Halevi, Erel
3 Sharma, Shivdutt
3 Sinaimeri, Blerina
3 Spence, Richard
3 Wu, Xiaowei
3 Zhu, Chun Jiang
2 Amanatidis, Georgios
2 Bampis, Evripidis
2 Baste, Julien
2 Bérczi, Kristóf
2 Berger, Franziska
2 Bharadwaj, B. V. Subramanya
2 Birmpas, Georgios
2 Brandt, Felix
2 Bullo, Francesco
2 Campos, Victor A.
2 Charalampopoulos, Panagiotis
2 Chaudhury, Bhaskar Ray
2 Chechik, Shiri
2 Cheong, Otfried
2 Däubel, Karl
2 Derbel, Bilel
2 Disser, Yann
2 Dory, Michal
2 Dragan, Feodor F.
2 Eppstein, David Arthur
2 Filos-Ratsikas, Aris
2 Filtser, Arnold
2 Garg, Jugal
2 Ghosal, Pratik
2 Gupta, Shiv K.
2 Hamada, Koki
2 Hoefer, Martin
2 Hofmann, Tobias
2 Huang, Shang-En
2 Iommazzo, Gabriele
2 Jankó, Zsuzsanna
2 Jebelli, Mohammad Javad Latifi
2 Karczmarz, Adam
...and 496 more Authors
all top 5

Cited in 78 Serials

33 Theoretical Computer Science
30 Algorithmica
19 Discrete Applied Mathematics
15 SIAM Journal on Computing
13 Information Processing Letters
11 SIAM Journal on Discrete Mathematics
10 Distributed Computing
8 European Journal of Operational Research
8 Theory of Computing Systems
7 Discrete Mathematics
7 Journal of Combinatorial Optimization
5 Artificial Intelligence
4 Journal of Computer and System Sciences
4 Mathematics of Operations Research
4 Mathematical Programming. Series A. Series B
4 Computer Science Review
3 European Journal of Combinatorics
3 Operations Research Letters
3 Computers & Operations Research
3 Linear Algebra and its Applications
3 The Journal of Artificial Intelligence Research (JAIR)
3 Algorithms
3 Prikladnaya Diskretnaya Matematika
2 Physica A
2 Information Sciences
2 Journal of Graph Theory
2 Journal of Mathematical Economics
2 Networks
2 Operations Research
2 Mathematical Social Sciences
2 Annals of Operations Research
2 Random Structures & Algorithms
2 Computational Geometry
2 The Electronic Journal of Combinatorics
2 Mathematical Methods of Operations Research
2 Journal of Graph Algorithms and Applications
2 Journal of Discrete Algorithms
1 ACM Computing Surveys
1 Computer Physics Communications
1 Journal of Statistical Physics
1 Mathematics of Computation
1 Applied Mathematics and Computation
1 International Journal of Game Theory
1 Journal of Combinatorial Theory. Series B
1 Naval Research Logistics
1 SIAM Journal on Control and Optimization
1 Computer Aided Geometric Design
1 Optimization
1 Journal of Computer Science and Technology
1 Information and Computation
1 Journal of Automated Reasoning
1 Applied Mathematics Letters
1 Economics Letters
1 International Journal of Foundations of Computer Science
1 Games and Economic Behavior
1 Automation and Remote Control
1 SIAM Review
1 Computational Complexity
1 SIAM Journal on Scientific Computing
1 International Journal of Computer Vision
1 INFORMS Journal on Computing
1 LMS Journal of Computation and Mathematics
1 CEJOR. Central European Journal of Operations Research
1 Optimization and Engineering
1 Journal of Machine Learning Research (JMLR)
1 Internet Mathematics
1 Mathematical Biosciences and Engineering
1 Oberwolfach Reports
1 Discrete Optimization
1 Optimization Letters
1 Journal of Commutative Algebra
1 Discrete Mathematics, Algorithms and Applications
1 Journal of Computational and Graphical Statistics
1 ACM Transactions on Algorithms
1 Operations Research and Decisions
1 Algebraic Combinatorics
1 SN Operations Research Forum
1 OJMO. Open Journal of Mathematical Optimization

Citations by Year