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; Mehlhorn, Kurt; Michail, Dimitrios; Paluch, Katarzyna E. Strongly stable matchings in time \(O(nm)\) and extension to the hospitals-residents problem. (English) Zbl 1321.05207 ACM Trans. Algorithms 3, No. 2, Article No. 15, 18 p. (2007). MSC: 05C70 05C85 68Q25 91B68 PDFBibTeX XMLCite \textit{T. Kavitha} et al., ACM Trans. Algorithms 3, No. 2, Article No. 15, 18 p. (2007; Zbl 1321.05207) Full Text: DOI
Irving, Robert W.; Kavitha, Telikepalli; Mehlhorn, Kurt; Michail, Dimitrios; Paluch, Katarzyna E. Rank-maximal matchings. (English) Zbl 1321.90116 ACM Trans. Algorithms 2, No. 4, 602-610 (2006). MSC: 90C27 05C70 05C85 68Q25 PDFBibTeX XMLCite \textit{R. W. Irving} et al., ACM Trans. Algorithms 2, No. 4, 602--610 (2006; Zbl 1321.90116) Full Text: DOI
Irving, Robert W.; Kavitha, Telikepalli; Mehlhorn, Kurt; Michail, Dimitrios; Paluch, Katarzyna Rank-maximal matchings. (English) Zbl 1318.90060 Proceedings of the fifteenth annual ACM-SIAM symposium on discrete algorithms, SODA 2004, New Orleans, LA, USA, January 11–13, 2004. New York, NY: Association for Computing Machinery (ACM); Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM) (ISBN 0-89871-558-X). 68-75 (2004). MSC: 90C27 05C70 05C85 68Q25 68R10 PDFBibTeX XMLCite \textit{R. W. Irving} et al., in: Proceedings of the fifteenth annual ACM-SIAM symposium on discrete algorithms, SODA 2004, New Orleans, LA, USA, January 11--13, 2004. New York, NY: Association for Computing Machinery (ACM); Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM). 68--75 (2004; Zbl 1318.90060)
Kavitha, Telikepalli; Mehlhorn, Kurt; Michail, Dimitrios; Paluch, Katarzyna Strongly stable matchings in time \(O(nm)\) and extension to the hospitals-residents problem. (English) Zbl 1122.68459 Diekert, Volker (ed.) et al., STACS 2004. 21st annual symposium on theoretical aspects of computer science, Montpellier, France, March 25–27, 2004. Proceedings. Berlin: Springer (ISBN 3-540-21236-1/pbk). Lecture Notes in Computer Science 2996, 222-233 (2004). MSC: 68Q25 05C70 91B68 PDFBibTeX XMLCite \textit{T. Kavitha} et al., Lect. Notes Comput. Sci. 2996, 222--233 (2004; Zbl 1122.68459) Full Text: DOI
Kavitha, Telikepalli; Mehlhorn, Kurt; Michail, Dimitrios; Paluch, Katarzyna A faster algorithm for minimum cycle basis of graphs. (English) Zbl 1103.05086 Díaz, Josep (ed.) et al., Automata, languages and programming. 31st international colloquium, ICALP 2004, Turku, Finland, July 12–16, 2004. Proceedings. Berlin: Springer (ISBN 3-540-22849-7/pbk). Lecture Notes in Computer Science 3142, 846-857 (2004). MSC: 05C85 05C38 68R10 68W40 PDFBibTeX XMLCite \textit{T. Kavitha} et al., Lect. Notes Comput. Sci. 3142, 846--857 (2004; Zbl 1103.05086) Full Text: DOI