  |
Items where Author is "Kavitha, Telikepalli"
Group by: Item Type | No Grouping Jump to: Article | Book Section Number of items: 4. ArticleBérczi, Kristóf and Bérczi-Kovács, Erika R. and Boros, Endre and Gedefa, Fekadu Tolessa and Kamiyama, Naoyuki and Kavitha, Telikepalli and Kobayashi, Yusuke and Makino, Kazuhisa (2024) Envy-free relaxations for goods, chores, and mixed items. Theoretical Computer Science, 1002. p. 114596. ISSN 03043975 Kavitha, Telikepalli and Király, Tamás and Matuschke, Jannik and Schlotter, Ildikó and Schmidt-Kraepelin, Ulrike (2021) Popular Branchings and Their Dual Certificates. MATHEMATICAL PROGRAMMING : A PUBLICATION OF THE MATHEMATICAL OPTIMIZATION SOCIETY. pp. 1-29. ISSN 0025-5610 (print); 1436-4646 (online) Cseh, Ágnes and Kavitha, Telikepalli (2021) Popular Matchings in Complete Graphs. ALGORITHMICA. pp. 1-31. ISSN 0178-4617 Book SectionKavitha, Telikepalli and Makino, Kazuhisa and Schlotter, Ildikó Anna and Yokoi, Yu (2024) Arborescences, Colorful Forests, and Popularity. In: Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). SIAM, Philadelphia (PA), pp. 3724-3746. ISBN 9781611977912 |
