default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTelikepalli Kavitha
Person information
- affiliation: Tata Institute of Fundamental Research, Mumbai, India
- affiliation: ERNET, India
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j50]Telikepalli Kavitha
:
Stable Matchings, One-Sided Ties, and Approximate Popularity. Algorithmica 86(6): 1888-1920 (2024)- [j49]Telikepalli Kavitha:
Maximum Matchings and Popularity. SIAM J. Discret. Math. 38(2): 1202-1221 (2024) - [j48]Telikepalli Kavitha:
Popular Matchings with One-Sided Bias. ACM Trans. Algorithms 20(1): 8:1-8:22 (2024) - [j47]Kristóf Bérczi, Erika R. Bérczi-Kovács, Endre Boros, Fekadu Tolessa Gedefa, Naoyuki Kamiyama, Telikepalli Kavitha, Yusuke Kobayashi, Kazuhisa Makino:
Envy-free relaxations for goods, chores, and mixed items. Theor. Comput. Sci. 1002: 114596 (2024) - [c62]Telikepalli Kavitha, Kazuhisa Makino, Ildikó Schlotter, Yu Yokoi:
Arborescences, Colorful Forests, and Popularity. SODA 2024: 3724-3746 - 2023
- [c61]Telikepalli Kavitha, Rohit Vaish:
Semi-Popular Matchings and Copeland Winners. AAMAS 2023: 957-965 - [c60]Telikepalli Kavitha, Kazuhisa Makino:
Perfect Matchings and Popularity in the Many-To-Many Setting. FSTTCS 2023: 43:1-43:16 - [e2]Telikepalli Kavitha, Kurt Mehlhorn:
2023 Symposium on Simplicity in Algorithms, SOSA 2023, Florence, Italy, January 23-25, 2023. SIAM 2023, ISBN 978-1-61197-758-5 [contents] - [i22]Telikepalli Kavitha, Kazuhisa Makino, Ildikó Schlotter, Yu Yokoi:
Arborescences, Colorful Forests, and Popularity. CoRR abs/2310.19455 (2023) - 2022
- [j46]Yuri Faenza, Telikepalli Kavitha:
Quasi-Popular Matchings, Optimality, and Extended Formulations. Math. Oper. Res. 47(1): 427-457 (2022) - [j45]Telikepalli Kavitha, Tamás Király, Jannik Matuschke, Ildikó Schlotter, Ulrike Schmidt-Kraepelin:
Popular branchings and their dual certificates. Math. Program. 192(1): 567-595 (2022) - [j44]Ágnes Cseh, Yuri Faenza, Telikepalli Kavitha, Vladlena Powers:
Understanding Popular Matchings via Stable Matchings. SIAM J. Discret. Math. 36(1): 188-213 (2022) - [c59]Telikepalli Kavitha:
Stable Matchings with One-Sided Ties and Approximate Popularity. FSTTCS 2022: 22:1-22:17 - [c58]Telikepalli Kavitha, Tamás Király, Jannik Matuschke, Ildikó Schlotter, Ulrike Schmidt-Kraepelin:
The popular assignment problem: when cardinality is more important than popularity. SODA 2022: 103-123 - [c57]Telikepalli Kavitha:
Fairly Popular Matchings and Optimality. STACS 2022: 41:1-41:22 - [i21]Telikepalli Kavitha:
Popular Matchings with One-Sided Bias. CoRR abs/2207.05488 (2022) - 2021
- [j43]Ágnes Cseh, Telikepalli Kavitha:
Popular Matchings in Complete Graphs. Algorithmica 83(5): 1493-1523 (2021) - [j42]Chien-Chung Huang, Telikepalli Kavitha:
Popularity, Mixed Matchings, and Self-Duality. Math. Oper. Res. 46(2): 405-427 (2021) - [j41]Bhaskar Ray Chaudhury, Telikepalli Kavitha, Kurt Mehlhorn, Alkmini Sgouritsa:
A Little Charity Guarantees Almost Envy-Freeness. SIAM J. Comput. 50(4): 1336-1358 (2021) - [c56]Telikepalli Kavitha:
Matchings, Critical Nodes, and Popular Solutions. FSTTCS 2021: 25:1-25:19 - [c55]Telikepalli Kavitha:
Maximum Matchings and Popularity. ICALP 2021: 85:1-85:21 - [i20]Telikepalli Kavitha, Rohit Vaish:
Matchings and Copeland's Method. CoRR abs/2105.13729 (2021) - [i19]Telikepalli Kavitha, Tamás Király, Jannik Matuschke, Ildikó Schlotter, Ulrike Schmidt-Kraepelin:
The popular assignment problem: when cardinality is more important than popularity. CoRR abs/2110.10984 (2021) - 2020
- [c54]Telikepalli Kavitha:
Min-Cost Popular Matchings. FSTTCS 2020: 25:1-25:17 - [c53]Telikepalli Kavitha:
Popular Matchings with One-Sided Bias. ICALP 2020: 70:1-70:18 - [c52]Telikepalli Kavitha, Tamás Király, Jannik Matuschke, Ildikó Schlotter, Ulrike Schmidt-Kraepelin:
Popular Branchings and Their Dual Certificates. IPCO 2020: 223-237 - [c51]Yuri Faenza, Telikepalli Kavitha:
Quasi-popular Matchings, Optimality, and Extended Formulations. SODA 2020: 325-344 - [c50]Bhaskar Ray Chaudhury, Telikepalli Kavitha, Kurt Mehlhorn, Alkmini Sgouritsa:
A Little Charity Guarantees Almost Envy-Freeness. SODA 2020: 2658-2672 - [i18]Kristóf Bérczi, Erika R. Bérczi-Kovács, Endre Boros, Fekadu Tolessa Gedefa, Naoyuki Kamiyama, Telikepalli Kavitha, Yusuke Kobayashi, Kazuhisa Makino:
Envy-free Relaxations for Goods, Chores, and Mixed Items. CoRR abs/2006.04428 (2020) - [i17]Telikepalli Kavitha:
Maximum Matchings and Popularity. CoRR abs/2011.03434 (2020)
2010 – 2019
- 2019
- [j40]Florian Brandl, Telikepalli Kavitha:
Two Problems in Max-Size Popular Matchings. Algorithmica 81(7): 2738-2764 (2019) - [c49]Telikepalli Kavitha:
Popular Roommates in Simply Exponential Time. FSTTCS 2019: 20:1-20:15 - [c48]Telikepalli Kavitha:
Popular Matchings: Good, Bad, and Mixed (Invited Talk). MFCS 2019: 4:1-4:1 - [c47]Yuri Faenza, Telikepalli Kavitha, Vladlena Powers, Xingyu Zhang:
Popular Matchings and Limits to Tractability. SODA 2019: 2790-2809 - [i16]Yuri Faenza, Telikepalli Kavitha:
Quasi-popular Matchings, Optimality, and Extended Formulations. CoRR abs/1904.05974 (2019) - [i15]Bhaskar Ray Chaudhury, Telikepalli Kavitha, Kurt Mehlhorn, Alkmini Sgouritsa:
A Little Charity Guarantees Almost Envy-Freeness. CoRR abs/1907.04596 (2019) - [i14]Telikepalli Kavitha, Tamás Király, Jannik Matuschke, Ildikó Schlotter, Ulrike Schmidt-Kraepelin:
Popular Branchings and Their Dual Certificates. CoRR abs/1912.01854 (2019) - 2018
- [j39]Keren Censor-Hillel, Telikepalli Kavitha, Ami Paz, Amir Yehudayoff:
Distributed construction of purely additive spanners. Distributed Comput. 31(3): 223-240 (2018) - [j38]Ágnes Cseh, Telikepalli Kavitha:
Popular edges and dominant matchings. Math. Program. 172(1-2): 209-229 (2018) - [c46]Ágnes Cseh, Telikepalli Kavitha:
Popular Matchings in Complete Graphs. FSTTCS 2018: 17:1-17:14 - [c45]Telikepalli Kavitha:
Popular Matchings of Desired Size. WG 2018: 306-317 - [i13]Telikepalli Kavitha:
Max-size popular matchings and extensions. CoRR abs/1802.07440 (2018) - [i12]Telikepalli Kavitha:
The Popular Roommates problem. CoRR abs/1804.00141 (2018) - [i11]Yuri Faenza, Telikepalli Kavitha, Vladlena Powers, Xingyu Zhang:
Popular Matchings and Limits to Tractability. CoRR abs/1805.11473 (2018) - [i10]Ágnes Cseh, Telikepalli Kavitha:
Popular Matchings in Complete Graphs. CoRR abs/1807.01112 (2018) - [i9]Ágnes Cseh, Yuri Faenza, Telikepalli Kavitha, Vladlena Powers:
Popularity, stability, and the dominant matching polytope. CoRR abs/1811.06897 (2018) - 2017
- [j37]Chien-Chung Huang, Telikepalli Kavitha:
New Algorithms for Maximum Weight Matching and a Decomposition Theorem. Math. Oper. Res. 42(2): 411-426 (2017) - [j36]Telikepalli Kavitha:
New Pairwise Spanners. Theory Comput. Syst. 61(4): 1011-1036 (2017) - [j35]Ágnes Cseh, Chien-Chung Huang, Telikepalli Kavitha:
Popular Matchings with Two-Sided Preferences and One-Sided Ties. SIAM J. Discret. Math. 31(4): 2348-2377 (2017) - [c44]Florian Brandl, Telikepalli Kavitha:
Popular Matchings with Multiple Partners. FSTTCS 2017: 19:1-19:15 - [c43]Chien-Chung Huang, Telikepalli Kavitha:
Popularity, Mixed Matchings, and Self-duality. SODA 2017: 2294-2310 - 2016
- [j34]Chien-Chung Huang, Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail:
Fair Matchings and Related Problems. Algorithmica 74(3): 1184-1203 (2016) - [c42]Telikepalli Kavitha:
Popular Half-Integral Matchings. ICALP 2016: 22:1-22:13 - [c41]Ágnes Cseh, Telikepalli Kavitha:
Popular Edges and Dominant Matchings. IPCO 2016: 138-151 - [c40]Keren Censor-Hillel, Telikepalli Kavitha, Ami Paz, Amir Yehudayoff:
Distributed Construction of Purely Additive Spanners. DISC 2016: 129-142 - [r2]Telikepalli Kavitha:
Ranked Matching. Encyclopedia of Algorithms 2016: 1780-1784 - [i8]Ágnes Cseh, Chien-Chung Huang, Telikepalli Kavitha:
Popular matchings with two-sided preferences and one-sided ties. CoRR abs/1603.07168 (2016) - [i7]Keren Censor-Hillel, Telikepalli Kavitha, Ami Paz, Amir Yehudayoff:
Distributed Construction of Purely Additive Spanners. CoRR abs/1607.05597 (2016) - [i6]Florian Brandl, Telikepalli Kavitha:
Popular Matchings with Multiple Partners. CoRR abs/1609.07531 (2016) - 2015
- [j33]Chien-Chung Huang, Telikepalli Kavitha:
Improved approximation algorithms for two variants of the stable marriage problem with ties. Math. Program. 154(1-2): 353-380 (2015) - [j32]Telikepalli Kavitha, Nithin M. Varma:
Small Stretch Pairwise Spanners and Approximate D-Preservers. SIAM J. Discret. Math. 29(4): 2239-2254 (2015) - [c39]Ágnes Cseh, Chien-Chung Huang, Telikepalli Kavitha:
Popular Matchings with Two-Sided Preferences and One-Sided Ties. ICALP (1) 2015: 367-379 - [c38]Sayan Bhattacharya, Martin Hoefer, Chien-Chung Huang, Telikepalli Kavitha, Lisa Wagner:
Maintaining Near-Popular Matchings. ICALP (2) 2015: 504-515 - [c37]Telikepalli Kavitha:
New Pairwise Spanners. STACS 2015: 513-526 - [i5]Ágnes Cseh, Telikepalli Kavitha:
Popular Edges and Dominant Matchings. CoRR abs/1508.00614 (2015) - 2014
- [j31]Telikepalli Kavitha, Meghana Nasre, Prajakta Nimbhorkar:
Popularity at minimum cost. J. Comb. Optim. 27(3): 574-596 (2014) - [j30]Telikepalli Kavitha:
Dynamic Matrix Rank with Partial Lookahead. Theory Comput. Syst. 55(1): 229-249 (2014) - [j29]Telikepalli Kavitha:
A Size-Popularity Tradeoff in the Stable Marriage Problem. SIAM J. Comput. 43(1): 52-71 (2014) - [c36]Chien-Chung Huang, Telikepalli Kavitha:
An Improved Approximation Algorithm for the Stable Marriage Problem with One-Sided Ties. IPCO 2014: 297-308 - 2013
- [j28]Chien-Chung Huang, Telikepalli Kavitha:
Popular matchings in the stable marriage problem. Inf. Comput. 222: 180-194 (2013) - [j27]Chien-Chung Huang, Telikepalli Kavitha:
Near-Popular Matchings in the Roommates Problem. SIAM J. Discret. Math. 27(1): 43-62 (2013) - [c35]Chien-Chung Huang, Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail:
Fair Matchings and Related Problems. FSTTCS 2013: 339-350 - [c34]Telikepalli Kavitha, Nithin M. Varma:
Small Stretch Pairwise Spanners. ICALP (1) 2013: 601-612 - [c33]Marek Cygan, Fabrizio Grandoni, Telikepalli Kavitha:
On Pairwise Spanners. STACS 2013: 209-220 - [i4]Marek Cygan, Fabrizio Grandoni, Telikepalli Kavitha:
On Pairwise Spanners. CoRR abs/1301.1999 (2013) - 2012
- [j26]Telikepalli Kavitha:
Faster Algorithms for All-Pairs Small Stretch Distances in Weighted Graphs. Algorithmica 63(1-2): 224-245 (2012) - [j25]Telikepalli Kavitha, Julián Mestre:
Max-coloring paths: tight bounds and extensions. J. Comb. Optim. 24(1): 1-14 (2012) - [j24]Bernhard Haeupler, Telikepalli Kavitha, Rogers Mathew, Siddhartha Sen, Robert Endre Tarjan:
Incremental Cycle Detection, Topological Ordering, and Strong Component Maintenance. ACM Trans. Algorithms 8(1): 3:1-3:33 (2012) - [j23]Telikepalli Kavitha:
Properties of Gomory-Hu co-cycle bases. Theor. Comput. Sci. 420: 48-55 (2012) - [c32]Telikepalli Kavitha:
Popularity vs maximum cardinality in the stable marriage setting. SODA 2012: 123-134 - [c31]Chien-Chung Huang, Telikepalli Kavitha:
Efficient algorithms for maximum weight matchings in general graphs with small edge weights. SODA 2012: 1400-1412 - [e1]Deepak D'Souza, Telikepalli Kavitha, Jaikumar Radhakrishnan:
IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2012, December 15-17, 2012, Hyderabad, India. LIPIcs 18, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2012, ISBN 978-3-939897-47-7 [contents] - 2011
- [j22]Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail:
New Approximation Algorithms for Minimum Cycle Bases of Graphs. Algorithmica 59(4): 471-488 (2011) - [j21]Chien-Chung Huang, Telikepalli Kavitha, Dimitrios Michail, Meghana Nasre:
Bounded Unpopularity Matchings. Algorithmica 61(3): 738-757 (2011) - [j20]Telikepalli Kavitha, Meghana Nasre:
Popular matchings with variable item copies. Theor. Comput. Sci. 412(12-14): 1263-1274 (2011) - [j19]Telikepalli Kavitha, Julián Mestre, Meghana Nasre:
Popular mixed matchings. Theor. Comput. Sci. 412(24): 2679-2690 (2011) - [c30]Chien-Chung Huang, Telikepalli Kavitha:
Near-Popular Matchings in the Roommates Problem. ESA 2011: 167-179 - [c29]Chien-Chung Huang, Telikepalli Kavitha:
Popular Matchings in the Stable Marriage Problem. ICALP (1) 2011: 666-677 - [i3]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) - 2010
- [j18]Naveen Garg, Telikepalli Kavitha, Amit Kumar, Kurt Mehlhorn, Julián Mestre:
Assigning Papers to Referees. Algorithmica 58(1): 119-136 (2010) - [j17]Surender Baswana, Telikepalli Kavitha:
Faster Algorithms for All-pairs Approximate Shortest Paths in Undirected Graphs. SIAM J. Comput. 39(7): 2865-2896 (2010) - [j16]David J. Abraham, Telikepalli Kavitha:
Voting Paths. SIAM J. Discret. Math. 24(2): 520-537 (2010) - [j15]Surender Baswana, Telikepalli Kavitha, Kurt Mehlhorn, Seth Pettie:
Additive spanners and (alpha, beta)-spanners. ACM Trans. Algorithms 7(1): 5:1-5:26 (2010) - [c28]Telikepalli Kavitha, Meghana Nasre, Prajakta Nimbhorkar:
Popularity at Minimum Cost. ISAAC (1) 2010: 145-156 - [i2]Telikepalli Kavitha, Meghana Nasre, Prajakta Nimbhorkar:
Popularity at Minimum Cost. CoRR abs/1009.2591 (2010)
2000 – 2009
- 2009
- [j14]Telikepalli Kavitha, Christian Liebchen, Kurt Mehlhorn, Dimitrios Michail, Romeo Rizzi, Torsten Ueckerdt, Katharina Anna Zweig:
Cycle bases in graphs characterization, algorithms, complexity, and applications. Comput. Sci. Rev. 3(4): 199-243 (2009) - [j13]Telikepalli Kavitha, Meghana Nasre:
Optimal popular matchings. Discret. Appl. Math. 157(14): 3181-3186 (2009) - [c27]Telikepalli Kavitha, Julián Mestre, Meghana Nasre:
Popular Mixed Matchings. ICALP (1) 2009: 574-584 - [c26]Telikepalli Kavitha, Julián Mestre:
Max-Coloring Paths: Tight Bounds and Extensions. ISAAC 2009: 87-96 - [c25]Telikepalli Kavitha, Meghana Nasre:
Popular Matchings with Variable Job Capacities. ISAAC 2009: 423-433 - 2008
- [j12]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) - [j11]Telikepalli Kavitha, Katakam Vamsi Krishna:
An improved heuristic for computing short integral cycle bases. ACM J. Exp. Algorithmics 13 (2008) - [j10]Ramesh Hariharan, Telikepalli Kavitha, Kurt Mehlhorn:
Faster Algorithms for Minimum Cycle Basis in Directed Graphs. SIAM J. Comput. 38(4): 1430-1447 (2008) - [c24]Telikepalli Kavitha:
Dynamic matrix rank with partial lookahead. FSTTCS 2008: 268-279 - [c23]Bernhard Haeupler, Telikepalli Kavitha, Rogers Mathew, Siddhartha Sen, Robert Endre Tarjan:
Faster Algorithms for Incremental Topological Ordering. ICALP (1) 2008: 421-433 - [c22]Anand Bhalgat, Ramesh Hariharan, Telikepalli Kavitha, Debmalya Panigrahi:
Fast edge splitting and Edmonds' arborescence construction for unweighted graphs. SODA 2008: 455-464 - [c21]Chien-Chung Huang, Telikepalli Kavitha, Dimitrios Michail, Meghana Nasre:
Bounded Unpopularity Matchings. SWAT 2008: 127-137 - [c20]Telikepalli Kavitha:
On a Special Co-cycle Basis of Graphs. SWAT 2008: 343-354 - [r1]Telikepalli Kavitha:
Ranked Matching. Encyclopedia of Algorithms 2008 - 2007
- [j9]Telikepalli Kavitha:
Linear time algorithms for Abelian group isomorphism and related problems. J. Comput. Syst. Sci. 73(6): 986-996 (2007) - [j8]Telikepalli Kavitha, Kurt Mehlhorn:
Algorithms to Compute Minimum Cycle Basis in Directed Graphs. Theory Comput. Syst. 40(4): 485-505 (2007) - [j7]David J. Abraham, Robert W. Irving, Telikepalli Kavitha, Kurt Mehlhorn:
Popular Matchings. SIAM J. Comput. 37(4): 1030-1045 (2007) - [j6]Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail, Katarzyna E. Paluch:
Strongly stable matchings in time O(nm) and extension to the hospitals-residents problem. ACM Trans. Algorithms 3(2): 15 (2007) - [c19]Telikepalli Kavitha:
Faster Algorithms for All-Pairs Small Stretch Distances in Weighted Graphs. FSTTCS 2007: 328-339 - [c18]Ramesh Hariharan, Telikepalli Kavitha, Debmalya Panigrahi:
Efficient algorithms for computing all low s-t edge connectivities and related problems. SODA 2007: 127-136 - [c17]Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail:
New Approximation Algorithms for Minimum Cycle Bases of Graphs. STACS 2007: 512-523 - [c16]Ramesh Hariharan, Telikepalli Kavitha, Debmalya Panigrahi, Anand Bhalgat:
An Õ(mn) Gomory-Hu tree construction algorithm for unweighted graphs. STOC 2007: 605-614 - [i1]Telikepalli Kavitha, Rogers Mathew:
Faster Algorithms for Online Topological Ordering. CoRR abs/0711.0251 (2007) - 2006
- [j5]L. Sunil Chandran, Telikepalli Kavitha:
The treewidth and pathwidth of hypercubes. Discret. Math. 306(3): 359-365 (2006) - [j4]L. Sunil Chandran, Telikepalli Kavitha:
The carvingwidth of hypercubes. Discret. Math. 306(18): 2270-2274 (2006) - [j3]Robert W. Irving, Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail, Katarzyna E. Paluch:
Rank-maximal matchings. ACM Trans. Algorithms 2(4): 602-610 (2006) - [c15]Surender Baswana, Telikepalli Kavitha:
Faster Algorithms for Approximate Distance Oracles and All-Pairs Small Stretch Paths. FOCS 2006: 591-602 - [c14]Ramesh Hariharan, Telikepalli Kavitha, Kurt Mehlhorn:
A Faster Deterministic Algorithm for Minimum Cycle Bases in Directed Graphs. ICALP (1) 2006: 250-261 - [c13]Telikepalli Kavitha, Chintan D. Shah:
Efficient Algorithms for Weighted Rank-Maximal Matchings and Related Problems. ISAAC 2006: 153-162 - [c12]David J. Abraham, Telikepalli Kavitha:
Dynamic Matching Markets and Voting Paths. SWAT 2006: 65-76 - 2005
- [j2]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) - [c11]Telikepalli Kavitha:
An Õ(m2n) Randomized Algorithm to Compute a Minimum Cycle Basis of a Directed Graph. ICALP 2005: 273-284 - [c10]David J. Abraham, Robert W. Irving, Telikepalli Kavitha, Kurt Mehlhorn:
Popular matchings. SODA 2005: 424-432 - [c9]Surender Baswana, Telikepalli Kavitha, Kurt Mehlhorn, Seth Pettie:
New constructions of (alpha, beta)-spanners and purely additive spanners. SODA 2005: 672-681 - [c8]Telikepalli Kavitha, Kurt Mehlhorn:
A Polynomial Time Algorithm for Minimum Cycle Basis in Directed Graphs. STACS 2005: 654-665 - 2004
- [c7]Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail, Katarzyna E. Paluch:
A Faster Algorithm for Minimum Cycle Basis of Graphs. ICALP 2004: 846-857 - [c6]Robert W. Irving, Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail, Katarzyna E. Paluch:
Rank-maximal matchings. SODA 2004: 68-75 - [c5]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
- [c4]Telikepalli Kavitha, Kasturi R. Varadarajan:
On shortest paths in line arrangements. CCCG 2003: 170-173 - [c3]L. Sunil Chandran, Telikepalli Kavitha, C. R. Subramanian:
Isoperimetric Inequalities and the Width Parameters of Graphs. COCOON 2003: 385-393 - [c2]Telikepalli Kavitha:
Efficient Algorithms for Abelian Group Isomorphism and Related Problems. FSTTCS 2003: 277-288 - 2002
- [j1]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) - [c1]Amit Deshpande, Rahul Jain, Telikepalli Kavitha, Jaikumar Radhakrishnan, Satyanarayana V. Lokam:
Better Lower Bounds for Locally Decodable Codes. CCC 2002: 184-193
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:10 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
