Ildikó Schlotter

According to our database, Ildikó Schlotter authored at least 37 papers between 2009 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

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., December, 2024

Recognizing when a preference system is close to admitting a master list.

Ildikó Schlotter

Theor. Comput. Sci., 2024

Computational complexity of necessary envy-freeness.

Haris Aziz, Ildikó Schlotter, Toby Walsh

Math. Soc. Sci., 2024

Shortest odd paths in undirected graphs with conservative weight functions.

Alpár Jüttner, Csaba Király, Lydia Mirabel Mendoza Cadena, Gyula Pap, Ildikó Schlotter, Yutaro Yamaguchi

Discret. Appl. Math., 2024

Parameterized Complexity of Submodular Minimization Under Uncertainty.

Naonori Kakimura, Ildikó Schlotter

Proceedings of the 19th Scandinavian Symposium and Workshops on Algorithm Theory, 2024

Shortest Two Disjoint Paths in Conservative Graphs.

Ildikó Schlotter

Proceedings of the 41st International Symposium on Theoretical Aspects of Computer Science, 2024

Arborescences, Colorful Forests, and Popularity.

Telikepalli Kavitha, Kazuhisa Makino, Ildikó Schlotter, Yu Yokoi

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

Parameterized Algorithms for Optimal Refugee Resettlement.

Jiehua Chen, Ildikó Schlotter, Sofia Simola

Proceedings of the ECAI 2024 - 27th European Conference on Artificial Intelligence, 19-24 October 2024, Santiago de Compostela, Spain, 2024

2023

Complexity of stability in trading networks.

Tamás Fleiner, Zsuzsanna Jankó, Ildikó Schlotter, Alexander Teytelboym

Int. J. Game Theory, September, 2023

2022

Popular branchings and their dual certificates.

Telikepalli Kavitha, Tamás Király, Jannik Matuschke, Ildikó Schlotter, Ulrike Schmidt-Kraepelin

Math. Program., 2022

Shortest Odd Paths in Conservative Graphs: Connections and Complexity.

Ildikó Schlotter, András Sebö

CoRR, 2022

Maximum-utility popular matchings with bounded instability.

Ildikó Schlotter, Ágnes Cseh

CoRR, 2022

The popular assignment problem: when cardinality is more important than popularity.

Telikepalli Kavitha, Tamás Király, Jannik Matuschke, Ildikó Schlotter, Ulrike Schmidt-Kraepelin

Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

2021

Obtaining a Proportional Allocation by Deleting Items.

Britta Dorn, Ronald de Haan, Ildikó Schlotter

Algorithmica, 2021

The Core of Housing Markets from an Agent's Perspective: Is It Worth Sprucing Up Your Home?

Ildikó Schlotter, Péter Biró, Tamás Fleiner

Proceedings of the Web and Internet Economics - 17th International Conference, 2021

2020

Stable Matchings with Covering Constraints: A Complete Computational Trichotomy.

Matthias Mnich, Ildikó Schlotter

Algorithmica, 2020

2018

Correction to: A Connection Between Sports and Matroids: How Many Teams Can We Beat?

Ildikó Schlotter, Katarína Cechlárová

Algorithmica, 2018

A Connection Between Sports and Matroids: How Many Teams Can We Beat?

Ildikó Schlotter, Katarína Cechlárová

Algorithmica, 2018

2017

Campaign Management Under Approval-Driven Voting Rules.

Ildikó Schlotter, Piotr Faliszewski, Edith Elkind

Algorithmica, 2017

Stable Marriage with Covering Constraints-A Complete Computational Trichotomy.

Matthias Mnich, Ildikó Schlotter

Proceedings of the Algorithmic Game Theory - 10th International Symposium, 2017

Possible and Necessary Allocations Under Serial Dictatorship with Incomplete Preference Lists.

Katarína Cechlárová, Tamás Fleiner, Ildikó Schlotter

Proceedings of the Algorithmic Decision Theory - 5th International Conference, 2017

2016

Refining the complexity of the sports elimination problem.

Katarína Cechlárová, Eva Potpinková, Ildikó Schlotter

Discret. Appl. Math., 2016

Control of Fair Division.

Haris Aziz, Ildikó Schlotter, Toby Walsh

Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

2015

Parameterized complexity of spare capacity allocation and the multicost Steiner subgraph problem.

Tibor Jordán, Ildikó Schlotter

J. Discrete Algorithms, 2015

2014

Parameterized Complexity of Eulerian Deletion Problems.

Marek Cygan, Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk, Ildikó Schlotter

Algorithmica, 2014

2013

Bin packing with fixed number of bins revisited.

Klaus Jansen, Stefan Kratsch, Dániel Marx, Ildikó Schlotter

J. Comput. Syst. Sci., 2013

Cleaning Interval Graphs.

Dániel Marx, Ildikó Schlotter

Algorithmica, 2013

2012

Obtaining a Planar Graph by Vertex Deletion.

Dániel Marx, Ildikó Schlotter

Algorithmica, 2012

Multivariate Complexity Analysis of Swap Bribery.

Britta Dorn, Ildikó Schlotter

Algorithmica, 2012

2011

Stable matching with couples: An empirical study.

Péter Biró, Robert W. Irving, Ildikó Schlotter

ACM J. Exp. Algorithmics, 2011

Stable assignment with couples: Parameterized complexity and local search.

Dániel Marx, Ildikó Schlotter

Discret. Optim., 2011

2010

Parameterized Complexity of Graph Modification and Stable Matching Problems

Ildikó Schlotter

PhD thesis, 2010

Multivariate Analyis of Swap Bribery

Britta Dorn, Ildikó Schlotter

CoRR, 2010

Parameterized Complexity and Local Search Approaches for the Stable Marriage Problem with Ties.

Dániel Marx, Ildikó Schlotter

Algorithmica, 2010

Parameterized Complexity of the Arc-Preserving Subsequence Problem.

Dániel Marx, Ildikó Schlotter

Proceedings of the Graph Theoretic Concepts in Computer Science, 2010

Computing the Deficiency of Housing Markets with Duplicate Houses.

Katarína Cechlárová, Ildikó Schlotter

Proceedings of the Parameterized and Exact Computation - 5th International Symposium, 2010

2009

Parameterized graph cleaning problems.

Dániel Marx, Ildikó Schlotter

Discret. Appl. Math., 2009