Ildikó Schlotter

Available identifiers

zbMath Open schlotter.ildikoMaRDI QIDQ456690

List of research outcomes

Publication	Date of Publication	Type
Arborescences, colorful forests, and popularity	2024-11-28	Paper
Shortest odd paths in undirected graphs with conservative weight functions	2024-09-26	Paper
The popular assignment problem: when cardinality is more important than popularity	2024-07-19	Paper
Computational complexity of necessary envy-freeness	2024-04-09	Paper
Recognizing when a preference system is close to admitting a master list	2024-03-28	Paper
Recognizing when a preference system is close to admitting a master list	2023-11-24	Paper
Complexity of stability in trading networks	2023-09-25	Paper
Odd Paths, Cycles and $T$-joins: Connections and Algorithms	2022-11-23	Paper
Popular Branchings and Their Dual Certificates	2022-10-14	Paper
The core of housing markets from an agent's perspective: Is it worth sprucing up your home?	2022-07-06	Paper
Popular branchings and their dual certificates	2022-03-22	Paper
Obtaining a proportional allocation by deleting items	2021-04-19	Paper
Stable matchings with covering constraints: a complete computational trichotomy	2020-04-01	Paper
Correction to: ``A connection between sports and matroids: how many teams can we beat?	2019-01-11	Paper
Possible and necessary allocations under serial dictatorship with incomplete preference lists	2018-10-25	Paper
Obtaining a proportional allocation by deleting items	2018-10-25	Paper
A connection between sports and matroids: how many teams can we beat?	2018-02-28	Paper
Stable marriage with covering constraints -- a complete computational trichotomy	2018-02-13	Paper
Campaign management under approval-driven voting rules	2017-03-06	Paper
Refining the complexity of the sports elimination problem	2015-12-10	Paper
Parameterized complexity of spare capacity allocation and the multicost Steiner subgraph problem	2015-02-13	Paper
Stable matching with couples	2014-04-01	Paper
Parameterized complexity of Eulerian deletion problems	2014-03-25	Paper
Cleaning interval graphs	2013-03-05	Paper
Bin packing with fixed number of bins revisited	2013-02-21	Paper
Multivariate complexity analysis of Swap Bribery	2012-11-21	Paper
Stable assignment with couples: parameterized complexity and local search	2012-10-16	Paper
Obtaining a planar graph by vertex deletion	2012-04-26	Paper
Parameterized Complexity of Eulerian Deletion Problems	2011-12-16	Paper
Computing the Deficiency of Housing Markets with Duplicate Houses	2010-12-07	Paper
Multivariate Complexity Analysis of Swap Bribery	2010-12-07	Paper
Parameterized Complexity of the Arc-Preserving Subsequence Problem	2010-11-16	Paper
Parameterized complexity and local search approaches for the stable marriage problem with ties	2010-10-07	Paper
Bin Packing with Fixed Number of Bins Revisited	2010-06-22	Paper
Parameterized graph cleaning problems	2010-04-28	Paper
Stable Assignment with Couples: Parameterized Complexity and Local Search	2010-01-14	Paper
Parameterized Graph Cleaning Problems	2009-01-20	Paper
Obtaining a Planar Graph by Vertex Deletion	2008-07-01	Paper

Research outcomes over time

This page was built for person: Ildikó Schlotter