Items where Author is "Schlotter, Ildikó Anna"

Article

Aziz, H. and Schlotter, Ildikó Anna and Walsh, T. (2024) Computational complexity of necessary envy-freeness. MATHEMATICAL SOCIAL SCIENCES, 127. pp. 86-98. ISSN 0165-4896

Schlotter, Ildikó Anna (2024) Recognizing when a preference system is close to admitting a master list. THEORETICAL COMPUTER SCIENCE, 994. No. 114445. ISSN 0304-3975

Fleiner, Tamás and Jankó, Zsuzsanna and Schlotter, Ildikó Anna and Teytelboym, Alexander (2023) Complexity of stability in trading networks. INTERNATIONAL JOURNAL OF GAME THEORY, 52. pp. 629-648. ISSN 0020-7276

Dorn, Britta and de Haan, Ronald and Schlotter, Ildikó Anna (2021) Obtaining a Proportional Allocation by Deleting Items. ALGORITHMICA, 83 (5). pp. 1559-1603. ISSN 0178-4617

Mnich, Matthias and Schlotter, Ildikó Anna (2020) Stable Matchings with Covering Constraints: A Complete Computational Trichotomy. ALGORITHMICA, 82 (5). pp. 1136-1188. ISSN 0178-4617

Schlotter, Ildikó Anna and Cechlárová, K. (2017) A Connection Between Sports and Matroids: How Many Teams Can We Beat? ALGORITHMICA, -. Article in Press. ISSN 0178-4617

Mnich, Matthias and Schlotter, Ildikó Anna (2017) Stable Marriage with Covering Constraints–A Complete Computational Trichotomy. LNCS, 10504. pp. 230-332.

Schlotter, Ildikó Anna and Faliszewski, Piotr and Elkind, Edith (2015) Campaign management under approval-driven voting rules. ALGORITHMICA. pp. 1-32. ISSN 0178-4617

Book Section

Kavitha, 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

Chen, Jiehua and Schlotter, Ildikó Anna and Simola, Sofia (2024) Parameterized Algorithms for Optimal Refugee Resettlement. In: ECAI 2024. Frontiers in Artificial Intelligence and Applications . IOS Press, pp. 3413-3420. ISBN 9781643685489

Kakimura, Naonori and Schlotter, Ildikó Anna (2024) Parameterized Complexity of Submodular Minimization Under Uncertainty. In: 19th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2024). Leibniz International Proceedings in Informatics (LIPIcs) (294). Leibniz-Zentrum für Informatik, Wadern, 30:1-30:17. ISBN 9783959773188

Schlotter, Ildikó Anna (2024) Shortest Two Disjoint Paths in Conservative Graphs. In: 41st International Symposium on Theoretical Aspects of Computer Science, STACS 2024. Leibniz International Proceedings in Informatics, LIPIcs (289). Leibniz-Zentrum für Informatik, Wadern, No. 57. ISBN 9783959773119

Schlotter, Ildikó Anna (2023) Recognizing When a Preference System is Close to Admitting a Master List. In: WALCOM: Algorithms and Computation : 17th International Conference and Workshops, WALCOM 2023, Hsinchu, Taiwan, March 22–24, 2023, Proceedings. Lecture Notes in Computer Science (13973). Springer Cham, pp. 317-329. ISBN 978-3-031-27050-5 (nyomtatott)

Schlotter, Ildikó Anna and Biró, Péter and Fleiner, Tamás (2022) The Core of Housing Markets from an Agent’s Perspective : Is It Worth Sprucing up Your Home? In: Web and Internet Economics : 17th International Conference, WINE 2021, Potsdam, Germany, December 14–17, 2021, Proceedings. Lecture Notes in Computer Science . INFORMS, pp. 244-261. ISBN 978-3-030-94675-3 (nyomtatott)

Conference or Workshop Item

Aziz, Haris and Schlotter, Ildikó Anna and Walsh, Toby (2016) Control of Fair Division. In: IJCAI 2016: Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016.07.09, New York.