---

Book chapter

• Having a Hard Time? Explore Parameterized Complexity!
  Authors: Britta Dorn, Ildikó Schlotter
  In Trends in Computational Social Choice by Ulle Endriss (editor), AI Access, 2017.
  

Journal papers

• Recognizing when a preference system is close to admitting a master list
  Author: Ildikó Schlotter.
  Theoretical Computer Science, volume 994, article 114445, 2024.
  Publisher's version.
  
• Computational complexity of necessary envy-freeness
  Authors: Haris Aziz, Ildikó Schlotter, Toby Walsh.
  Mathematical Social Sciences, volume 127, pp. 86-98, 2024.
  Publisher's version.
  
• Complexity of stability in trading networks
  Authors: Tamás Fleiner, Zsuzsanna Jankó, Ildikó Schlotter, Alexander Teytelboym.
  International Journal of Game Theory, volume 52, pp. 629-648, 2023.
  Publisher's version.
  
• Popular branchings and their dual certificates
  Authors: Telikepalli Kavitha, Tamás Király, Jannik Matuschke, Ildikó Schlotter, Ulrike Schmidt-Kraepelin.
  Mathematical Programming, volume 192, pp. 567-595, 2022.
  Publisher's version.
  
• Obtaining a proportional allocation by deleting items
  Authors: Britta Dorn, Ronald de Haan, Ildikó Schlotter.
  Algorithmica, volume 83, issue 5, pp. 1559-1603, 2021.
  Publisher's version.
• Stable marriage with covering constraints: A complete computational trichotomy
  Authors: Matthias Mnich, Ildikó Schlotter.
  Algorithmica, volume 82, issue 1, pp. 1136-1188, 2020.
  Publisher's version.
• A connection between sports and matroids: How many teams can we beat?
  Authors: Katarína Cechlárová, Ildikó Schlotter
  Algorithmica, volume 80, issue 1, pp. 258-278, 2018.
  Publisher's version, and its erratum.
• Campaign management under approval-driven voting rules
  Authors: Ildikó Schlotter, Piotr Faliszewski, Edith Elkind
  Algorithmica, volume 77, issue 1, pp. 84-115, 2017.
  Publisher's version.
• Refining the complexity of the sports elimination problem
  Authors: Katarína Cechlárová, Eva Potpinková, Ildikó Schlotter
  Discrete Applied Mathematics, volume 199, pp. 172-186, 2016.
  Publisher's version.
• Parameterized complexity of Spare Capacity Allocation and the Multicost Steiner Subgraph problem
  Authors: Tibor Jordán, Ildikó Schlotter
  Journal of Discrete Algorithms, volume 30, pp. 29-44, 2015.
  Publisher's version.
• Parameterized complexity of Eulerian deletion problems
  Authors: Marek Cygan, Dániel Marx, Marcin Pilipczuk, Michał Pilipczuk, Ildikó Schlotter
  Algorithmica, volume 68, issue 1, pp. 41-61, 2014.
  Publisher's version.
  
• Bin packing with fixed number of bins revisited
  Authors: Klaus Jansen, Stefan Kratsch, Dániel Marx, Ildikó Schlotter
  Journal of Computer and System Sciences, volume 79, issue 1, pp. 39-49, 2013.
  Publisher's version.
  
• Cleaning interval graphs
  Authors: Dániel Marx, Ildikó Schlotter
  Algorithmica, volume 65, issue 2, pp. 275-316, 2013.
  Publisher's version.
  
• Multivariate complexity analysis of Swap Bribery
  Authors: Britta Dorn, Ildikó Schlotter
  Algorithmica, volume 64, issue 1, pp. 126-151, 2012.
  Publisher's version.
• Obtaining a planar graph by vertex deletion
  Authors: Dániel Marx, Ildikó Schlotter
  Algorithmica, volume 62, issue 3, pp. 807-822, 2012.
  Publisher's version.
• Stable matching with couples: An empirical study
  Authors: Péter Biró, Robert W. Irving, Ildikó Schlotter
  Journal of Experimental Algorithmics, volume 16, May 2011, Article 1.2.
  Publisher's version.
  
• Stable assignment with couples: parameterized complexity and local search
  Authors: Dániel Marx, Ildikó Schlotter
  Discrete Optimization, volume 8, pp. 25-40, 2011.
  Publisher's version.
  
• Parameterized complexity and local search approaches for the stable marriage problem with ties
  Authors: Dániel Marx, Ildikó Schlotter
  Algorithmica, volume 58, issue 1, pp. 170-187, 2010.
  Publisher's version.
• Parameterized graph cleaning problems
  Authors: Dániel Marx, Ildikó Schlotter
  Discrete Applied Mathematics, volume 157, issue 15, pp. 3258-3267, 2009.
  Publisher's version.

Conference papers

• Parameterized complexity of submodular minimization under uncertainty
  Author: Naonori Kakimura, Ildikó Schlotter.
  Accepted to the 19th Scandinavian Symposium on Algorithm Theory (SWAT 2024).
  
• Shortest two disjoint paths in conservative graphs
  Author: Ildikó Schlotter.
  In Proc. of the 41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024), Leibniz International Proceedings in Informatics (LIPIcs), volume 289, pp. 57:1-57:17, 2024.
  Publisher's version.
  
• Arborescences, colorful forests, and popularity
  Authors: Telikepalli Kavitha, Kazuhisa Makino, Ildikó Schlotter, Yu Yokoi.
  In Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2024), pp. 3724-3746, 2024.
  Publisher's version.
  
• The popular assignment problem: when cardinality is more important than popularity
  Authors: Telikepalli Kavitha, Tamás Király, Jannik Matuschke, Ildikó Schlotter, Ulrike Schmidt-Kraepelin.
  In Proc. of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2022), SIAM, pp. 103-123, 2022.
  Publisher's version.
  
• The core of housing markets from an agent's perspective: Is it worth sprucing up your home?
  Authors: Ildikó Schlotter, Péter Biró, Tamás Fleiner.
  In Proc. of the 17th Conference on Web and Internet Economics (WINE 2021), Potsdam, Germany, Lecture Notes in Computer Science 13112, pp. 244-261, 2021.
  Publisher's version.
  
• Possible and necessary allocations under serial dictatorship with incomplete preference lists
  Authors: Katarína Cechlárová, Tamás Fleiner, Ildikó Schlotter.
  In Proc. of 5th International Conference on Algorithmic Decision Theory (ADT 2017), Luxembourg, Luxembourg, Lecture Notes in Computer Science 10576, pp. 300-314, 2017.
  Publisher's version.
  
• Computing the deficiency of housing markets with duplicate houses
  Authors: Katarína Cechlárová, Ildikó Schlotter
  In Proc. of International Symposium on Parameterized and Exact Computation (IPEC 2010), Chennai, India, Lecture Notes in Computer Science 6478, Springer-Verlag Berlin Heidelberg, pp. 72-83, 2010.
  Publisher's version.
• Parameterized complexity of the Arc-Preserving Subsequence problem
  Authors: Dániel Marx, Ildikó Schlotter
  In Proc. of 36th International Workshop on Graph Theoretic Concepts in Computer Science (WG 2010), Zarós, Crete, Greece, Lecture Notes in Computer Science 6410, Springer-Verlag Berlin Heidelberg, pp. 244-255, 2010.
  Publisher's version.

Others

• PhD dissertation: Parameterized Complexity of Graph Modification and Stable Matching Problems
  Supervisor: Dániel Marx
  
• Stable matching with couples: theory and practice
  Authors: Péter Biró, Robert W. Irving, Ildikó Schlotter
  University of Glasgow, School of Computing Science, Research Report, TR-2011-324, 2011.
• Matrix analysis of V- or Y-supperted continuous bridge girders
  Authors: Géza Tassi, Pál Rózsa, Ildikó Schlotter
  BME ÉŐK Hidak és Szerkezetek Tanszéke Tudományos Közleményei, Budapest, pp. 181-192, 2006.
• Internetes tartalmak minősítése a felhasználók modellezésével
  Author: Schlotter Ildikó, Gáspár Csaba, Lukács András
  Híradástechnika, Budapest, Volume 5, pp. 13-19, 2005.
• Hírportálok rovatainak modell alapú minősítése
  Author: Schlotter Ildikó
  Tudományos Diákköri dolgozat, BME VIK, Távközlési és Médiainformatikai Tanszék, 2004.

Publication list in the DBLP data base.
Publication list in the Google Scholar data base.
Publication list in the MTMT data base.