Ildikó Schlotter

Most-cited papers

Bin packing with fixed number of bins revisited
K. Jansen, Stefan Kratsch, Dániel Marx, Ildikó Schlotter
2010Journal of computer and system sciences (Print)160 citations Open access
Semantic Scholar
Obtaining a Planar Graph by Vertex Deletion
Dániel Marx, Ildikó Schlotter
2007Algorithmica92 citations Open access
Semantic Scholar
Stable assignment with couples: Parameterized complexity and local search
Dániel Marx, Ildikó Schlotter
2009Discrete Optimization64 citations Open access
Semantic Scholar
Multivariate Complexity Analysis of Swap Bribery
Britta Dorn, Ildikó Schlotter
2010Algorithmica63 citations Open access
Semantic Scholar
Parameterized Complexity and Local Search Approaches for the Stable Marriage Problem with Ties
Dániel Marx, Ildikó Schlotter
2010Algorithmica52 citations Open access
Semantic Scholar
Parameterized Complexity of Eulerian Deletion Problems
M. Cygan, Dániel Marx, M. Pilipczuk, Michał Pilipczuk +1 more
2011Algorithmica48 citations Open access
Semantic Scholar
Stable matching with couples: An empirical study
P. Biró, Robert W. Irving, Ildikó Schlotter
2011JEAL47 citations
Semantic Scholar
Popular branchings and their dual certificates
T. Kavitha, Tamás Király, J. Matuschke, Ildikó Schlotter +1 more
2019Mathematical programming29 citations Open access
Semantic Scholar
Control of Fair Division
H. Aziz, Ildikó Schlotter, T. Walsh
2016International Joint Conference on Artificial Intelligence28 citations
Semantic Scholar
Computing the Deficiency of Housing Markets with Duplicate Houses
K. Cechlárová, Ildikó Schlotter
2010International Symposium on Parameterized and Exact Computation27 citations
Semantic Scholar
Stable Marriage with Covering Constraints-A Complete Computational Trichotomy
Matthias Mnich, Ildikó Schlotter
2016Algorithmic Game Theory19 citations Open access
Semantic Scholar
Cleaning Interval Graphs
Dániel Marx, Ildikó Schlotter
2010Algorithmica16 citations
Semantic Scholar
The popular assignment problem: when cardinality is more important than popularity
T. Kavitha, Tamás Király, J. Matuschke, Ildikó Schlotter +1 more
2021ACM-SIAM Symposium on Discrete Algorithms11 citations Open access
Semantic Scholar
Having a Hard Time? Explore Parameterized Complexity!
Britta Dorn, Ildikó Schlotter
201711 citations
Semantic Scholar
Control in Computational Social Choice
Jiehua Chen, Joanna Kaczmarek, Paul Nüsken, Jörg Rothe +2 more
2024International Joint Conference on Artificial Intelligence9 citations
Semantic Scholar
Stable Matchings with Covering Constraints: A Complete Computational Trichotomy
Matthias Mnich, Ildikó Schlotter
2020Algorithmica9 citations Open access
Semantic Scholar
Obtaining a Proportional Allocation by Deleting Items
Britta Dorn, Ronald de Haan, Ildikó Schlotter
2017Algorithmica9 citations Open access
Semantic Scholar
Refining the complexity of the sports elimination problem
K. Cechlárová, Eva Potpinková, Ildikó Schlotter
2016Discrete Applied Mathematics9 citations Open access
Semantic Scholar
Parameterized graph cleaning problems
Dániel Marx, Ildikó Schlotter
2008Discrete Applied Mathematics9 citations Open access
Semantic Scholar
Odd Paths, Cycles, and \(T\)-Joins: Connections and Algorithms
Ildikó Schlotter, András Sebö
2022SIAM Journal on Discrete Mathematics8 citations Open access
Semantic Scholar
A Connection Between Sports and Matroids: How Many Teams Can We Beat?
Ildikó Schlotter, K. Cechlárová
2016Algorithmica8 citations Open access
Semantic Scholar
Arborescences, Colorful Forests, and Popularity
T. Kavitha, Kazuhisa Makino, Ildikó Schlotter, Yu Yokoi
2023arXiv.org5 citations
Semantic Scholar
The core of housing markets from an agent's perspective: Is it worth sprucing up your home?
Ildikó Schlotter, Péter Biró, T. Fleiner
2021Workshop on Internet and Network Economics5 citations
Semantic Scholar
Parameterized Complexity of the Arc-Preserving Subsequence Problem
Dániel Marx, Ildikó Schlotter
2010International Workshop on Graph-Theoretic Concepts in Computer Science5 citations
Semantic Scholar
Popular Arborescences and Their Matroid Generalization
T. Kavitha, Kazuhisa Makino, Ildikó Schlotter, Yu Yokoi
2025ACM Trans. Algorithms4 citations
Semantic Scholar
Possible and Necessary Allocations Under Serial Dictatorship with Incomplete Preference Lists
K. Cechlárová, T. Fleiner, Ildikó Schlotter
2017Algorithmic Decision Theory4 citations
Semantic Scholar
Stable Hypergraph Matching in Unimodular Hypergraphs
Péter Biró, G. Csáji, Ildikó Schlotter
2025International Colloquium on Automata, Languages and Programming3 citations
Semantic Scholar
Candidate nomination for Condorcet-consistent voting rules
Ildikó Schlotter, Katar'ina Cechl'arov'a
2025Adaptive Agents and Multi-Agent Systems3 citations
Semantic Scholar
Parameterized complexity of candidate nomination for elections based on positional scoring rules
Ildikó Schlotter, K. Cechlárová, Diana Trellová
2024Autonomous Agents and Multi-Agent Systems3 citations Open access
Semantic Scholar
Shortest two disjoint paths in conservative graphs
Ildikó Schlotter
2023Symposium on Theoretical Aspects of Computer Science3 citations Open access
Semantic Scholar
Shortest Odd Paths in Undirected Graphs with Conservative Weight Functions
Alpár Jüttner, Csaba Király, Lydia Mirabel Mendoza-Cadena, G. Pap +2 more
2023Discrete Applied Mathematics3 citations Open access
Semantic Scholar
Maximum-utility Popular Matchings with Bounded Instability
Ildikó Schlotter, Ágnes Cseh
2022ACM Transactions on Computation Theory3 citations Open access
Semantic Scholar
Control and Bribery in Stable Marriage and Stable Roommates: A Complete Complexity Landscape
Jiehua Chen, Ildikó Schlotter
20252 citations
Semantic Scholar
The Strong Core of Housing Markets with Partial Order Preferences
Ildikó Schlotter, Lydia Mirabel Mendoza-Cadena
2025Adaptive Agents and Multi-Agent Systems2 citations
Semantic Scholar
Recognizing when a preference system is close to admitting a master list
Ildikó Schlotter
2022Workshop on Algorithms and Computation2 citations Open access
Semantic Scholar
Complexity of stability in trading networks
T. Fleiner, Zsuzsanna Jankó, Ildikó Schlotter, A. Teytelboym
2018International Journal of Game Theory2 citations Open access
Semantic Scholar
Detecting Approximate Clones under Approval Voting
Théo Delemazure, Piotr Faliszewski, Łukasz Janeczko, Dušan Knop +4 more
2026Proceedings of the 25th International Conference on Autonomous Agents and Multiagent Systems1 citations Open access
Semantic Scholar
Necessary President in Elections with Parties
Katar'ina Cechl'arov'a, Ildikó Schlotter
2026Proceedings of the 25th International Conference on Autonomous Agents and Multiagent Systems1 citations
Semantic Scholar
Identifying Imperfect Clones in Elections
Piotr Faliszewski, Łukasz Janeczko, Grzegorz Lisowski, Kristýna Pekárková +1 more
2025AAAI Conference on Artificial Intelligence1 citations
Semantic Scholar
Computing Equilibrium Nominations in Presidential Elections
Piotr Faliszewski, Stanislaw Kazmierowski, Grzegorz Lisowski, Ildikó Schlotter +1 more
2025arXiv.org1 citations
Semantic Scholar
Clustering via Hedonic Games: New Concepts and Algorithms
Gergely Csáji, Alexander Gundert, Jörg Rothe, Ildikó Schlotter
2025Neural Information Processing Systems1 citations Open access
Semantic Scholar
Frontiers of Parameterized Algorithmics of Matching under Preferences (Dagstuhl Seminar 25342)
Jiehua Chen, Christine Cheng, David Manlove, Ildikó Schlotter +1 more
2025Dagstuhl Reports1 citations
Semantic Scholar
Parameterized Algorithms for Optimal Refugee Resettlement
Jiehua Chen, Ildikó Schlotter, Sofia Simola
2024European Conference on Artificial Intelligence1 citations
Semantic Scholar
Computational complexity of necessary envy-freeness
Haris Aziz, Ildikó Schlotter, T. Walsh
2023Mathematical Social Sciences1 citations Open access
Semantic Scholar
Parameterized complexity of spare capacity allocation and the multicost Steiner subgraph problem
Tibor Jordán, Ildikó Schlotter
2015J. Discrete Algorithms1 citations Open access
Semantic Scholar
with Bernoulli-type jobs through policy stratification
Clairemathieu, NicoleMegow, BenjaminJ.Moseley, FritsC.R.Spieksma +44 more
1 citations
Semantic Scholar
Nearly Group-Separable Elections
Piotr Faliszewski, Jan Jabrocki, Stanislaw Kazmierowski, Kristýna Pekárková +2 more
20260 citations
Semantic Scholar
Computing Equilibrium Nominations in Presidential Elections
Piotr Faliszewski, Stanislaw Kazmierowski, Grzegorz Lisowski, Ildikó Schlotter +1 more
2026AAAI Conference on Artificial Intelligence0 citations Open access
Semantic Scholar
Navigating the Complexity Landscape of Nominee Selection in Schulze Voting
Katar'ina Cechl'arov'a, J. Rothe, Šimon Schierreich, Ildikó Schlotter
2026arXiv.org0 citations
Semantic Scholar
Individual Rationality in Constrained Hedonic Games: Friends, Enemies, and Neutrals
Šimon Schierreich, Ildikó Schlotter
20260 citations
Semantic Scholar