Ildikó Schlotter

Publication Activity (10 Years)

Years Active: 2007-2024
Publications (10 Years): 36

Top Topics

Stable Marriage

Computational Complexity

Parameterized Complexity

Top Venues

Discret. Appl. Math.

Publications

Telikepalli Kavitha, Kazuhisa Makino, Ildikó Schlotter, Yu Yokoi
Arborescences, Colorful Forests, and Popularity. SODA (2024)
Ildikó Schlotter
Recognizing when a preference system is close to admitting a master list. Theor. Comput. Sci. 994 (2024)
Haris Aziz, Ildikó Schlotter, Toby Walsh
Computational complexity of necessary envy-freeness. Math. Soc. Sci. 127 (2024)
Ildikó Schlotter, Katarína Cechlárová, Diana Trellová
Parameterized complexity of candidate nomination for elections based on positional scoring rules. Auton. Agents Multi Agent Syst. 38 (2) (2024)
Alpár Jüttner, Csaba Király, Lydia Mirabel Mendoza Cadena, Gyula Pap, Ildikó Schlotter, Yutaro Yamaguchi
Shortest odd paths in undirected graphs with conservative weight functions. Discret. Appl. Math. 357 (2024)
Naonori Kakimura, Ildikó Schlotter
Parameterized Complexity of Submodular Minimization Under Uncertainty. SWAT (2024)
Naonori Kakimura, Ildikó Schlotter
Parameterized Complexity of Submodular Minimization under Uncertainty. CoRR (2024)
Ildikó Schlotter
Shortest Two Disjoint Paths in Conservative Graphs. STACS (2024)
Ildikó Schlotter
Recognizing When a Preference System is Close to Admitting a Master List. WALCOM (2023)
Ildikó Schlotter
Shortest two disjoint paths in conservative graphs. CoRR (2023)
Telikepalli Kavitha, Kazuhisa Makino, Ildikó Schlotter, Yu Yokoi
Arborescences, Colorful Forests, and Popularity. CoRR (2023)
Tamás Fleiner, Zsuzsanna Jankó, Ildikó Schlotter, Alexander Teytelboym
Complexity of stability in trading networks. Int. J. Game Theory 52 (3) (2023)
Alpár Jüttner, Csaba Király, Lydia Mirabel Mendoza Cadena, Gyula Pap, Ildikó Schlotter, Yutaro Yamaguchi
Shortest Odd Paths in Undirected Graphs with Conservative Weight Functions. CoRR (2023)
Telikepalli Kavitha, Tamás Király, Jannik Matuschke, Ildikó Schlotter, Ulrike Schmidt-Kraepelin
Popular branchings and their dual certificates. Math. Program. 192 (1) (2022)
Ildikó Schlotter, Ágnes Cseh
Maximum-utility popular matchings with bounded instability. CoRR (2022)
Ildikó Schlotter
Recognizing when a preference system is close to admitting a master list. CoRR (2022)
Telikepalli Kavitha, Tamás Király, Jannik Matuschke, Ildikó Schlotter, Ulrike Schmidt-Kraepelin
The popular assignment problem: when cardinality is more important than popularity. SODA (2022)
Ildikó Schlotter, András Sebö
Shortest Odd Paths in Conservative Graphs: Connections and Complexity. CoRR (2022)
Britta Dorn, Ronald de Haan, Ildikó Schlotter
Obtaining a Proportional Allocation by Deleting Items. Algorithmica 83 (5) (2021)
Telikepalli Kavitha, Tamás Király, Jannik Matuschke, Ildikó Schlotter, Ulrike Schmidt-Kraepelin
The popular assignment problem: when cardinality is more important than popularity. CoRR (2021)
Ildikó Schlotter, Péter Biró, Tamás Fleiner
The Core of Housing Markets from an Agent's Perspective: Is It Worth Sprucing Up Your Home? WINE (2021)
Ildikó Schlotter, Péter Biró, Tamás Fleiner
The core of housing markets from an agent's perspective: Is it worth sprucing up your home? CoRR (2021)
Telikepalli Kavitha, Tamás Király, Jannik Matuschke, Ildikó Schlotter, Ulrike Schmidt-Kraepelin
Popular Branchings and Their Dual Certificates. IPCO (2020)
Matthias Mnich, Ildikó Schlotter
Stable Matchings with Covering Constraints: A Complete Computational Trichotomy. Algorithmica 82 (5) (2020)
Telikepalli Kavitha, Tamás Király, Jannik Matuschke, Ildikó Schlotter, Ulrike Schmidt-Kraepelin
Popular Branchings and Their Dual Certificates. CoRR (2019)
Tamás Fleiner, Zsuzsanna Jankó, Ildikó Schlotter, Alexander Teytelboym
Complexity of Stability in Trading Networks. CoRR (2018)
Ildikó Schlotter, Katarína Cechlárová
A Connection Between Sports and Matroids: How Many Teams Can We Beat? Algorithmica 80 (1) (2018)
Ildikó Schlotter, Katarína Cechlárová
Correction to: A Connection Between Sports and Matroids: How Many Teams Can We Beat? Algorithmica 80 (11) (2018)
Matthias Mnich, Ildikó Schlotter
Stable Marriage with Covering Constraints-A Complete Computational Trichotomy. SAGT (2017)
Britta Dorn, Ronald de Haan, Ildikó Schlotter
Obtaining a Proportional Allocation by Deleting Items. ADT (2017)
Katarína Cechlárová, Tamás Fleiner, Ildikó Schlotter
Possible and Necessary Allocations Under Serial Dictatorship with Incomplete Preference Lists. ADT (2017)
Ildikó Schlotter, Piotr Faliszewski, Edith Elkind
Campaign Management Under Approval-Driven Voting Rules. Algorithmica 77 (1) (2017)
Britta Dorn, Ronald de Haan, Ildikó Schlotter
Obtaining a Proportional Allocation by Deleting Items. CoRR (2017)
Haris Aziz, Ildikó Schlotter, Toby Walsh
Control of Fair Division. IJCAI (2016)
Matthias Mnich, Ildikó Schlotter
Stable Marriage with Covering Constraints: A Complete Computational Trichotomy. CoRR (2016)
Katarína Cechlárová, Eva Potpinková, Ildikó Schlotter
Refining the complexity of the sports elimination problem. Discret. Appl. Math. 199 (2016)
Ildikó Schlotter, Piotr Faliszewski, Edith Elkind
Campaign Management under Approval-Driven Voting Rules. CoRR (2015)
Tibor Jordán, Ildikó Schlotter
Parameterized complexity of spare capacity allocation and the multicost Steiner subgraph problem. J. Discrete Algorithms 30 (2015)
Marek Cygan, Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk, Ildikó Schlotter
Parameterized Complexity of Eulerian Deletion Problems. Algorithmica 68 (1) (2014)
Dániel Marx, Ildikó Schlotter
Cleaning Interval Graphs. Algorithmica 65 (2) (2013)
Klaus Jansen, Stefan Kratsch, Dániel Marx, Ildikó Schlotter
Bin packing with fixed number of bins revisited. J. Comput. Syst. Sci. 79 (1) (2013)
Britta Dorn, Ildikó Schlotter
Multivariate Complexity Analysis of Swap Bribery. Algorithmica 64 (1) (2012)
Dániel Marx, Ildikó Schlotter
Obtaining a Planar Graph by Vertex Deletion. Algorithmica 62 (3-4) (2012)
Ildikó Schlotter, Piotr Faliszewski, Edith Elkind
Campaign Management under Approval-Driven Voting Rules. AAAI (2011)
Marek Cygan, Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk, Ildikó Schlotter
Parameterized Complexity of Eulerian Deletion Problems. WG (2011)
Dániel Marx, Ildikó Schlotter
Stable assignment with couples: Parameterized complexity and local search. Discret. Optim. 8 (1) (2011)
Péter Biró, Robert W. Irving, Ildikó Schlotter
Stable matching with couples: An empirical study. ACM J. Exp. Algorithmics 16 (2011)
Katarína Cechlárová, Ildikó Schlotter
Computing the Deficiency of Housing Markets with Duplicate Houses. IPEC (2010)
Klaus Jansen, Stefan Kratsch, Dániel Marx, Ildikó Schlotter
Bin Packing with Fixed Number of Bins Revisited. SWAT (2010)
Dániel Marx, Ildikó Schlotter
Parameterized Complexity of the Arc-Preserving Subsequence Problem. WG (2010)
Dániel Marx, Ildikó Schlotter
Parameterized Complexity and Local Search Approaches for the Stable Marriage Problem with Ties. Algorithmica 58 (1) (2010)
Britta Dorn, Ildikó Schlotter
Multivariate Analyis of Swap Bribery CoRR (2010)
Dániel Marx, Ildikó Schlotter
Cleaning Interval Graphs CoRR (2010)
Britta Dorn, Ildikó Schlotter
Multivariate Complexity Analysis of Swap Bribery. IPEC (2010)
Dániel Marx, Ildikó Schlotter
Parameterized graph cleaning problems. Discret. Appl. Math. 157 (15) (2009)
Dániel Marx, Ildikó Schlotter
Stable Assignment with Couples: Parameterized Complexity and Local Search. IWPEC (2009)
Dániel Marx, Ildikó Schlotter
Parameterized Graph Cleaning Problems. WG (2008)
Dániel Marx, Ildikó Schlotter
Obtaining a Planar Graph by Vertex Deletion CoRR (2008)
Dániel Marx, Ildikó Schlotter
Obtaining a Planar Graph by Vertex Deletion. WG (2007)