Kavitha, Telikepalli (ed.); Mehlhorn, Kurt (ed.) 6th SIAM symposium on simplicity in algorithms, SOSA 2023, co-located with SODA 2023, Florence, Italy, January 23–25, 2023. (English) Zbl 1508.68018 Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM) (ISBN 978-1-61197-758-5/ebook). vi, 389 p. (2023). MSC: 68-06 68Wxx 00B25 PDFBibTeX XMLCite \textit{T. Kavitha} (ed.) and \textit{K. Mehlhorn} (ed.), 6th SIAM symposium on simplicity in algorithms, SOSA 2023, co-located with SODA 2023, Florence, Italy, January 23--25, 2023. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM) (2023; Zbl 1508.68018) Full Text: DOI
Chaudhury, Bhaskar Ray; Kavitha, Telikepalli; Mehlhorn, Kurt; Sgouritsa, Alkmini A little charity guarantees almost envy-freeness. (English) Zbl 1525.91102 SIAM J. Comput. 50, No. 4, 1336-1358 (2021). MSC: 91B32 PDFBibTeX XMLCite \textit{B. R. Chaudhury} et al., SIAM J. Comput. 50, No. 4, 1336--1358 (2021; Zbl 1525.91102) Full Text: DOI arXiv
Chaudhury, Bhaskar Ray; Kavitha, Telikepalli; Mehlhorn, Kurt; Sgouritsa, Alkmini A little charity guarantees almost envy-freeness. (English) Zbl 07304186 Chawla, Shuchi (ed.), Proceedings of the 31st annual ACM-SIAM symposium on discrete algorithms, SODA 2020, Salt Lake City, UT, USA, January 5–8, 2020. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 2658-2672 (2020). MSC: 91B32 PDFBibTeX XMLCite \textit{B. R. Chaudhury} et al., in: Proceedings of the 31st annual ACM-SIAM symposium on discrete algorithms, SODA 2020, Salt Lake City, UT, USA, January 5--8, 2020. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 2658--2672 (2020; Zbl 07304186) Full Text: DOI
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
Baswana, Surender; Kavitha, Telikepalli; Mehlhorn, Kurt; Pettie, Seth Additive spanners and \(({\alpha}, {\beta})\)-spanners. (English) Zbl 1295.05094 ACM Trans. Algorithms 7, No. 1, Article No. 5, 26 p. (2010). MSC: 05C12 05C85 68Q25 PDFBibTeX XMLCite \textit{S. Baswana} et al., ACM Trans. Algorithms 7, No. 1, Article No. 5, 26 p. (2010; Zbl 1295.05094) Full Text: DOI
Garg, Naveen; Kavitha, Telikepalli; Kumar, Amit; Mehlhorn, Kurt; Mestre, Julián Assigning papers to referees. (English) Zbl 1203.90092 Algorithmica 58, No. 1, 119-136 (2010). MSC: 90B80 90C47 68Q25 PDFBibTeX XMLCite \textit{N. Garg} et al., Algorithmica 58, No. 1, 119--136 (2010; Zbl 1203.90092) 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
Hariharan, Ramesh; Kavitha, Telikepalli; Mehlhorn, Kurt Faster algorithms for minimum cycle basis in directed graphs. (English) Zbl 1178.68669 SIAM J. Comput. 38, No. 4, 1430-1447 (2008). MSC: 68W20 05C20 68W40 PDFBibTeX XMLCite \textit{R. Hariharan} et al., SIAM J. Comput. 38, No. 4, 1430--1447 (2008; Zbl 1178.68669) 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
Abraham, David J.; Irving, Robert W.; Kavitha, Telikepalli; Mehlhorn, Kurt Popular matchings. (English) Zbl 1154.91033 SIAM J. Comput. 37, No. 4, 1030-1045 (2007). MSC: 91B68 05C70 68Q25 PDFBibTeX XMLCite \textit{D. J. Abraham} et al., SIAM J. Comput. 37, No. 4, 1030--1045 (2007; Zbl 1154.91033) Full Text: DOI
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
Kavitha, Telikepalli; Mehlhorn, Kurt Algorithms to compute minimum cycle basis in directed graphs. (English) Zbl 1121.68087 Theory Comput. Syst. 40, No. 4, 485-505 (2007). MSC: 68R10 05C85 PDFBibTeX XMLCite \textit{T. Kavitha} and \textit{K. Mehlhorn}, Theory Comput. Syst. 40, No. 4, 485--505 (2007; Zbl 1121.68087) 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
Hariharan, Ramesh; Kavitha, Telikepalli; Mehlhorn, Kurt A faster deterministic algorithm for minimum cycle bases in directed graphs. (English) Zbl 1223.05298 Bugliesi, Michele (ed.) et al., Automata, languages and programming. 33rd international colloquium, ICALP 2006, Venice, Italy, July 10–14, 2006. Proceedings, Part I. Berlin: Springer (ISBN 978-3-540-35904-3/pbk). Lecture Notes in Computer Science 4051, 250-261 (2006). MSC: 05C85 05C20 05C38 68W05 68W20 PDFBibTeX XMLCite \textit{R. Hariharan} et al., Lect. Notes Comput. Sci. 4051, 250--261 (2006; Zbl 1223.05298) Full Text: DOI
Baswana, Surender; Kavitha, Telikepalli; Mehlhorn, Kurt; Pettie, Seth New constructions of \(({\alpha}, {\beta})\)-spanners and purely additive spanners. (English) Zbl 1297.05066 Proceedings of the sixteenth annual ACM-SIAM symposium on discrete algorithms, SODA 2005, Vancouver, BC, Canada, January 23–25, 2005. New York, NY: ACM Press (ISBN 0-89871-585-7). 672-681 (2005). MSC: 05C12 05C85 68R10 PDFBibTeX XMLCite \textit{S. Baswana} et al., in: Proceedings of the sixteenth annual ACM-SIAM symposium on discrete algorithms, SODA 2005, Vancouver, BC, Canada, January 23--25, 2005. New York, NY: ACM Press. 672--681 (2005; Zbl 1297.05066)
Abraham, David J.; Irving, Robert W.; Kavitha, Telikepalli; Mehlhorn, Kurt Popular matchings. (English) Zbl 1297.68087 Proceedings of the sixteenth annual ACM-SIAM symposium on discrete algorithms, SODA 2005, Vancouver, BC, Canada, January 23–25, 2005. New York, NY: ACM Press (ISBN 0-89871-585-7). 424-432 (2005). MSC: 68Q25 91B68 PDFBibTeX XMLCite \textit{D. J. Abraham} et al., in: Proceedings of the sixteenth annual ACM-SIAM symposium on discrete algorithms, SODA 2005, Vancouver, BC, Canada, January 23--25, 2005. New York, NY: ACM Press. 424--432 (2005; Zbl 1297.68087)
Kavitha, Telikepalli; Mehlhorn, Kurt A polynomial time algorithm for minimum cycle basis in directed graphs. (English) Zbl 1118.05314 Diekert, Volker (ed.) et al., STACS 2005. 22nd annual symposium on theoretical aspects of computer science, Stuttgart, Germany, February 24–26, 2005. Proceedings. Berlin: Springer (ISBN 3-540-24998-2/pbk). Lecture Notes in Computer Science 3404, 654-665 (2005). MSC: 05C85 68Q25 68W20 PDFBibTeX XMLCite \textit{T. Kavitha} and \textit{K. Mehlhorn}, Lect. Notes Comput. Sci. 3404, 654--665 (2005; Zbl 1118.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