Ildikó Schlotter

83 papers A* 8A 4B 10Journal 54Unranked 6

Year	Rank	Type	Title / Venue / Authors
2026	A*	`conf`	Computing Equilibrium Nominations in Presidential Elections. AAAI Piotr Faliszewski, Stanislaw Kazmierowski, Grzegorz Lisowski, Ildikó Schlotter, Paolo Turrini
2026	A*	`conf`	Identifying Imperfect Clones in Elections. AAAI Piotr Faliszewski, Lukasz Janeczko, Grzegorz Lisowski, Kristýna Pekárková, Ildikó Schlotter
2026	J	`jnl`	Necessary President in Elections with Parties. CoRR Katarína Cechlárová, Ildikó Schlotter
2026	J	`jnl`	Optimal Portfolio Compression for Priority-Proportional Clearing with Defaulting Costs. CoRR Gergely Csáji, Rares-Ioan Mateiu, Alexandru Popa, Ildikó Schlotter
2026	J	`jnl`	Parameterized complexity of submodular minimization under uncertainty. J. Comput. Syst. Sci. Naonori Kakimura, Ildikó Schlotter
2026	J	`jnl`	Shortest Two Disjoint Paths in Conservative Graphs. Algorithmica Ildikó Schlotter
2025	A	`conf`	Candidate Nomination for Condorcet-consistent Voting Rules. AAMAS Ildikó Schlotter, Katarína Cechlárová
2025	J	`jnl`	Candidate nomination for Condorcet-consistent voting rules. CoRR Ildikó Schlotter, Katarína Cechlárová
2025	J	`jnl`	Computing Equilibrium Nominations in Presidential Elections. CoRR Piotr Faliszewski, Stanislaw Kazmierowski, Grzegorz Lisowski, Ildikó Schlotter, Paolo Turrini
2025	A*	`conf`	Control in Computational Social Choice. IJCAI Jiehua Chen, Joanna Kaczmarek, Paul Nüsken, Jörg Rothe, Ildikó Schlotter, Tessa Seeger
2025	J	`jnl`	Control in Stable Marriage and Stable Roommates: Complexity and Algorithms. CoRR Jiehua Chen, Ildikó Schlotter
2025	J	`jnl`	Identifying Imperfect Clones in Elections. CoRR Piotr Faliszewski, Lukasz Janeczko, Grzegorz Lisowski, Kristýna Pekárková, Ildikó Schlotter
2025	J	`jnl`	Maximum-utility Popular Matchings with Bounded Instability. ACM Trans. Comput. Theory Ildikó Schlotter, Ágnes Cseh
2025	J	`jnl`	Odd Paths, Cycles, and \(T\)-Joins: Connections and Algorithms. SIAM J. Discret. Math. Ildikó Schlotter, András Sebö
2025	J	`jnl`	Popular Arborescences and Their Matroid Generalization. ACM Trans. Algorithms Telikepalli Kavitha, Kazuhisa Makino, Ildikó Schlotter, Yu Yokoi
2025	B	`conf`	Solving Four Open Problems about Core Stability in Altruistic Hedonic Games. TARK Jörg Rothe, Ildikó Schlotter
2025	A*	`conf`	Stable Hypergraph Matching in Unimodular Hypergraphs. ICALP Péter Biró, Gergely Csáji, Ildikó Schlotter
2025	J	`jnl`	Stable Hypergraph Matching in Unimodular Hypergraphs. CoRR Péter Biró, Gergely Csáji, Ildikó Schlotter
2025	J	`jnl`	The Core of Housing Markets from an Agent's Perspective: Is It Worth Sprucing up Your Home? Math. Oper. Res. Ildikó Schlotter, Péter Biró, Tamás Fleiner
2025	A	`conf`	The Strong Core of Housing Markets with Partial Order Preferences. AAMAS Ildikó Schlotter, Lydia Mirabel Mendoza-Cadena
2025	J	`jnl`	The Strong Core of Housing Markets with Partial Order Preferences. CoRR Ildikó Schlotter, Lydia Mirabel Mendoza-Cadena
2024	A*	`conf`	Arborescences, Colorful Forests, and Popularity. SODA Telikepalli Kavitha, Kazuhisa Makino, Ildikó Schlotter, Yu Yokoi
2024	J	`jnl`	Computational complexity of necessary envy-freeness. Math. Soc. Sci. Haris Aziz, Ildikó Schlotter, Toby Walsh
2024	A	`conf`	Parameterized Algorithms for Optimal Refugee Resettlement. ECAI Jiehua Chen, Ildikó Schlotter, Sofia Simola
2024	J	`jnl`	Parameterized Algorithms for Optimal Refugee Resettlement. CoRR Jiehua Chen, Ildikó Schlotter, Sofia Simola
2024	—	`conf`	Parameterized Complexity of Submodular Minimization Under Uncertainty. SWAT Naonori Kakimura, Ildikó Schlotter
2024	J	`jnl`	Parameterized Complexity of Submodular Minimization under Uncertainty. CoRR Naonori Kakimura, Ildikó Schlotter
2024	J	`jnl`	Parameterized complexity of candidate nomination for elections based on positional scoring rules. Auton. Agents Multi Agent Syst. Ildikó Schlotter, Katarína Cechlárová, Diana Trellová
2024	J	`jnl`	Recognizing when a preference system is close to admitting a master list. Theor. Comput. Sci. Ildikó Schlotter
2024	A	`conf`	Shortest Two Disjoint Paths in Conservative Graphs. STACS Ildikó Schlotter
2024	J	`jnl`	Shortest odd paths in undirected graphs with conservative weight functions. Discret. Appl. Math. Alpár Jüttner, Csaba Király, Lydia Mirabel Mendoza-Cadena, Gyula Pap, Ildikó Schlotter, Yutaro Yamaguchi
2023	J	`jnl`	Arborescences, Colorful Forests, and Popularity. CoRR Telikepalli Kavitha, Kazuhisa Makino, Ildikó Schlotter, Yu Yokoi
2023	J	`jnl`	Complexity of stability in trading networks. Int. J. Game Theory Tamás Fleiner, Zsuzsanna Jankó, Ildikó Schlotter, Alexander Teytelboym
2023	B	`conf`	Recognizing When a Preference System is Close to Admitting a Master List. WALCOM Ildikó Schlotter
2023	J	`jnl`	Shortest Odd Paths in Undirected Graphs with Conservative Weight Functions. CoRR Alpár Jüttner, Csaba Király, Lydia Mirabel Mendoza-Cadena, Gyula Pap, Ildikó Schlotter, Yutaro Yamaguchi
2023	J	`jnl`	Shortest two disjoint paths in conservative graphs. CoRR Ildikó Schlotter
2022	J	`jnl`	Maximum-utility popular matchings with bounded instability. CoRR Ildikó Schlotter, Ágnes Cseh
2022	J	`jnl`	Popular branchings and their dual certificates. Math. Program. Telikepalli Kavitha, Tamás Király, Jannik Matuschke, Ildikó Schlotter, Ulrike Schmidt-Kraepelin
2022	J	`jnl`	Recognizing when a preference system is close to admitting a master list. CoRR Ildikó Schlotter
2022	J	`jnl`	Shortest Odd Paths in Conservative Graphs: Connections and Complexity. CoRR Ildikó Schlotter, András Sebö
2022	A*	`conf`	The popular assignment problem: when cardinality is more important than popularity. SODA Telikepalli Kavitha, Tamás Király, Jannik Matuschke, Ildikó Schlotter, Ulrike Schmidt-Kraepelin
2021	J	`jnl`	Obtaining a Proportional Allocation by Deleting Items. Algorithmica Britta Dorn, Ronald de Haan, Ildikó Schlotter
2021	—	`conf`	The Core of Housing Markets from an Agent's Perspective: Is It Worth Sprucing Up Your Home? WINE Ildikó Schlotter, Péter Biró, Tamás Fleiner
2021	J	`jnl`	The core of housing markets from an agent's perspective: Is it worth sprucing up your home? CoRR Ildikó Schlotter, Péter Biró, Tamás Fleiner
2021	J	`jnl`	The popular assignment problem: when cardinality is more important than popularity. CoRR Telikepalli Kavitha, Tamás Király, Jannik Matuschke, Ildikó Schlotter, Ulrike Schmidt-Kraepelin
2020	B	`conf`	Popular Branchings and Their Dual Certificates. IPCO Telikepalli Kavitha, Tamás Király, Jannik Matuschke, Ildikó Schlotter, Ulrike Schmidt-Kraepelin
2020	J	`jnl`	Stable Matchings with Covering Constraints: A Complete Computational Trichotomy. Algorithmica Matthias Mnich, Ildikó Schlotter
2019	J	`jnl`	Popular Branchings and Their Dual Certificates. CoRR Telikepalli Kavitha, Tamás Király, Jannik Matuschke, Ildikó Schlotter, Ulrike Schmidt-Kraepelin
2018	J	`jnl`	A Connection Between Sports and Matroids: How Many Teams Can We Beat? Algorithmica Ildikó Schlotter, Katarína Cechlárová
2018	J	`jnl`	Complexity of Stability in Trading Networks. CoRR Tamás Fleiner, Zsuzsanna Jankó, Ildikó Schlotter, Alexander Teytelboym
2018	J	`jnl`	Correction to: A Connection Between Sports and Matroids: How Many Teams Can We Beat? Algorithmica Ildikó Schlotter, Katarína Cechlárová
2017	J	`jnl`	Campaign Management Under Approval-Driven Voting Rules. Algorithmica Ildikó Schlotter, Piotr Faliszewski, Edith Elkind
2017	—	`conf`	Obtaining a Proportional Allocation by Deleting Items. ADT Britta Dorn, Ronald de Haan, Ildikó Schlotter
2017	J	`jnl`	Obtaining a Proportional Allocation by Deleting Items. CoRR Britta Dorn, Ronald de Haan, Ildikó Schlotter
2017	—	`conf`	Possible and Necessary Allocations Under Serial Dictatorship with Incomplete Preference Lists. ADT Katarína Cechlárová, Tamás Fleiner, Ildikó Schlotter
2017	B	`conf`	Stable Marriage with Covering Constraints-A Complete Computational Trichotomy. SAGT Matthias Mnich, Ildikó Schlotter
2016	A*	`conf`	Control of Fair Division. IJCAI Haris Aziz, Ildikó Schlotter, Toby Walsh
2016	J	`jnl`	Refining the complexity of the sports elimination problem. Discret. Appl. Math. Katarína Cechlárová, Eva Potpinková, Ildikó Schlotter
2016	J	`jnl`	Stable Marriage with Covering Constraints: A Complete Computational Trichotomy. CoRR Matthias Mnich, Ildikó Schlotter
2015	J	`jnl`	Campaign Management under Approval-Driven Voting Rules. CoRR Ildikó Schlotter, Piotr Faliszewski, Edith Elkind
2015	J	`jnl`	Parameterized complexity of spare capacity allocation and the multicost Steiner subgraph problem. J. Discrete Algorithms Tibor Jordán, Ildikó Schlotter
2014	J	`jnl`	Parameterized Complexity of Eulerian Deletion Problems. Algorithmica Marek Cygan, Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk, Ildikó Schlotter
2013	J	`jnl`	Bin packing with fixed number of bins revisited. J. Comput. Syst. Sci. Klaus Jansen, Stefan Kratsch, Dániel Marx, Ildikó Schlotter
2013	J	`jnl`	Cleaning Interval Graphs. Algorithmica Dániel Marx, Ildikó Schlotter
2012	J	`jnl`	Multivariate Complexity Analysis of Swap Bribery. Algorithmica Britta Dorn, Ildikó Schlotter
2012	J	`jnl`	Obtaining a Planar Graph by Vertex Deletion. Algorithmica Dániel Marx, Ildikó Schlotter
2011	A*	`conf`	Campaign Management under Approval-Driven Voting Rules. AAAI Ildikó Schlotter, Piotr Faliszewski, Edith Elkind
2011	B	`conf`	Parameterized Complexity of Eulerian Deletion Problems. WG Marek Cygan, Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk, Ildikó Schlotter
2011	J	`jnl`	Stable assignment with couples: Parameterized complexity and local search. Discret. Optim. Dániel Marx, Ildikó Schlotter
2011	J	`jnl`	Stable matching with couples: An empirical study. ACM J. Exp. Algorithmics Péter Biró, Robert W. Irving, Ildikó Schlotter
2010	—	`conf`	Bin Packing with Fixed Number of Bins Revisited. SWAT Klaus Jansen, Stefan Kratsch, Dániel Marx, Ildikó Schlotter
2010	J	`jnl`	Cleaning Interval Graphs CoRR Dániel Marx, Ildikó Schlotter
2010	B	`conf`	Computing the Deficiency of Housing Markets with Duplicate Houses. IPEC Katarína Cechlárová, Ildikó Schlotter
2010	J	`jnl`	Multivariate Analyis of Swap Bribery CoRR Britta Dorn, Ildikó Schlotter
2010	B	`conf`	Multivariate Complexity Analysis of Swap Bribery. IPEC Britta Dorn, Ildikó Schlotter
2010	J	`jnl`	Parameterized Complexity and Local Search Approaches for the Stable Marriage Problem with Ties. Algorithmica Dániel Marx, Ildikó Schlotter
2010	—	`—`	Parameterized Complexity of Graph Modification and Stable Matching Problems Ildikó Schlotter
2010	B	`conf`	Parameterized Complexity of the Arc-Preserving Subsequence Problem. WG Dániel Marx, Ildikó Schlotter
2009	J	`jnl`	Parameterized graph cleaning problems. Discret. Appl. Math. Dániel Marx, Ildikó Schlotter
2009	—	`conf`	Stable Assignment with Couples: Parameterized Complexity and Local Search. IWPEC Dániel Marx, Ildikó Schlotter
2008	J	`jnl`	Obtaining a Planar Graph by Vertex Deletion CoRR Dániel Marx, Ildikó Schlotter
2008	B	`conf`	Parameterized Graph Cleaning Problems. WG Dániel Marx, Ildikó Schlotter
2007	B	`conf`	Obtaining a Planar Graph by Vertex Deletion. WG Dániel Marx, Ildikó Schlotter