Parameterized graph cleaning problems. - Dániel Marx; Ildikó Schlotter (Discret. Appl. Math., 2009)

Computing the Deficiency of Housing Markets with Duplicate Houses. - Katarína Cechlárová; Ildikó Schlotter (IPEC, 2010)

Parameterized Complexity of the Arc-Preserving Subsequence Problem. - Dániel Marx; Ildikó Schlotter (WG, 2010)

Parameterized Complexity and Local Search Approaches for the Stable Marriage Problem with Ties. - Dániel Marx; Ildikó Schlotter (Algorithmica, 2010)

Multivariate Analyis of Swap Bribery - Britta Dorn; Ildikó Schlotter (CoRR, 2010)

Parameterized Complexity of Graph Modification and Stable Matching Problems - Ildikó Schlotter (2010)

Stable assignment with couples: Parameterized complexity and local search. - Dániel Marx; Ildikó Schlotter (Discret. Optim., 2011)

Stable matching with couples: An empirical study. - Péter Biró 001; Robert W. Irving; Ildikó Schlotter (ACM J. Exp. Algorithmics, 2011)

Multivariate Complexity Analysis of Swap Bribery. - Britta Dorn; Ildikó Schlotter (Algorithmica, 2012)

Obtaining a Planar Graph by Vertex Deletion. - Dániel Marx; Ildikó Schlotter (Algorithmica, 2012)

Cleaning Interval Graphs. - Dániel Marx; Ildikó Schlotter (Algorithmica, 2013)

Bin packing with fixed number of bins revisited. - Klaus Jansen; Stefan Kratsch; Dániel Marx; Ildikó Schlotter (J. Comput. Syst. Sci., 2013)

Parameterized Complexity of Eulerian Deletion Problems. - Marek Cygan; Dániel Marx; Marcin Pilipczuk; Michal Pilipczuk; Ildikó Schlotter (Algorithmica, 2014)

Parameterized complexity of spare capacity allocation and the multicost Steiner subgraph problem. - Tibor Jordán; Ildikó Schlotter (J. Discrete Algorithms, 2015)

Control of Fair Division. - Haris Aziz 001; Ildikó Schlotter; Toby Walsh (IJCAI, 2016)

Refining the complexity of the sports elimination problem. - Katarína Cechlárová; Eva Potpinková; Ildikó Schlotter (Discret. Appl. Math., 2016)

Possible and Necessary Allocations Under Serial Dictatorship with Incomplete Preference Lists. - Katarína Cechlárová; Tamás Fleiner; Ildikó Schlotter (ADT, 2017)

Stable Marriage with Covering Constraints-A Complete Computational Trichotomy. - Matthias Mnich; Ildikó Schlotter (SAGT, 2017)

Campaign Management Under Approval-Driven Voting Rules. - Ildikó Schlotter; Piotr Faliszewski; Edith Elkind (Algorithmica, 2017)

A Connection Between Sports and Matroids: How Many Teams Can We Beat? - Ildikó Schlotter; Katarína Cechlárová (Algorithmica, 2018)

Correction to: A Connection Between Sports and Matroids: How Many Teams Can We Beat? - Ildikó Schlotter; Katarína Cechlárová (Algorithmica, 2018)

Stable Matchings with Covering Constraints: A Complete Computational Trichotomy. - Matthias Mnich; Ildikó Schlotter (Algorithmica, 2020)

Obtaining a Proportional Allocation by Deleting Items. - Britta Dorn; Ronald de Haan; Ildikó Schlotter (Algorithmica, 2021)

The popular assignment problem: when cardinality is more important than popularity. - Telikepalli Kavitha; Tamás Király; Jannik Matuschke; Ildikó Schlotter; Ulrike Schmidt-Kraepelin (SODA, 2022)

Shortest Odd Paths in Conservative Graphs: Connections and Complexity. - Ildikó Schlotter; András Sebö (CoRR, 2022)

Popular branchings and their dual certificates. - Telikepalli Kavitha; Tamás Király; Jannik Matuschke; Ildikó Schlotter; Ulrike Schmidt-Kraepelin (Math. Program., 2022)

Complexity of stability in trading networks. - Tamás Fleiner; Zsuzsanna Jankó; Ildikó Schlotter; Alexander Teytelboym (Int. J. Game Theory, 2023)

Parameterized Algorithms for Optimal Refugee Resettlement. - Jiehua Chen 001; Ildikó Schlotter; Sofia Simola (ECAI, 2024)

Arborescences, Colorful Forests, and Popularity. - Telikepalli Kavitha; Kazuhisa Makino; Ildikó Schlotter; Yu Yokoi (SODA, 2024)

Shortest Two Disjoint Paths in Conservative Graphs. - Ildikó Schlotter (STACS, 2024)

Parameterized Complexity of Submodular Minimization Under Uncertainty. - Naonori Kakimura; Ildikó Schlotter (SWAT, 2024)

Shortest odd paths in undirected graphs with conservative weight functions. - Alpár Jüttner; Csaba Király 001; Lydia Mirabel Mendoza Cadena; Gyula Pap; Ildikó Schlotter; Yutaro Yamaguchi 001 (Discret. Appl. Math., 2024)

Computational complexity of necessary envy-freeness. - Haris Aziz 001; Ildikó Schlotter; Toby Walsh (Math. Soc. Sci., 2024)

Recognizing when a preference system is close to admitting a master list. - Ildikó Schlotter (Theor. Comput. Sci., 2024)

Parameterized complexity of candidate nomination for elections based on positional scoring rules. - Ildikó Schlotter; Katarína Cechlárová; Diana Trellová (Auton. Agents Multi Agent Syst., 2024)

Stable Hypergraph Matching in Unimodular Hypergraphs. - Péter Biró 001; Gergely Csáji; Ildikó Schlotter (ICALP, 2025)

Candidate Nomination for Condorcet-consistent Voting Rules. - Ildikó Schlotter; Katarína Cechlárová (AAMAS, 2025)

The Strong Core of Housing Markets with Partial Order Preferences. - Ildikó Schlotter; Lydia Mirabel Mendoza Cadena (AAMAS, 2025)

The Core of Housing Markets from an Agent's Perspective: Is It Worth Sprucing up Your Home? - Ildikó Schlotter; Péter Biró 001; Tamás Fleiner (Math. Oper. Res., 2025)

Odd Paths, Cycles, and (T )-Joins: Connections and Algorithms. - Ildikó Schlotter; András Sebö (SIAM J. Discret. Math., 2025)

Popular Arborescences and Their Matroid Generalization. - Telikepalli Kavitha; Kazuhisa Makino; Ildikó Schlotter; Yu Yokoi (ACM Trans. Algorithms, 2025)

Control in Stable Marriage and Stable Roommates: Complexity and Algorithms. - Jiehua Chen 001; Ildikó Schlotter (CoRR, 2025)

Maximum-utility Popular Matchings with Bounded Instability. - Ildikó Schlotter; Ágnes Cseh (ACM Trans. Comput. Theory, 2025)