Huang, Chien-Chung; Kavitha, Telikepalli; Mehlhorn, Kurt; Michail, Dimitrios Fair matchings and related problems. (English) Zbl 1333.05241 Algorithmica 74, No. 3, 1184-1203 (2016). MSC: 05C70 05C85 PDFBibTeX XMLCite \textit{C.-C. Huang} et al., Algorithmica 74, No. 3, 1184--1203 (2016; Zbl 1333.05241) Full Text: DOI Link
Huang, Chien-Chung; Kavitha, Telikepalli; Mehlhorn, Kurt; Michail, Dimitrios Fair matchings and related problems. (English) Zbl 1359.05101 Seth, Anil (ed.) et al., 33nd international conference on foundations of software technology and theoretical computer science, FSTTCS 2013, Guwahati, India, December 12–14, 2013. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-64-4). LIPIcs – Leibniz International Proceedings in Informatics 24, 339-350 (2013). MSC: 05C70 05C85 PDFBibTeX XMLCite \textit{C.-C. Huang} et al., LIPIcs -- Leibniz Int. Proc. Inform. 24, 339--350 (2013; Zbl 1359.05101) Full Text: DOI
Kavitha, Telikepalli; Mehlhorn, Kurt; Michail, Dimitrios New approximation algorithms for minimum cycle bases of graphs. (English) Zbl 1215.68185 Algorithmica 59, No. 4, 471-488 (2011). MSC: 68R10 05C38 05C85 68W25 PDFBibTeX XMLCite \textit{T. Kavitha} et al., Algorithmica 59, No. 4, 471--488 (2011; Zbl 1215.68185) Full Text: DOI Link
Mehlhorn, Kurt; Michail, Dimitrios Minimum cycle bases, faster and simpler. (English) Zbl 1300.05304 ACM Trans. Algorithms 6, No. 1, Article No. 8, 13 p. (2009). MSC: 05C85 05C38 68W25 PDFBibTeX XMLCite \textit{K. Mehlhorn} and \textit{D. Michail}, ACM Trans. Algorithms 6, No. 1, Article No. 8, 13 p. (2009; Zbl 1300.05304) Full Text: DOI
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; 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
Gotsman, Craig; Kaligosi, Kanela; Mehlhorn, Kurt; Michail, Dimitrios; Pyrga, Evangelia Cycle bases of graphs and sampled manifolds. (English) Zbl 1171.65334 Comput. Aided Geom. Des. 24, No. 8-9, 464-480 (2007). MSC: 65D17 68U07 PDFBibTeX XMLCite \textit{C. Gotsman} et al., Comput. Aided Geom. Des. 24, No. 8--9, 464--480 (2007; Zbl 1171.65334) Full Text: DOI Link
Kavitha, Telikepalli; Mehlhorn, Kurt; Michail, Dimitrios New approximation algorithms for minimum cycle bases of graphs. (English) Zbl 1186.68561 Thomas, Wolfgang (ed.) et al., STACS 2007. 24th annual symposium on theoretical aspects of computer science, Aachen, Germany, February 22–24, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-70917-6/pbk). Lecture Notes in Computer Science 4393, 512-523 (2007). MSC: 68W25 05C38 05C85 PDFBibTeX XMLCite \textit{T. Kavitha} et al., Lect. Notes Comput. Sci. 4393, 512--523 (2007; Zbl 1186.68561) Full Text: DOI Link
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
Mehlhorn, Kurt; Michail, Dimitrios Implementing minimum cycle basis algorithms. (English) Zbl 1143.05310 ACM J. Exp. Algorithm. 11, Spec. Iss., Article 2.5, 14 p. (2006). MSC: 05C38 05C85 68Q25 PDFBibTeX XMLCite \textit{K. Mehlhorn} and \textit{D. Michail}, ACM J. Exp. Algorithm. 11, Article 2.5, 14 p. (2006; Zbl 1143.05310)
Mehlhorn, Kurt; Michail, Dimitrios Implementing minimum cycle basis algorithms. (English) Zbl 1121.05314 Nikoletseas, Sotiris E. (ed.), Experimental and efficient algorithms. 4th international workshop, WEA 2005, Santorini Island, Greece, May 10–13, 2005. Proceedings. Berlin Springer (ISBN 3-540-25920-1/pbk). Lecture Notes in Computer Science 3503, 32-43 (2005). MSC: 05C85 05C38 05C80 68Q25 PDFBibTeX XMLCite \textit{K. Mehlhorn} and \textit{D. Michail}, Lect. Notes Comput. Sci. 3503, 32--43 (2005; Zbl 1121.05314) 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