The following pages link to Ildikó Schlotter (Q456690):
Displaying 38 items.
- Stable assignment with couples: parameterized complexity and local search (Q456691) (← links)
- (Q513293) (redirect page) (← links)
- Campaign management under approval-driven voting rules (Q513294) (← links)
- Stable marriage with covering constraints -- a complete computational trichotomy (Q681890) (← links)
- Refining the complexity of the sports elimination problem (Q896666) (← links)
- Parameterized graph cleaning problems (Q967382) (← links)
- A connection between sports and matroids: how many teams can we beat? (Q1702129) (← links)
- Correction to: ``A connection between sports and matroids: how many teams can we beat?'' (Q1755751) (← links)
- Multivariate complexity analysis of Swap Bribery (Q1759677) (← links)
- Bin packing with fixed number of bins revisited (Q1936245) (← links)
- Cleaning interval graphs (Q1939654) (← links)
- Parameterized complexity and local search approaches for the stable marriage problem with ties (Q1959726) (← links)
- Possible and necessary allocations under serial dictatorship with incomplete preference lists (Q1990312) (← links)
- Popular branchings and their dual certificates (Q2118146) (← links)
- The core of housing markets from an agent's perspective: Is it worth sprucing up your home? (Q2152118) (← links)
- Parameterized complexity of spare capacity allocation and the multicost Steiner subgraph problem (Q2253903) (← links)
- Stable matchings with covering constraints: a complete computational trichotomy (Q2309466) (← links)
- Obtaining a planar graph by vertex deletion (Q2429328) (← links)
- Parameterized complexity of Eulerian deletion problems (Q2441593) (← links)
- Parameterized Complexity of the Arc-Preserving Subsequence Problem (Q3057629) (← links)
- Computing the Deficiency of Housing Markets with Duplicate Houses (Q3058693) (← links)
- Multivariate Complexity Analysis of Swap Bribery (Q3058696) (← links)
- Parameterized Complexity of Eulerian Deletion Problems (Q3104771) (← links)
- Obtaining a Planar Graph by Vertex Deletion (Q3508576) (← links)
- Bin Packing with Fixed Number of Bins Revisited (Q3569896) (← links)
- Stable Assignment with Couples: Parameterized Complexity and Local Search (Q3656871) (← links)
- Popular Branchings and Their Dual Certificates (Q5041748) (← links)
- Parameterized Graph Cleaning Problems (Q5302063) (← links)
- Stable matching with couples (Q5406236) (← links)
- Obtaining a proportional allocation by deleting items (Q5918125) (← links)
- Obtaining a proportional allocation by deleting items (Q5925523) (← links)
- Complexity of stability in trading networks (Q6052977) (← links)
- Recognizing when a preference system is close to admitting a master list (Q6091175) (← links)
- Recognizing when a preference system is close to admitting a master list (Q6124592) (← links)
- Computational complexity of necessary envy-freeness (Q6125946) (← links)
- The popular assignment problem: when cardinality is more important than popularity (Q6575076) (← links)
- Shortest odd paths in undirected graphs with conservative weight functions (Q6611004) (← links)
- Arborescences, colorful forests, and popularity (Q6645497) (← links)
