Censor-Hillel, Keren; Kavitha, Telikepalli; Paz, Ami; Yehudayoff, Amir Distributed construction of purely additive spanners. (English) Zbl 1451.68345 Distrib. Comput. 31, No. 3, 223-240 (2018). MSC: 68W15 68Q11 68R10 68W40 PDFBibTeX XMLCite \textit{K. Censor-Hillel} et al., Distrib. Comput. 31, No. 3, 223--240 (2018; Zbl 1451.68345) Full Text: DOI arXiv
Kavitha, Telikepalli New pairwise spanners. (English) Zbl 1386.05185 Theory Comput. Syst. 61, No. 4, 1011-1036 (2017). Reviewer: G. N. Prasanth (Alappuzha) MSC: 05C85 05C12 05C38 68Q25 PDFBibTeX XMLCite \textit{T. Kavitha}, Theory Comput. Syst. 61, No. 4, 1011--1036 (2017; Zbl 1386.05185) Full Text: DOI
Kavitha, Telikepalli; Varma, Nithin M. Small stretch pairwise spanners and approximate \(D\)-preservers. (English) Zbl 1327.05090 SIAM J. Discrete Math. 29, No. 4, 2239-2254 (2015). MSC: 05C12 05C85 68W40 PDFBibTeX XMLCite \textit{T. Kavitha} and \textit{N. M. Varma}, SIAM J. Discrete Math. 29, No. 4, 2239--2254 (2015; Zbl 1327.05090) Full Text: DOI
Kavitha, Telikepalli Faster algorithms for all-pairs small stretch distances in weighted graphs. (English) Zbl 1239.05178 Algorithmica 63, No. 1-2, 224-245 (2012). MSC: 05C85 05C12 05C22 PDFBibTeX XMLCite \textit{T. Kavitha}, Algorithmica 63, No. 1--2, 224--245 (2012; Zbl 1239.05178) Full Text: DOI Link
Kavitha, Telikepalli; Liebchen, Christian; Mehlhorn, Kurt; Michail, Dimitrios; Rizzi, Romeo; Ueckerdt, Torsten; Zweig, Katharina A. Cycle bases in graphs characterization, algorithms, complexity, and applications. (English) Zbl 1301.05195 Comput. Sci. Rev. 3, No. 4, 199-243 (2009). MSC: 05C38 05C10 05C85 68R10 68W25 68Q25 05C90 05-02 PDFBibTeX XMLCite \textit{T. Kavitha} et al., Comput. Sci. Rev. 3, No. 4, 199--243 (2009; Zbl 1301.05195) Full Text: DOI Link
Kavitha, Telikepalli; Mehlhorn, Kurt; Michail, Dimitrios; Paluch, Katarzyna E. An \(\tilde{O}(m^{2}n)\) algorithm for minimum cycle basis of graphs. (English) Zbl 1163.68329 Algorithmica 52, No. 3, 333-349 (2008). MSC: 68R10 PDFBibTeX XMLCite \textit{T. Kavitha} et al., Algorithmica 52, No. 3, 333--349 (2008; Zbl 1163.68329) Full Text: DOI
Kavitha, Telikepalli Faster algorithms for all-pairs small stretch distances in weighted graphs. (English) Zbl 1135.90424 Arvind, V. (ed.) et al., FSTTCS 2007: Foundations of software technology and theoretical computer science. 27th international conference, New Delhi, India, December 12–14, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-77049-7/pbk). Lecture Notes in Computer Science 4855, 328-339 (2007). MSC: 90C35 68Q25 05C85 PDFBibTeX XMLCite \textit{T. Kavitha}, Lect. Notes Comput. Sci. 4855, 328--339 (2007; Zbl 1135.90424) Full Text: DOI Link