Search Results - "Schlotter, Ildikó"

Recognizing when a preference system is close to admitting a master list by Schlotter, Ildikó

“…A preference system I is an undirected graph where vertices have preferences over their neighbors, and I admits a master list if all preferences can be derived…”
Get full text

Stable Matchings with Covering Constraints: A Complete Computational Trichotomy by Mnich, Matthias, Schlotter, Ildikó

“…Stable matching problems with lower quotas are fundamental in academic hiring and ensuring operability of rural hospitals. Only few tractable (polynomial-time…”
Get full text

Parameterized complexity of candidate nomination for elections based on positional scoring rules by Schlotter, Ildikó, Cechlárová, Katarína, Trellová, Diana

“…Consider elections where the set of candidates is partitioned into parties, and each party must nominate exactly one candidate. The P ossible P resident…”
Get full text

Multivariate Complexity Analysis of Swap Bribery by Dorn, Britta, Schlotter, Ildikó

“…We consider the computational complexity of a problem modeling bribery in the context of voting systems. In the scenario of Swap Bribery , each voter assigns a…”
Get full text

Bin packing with fixed number of bins revisited by Jansen, Klaus, Kratsch, Stefan, Marx, Dániel, Schlotter, Ildikó

“…As Bin Packing is NP-hard already for k=2 bins, it is unlikely to be solvable in polynomial time even if the number of bins is a fixed constant. However, if…”
Get full text

Popular branchings and their dual certificates by Kavitha, Telikepalli, Király, Tamás, Matuschke, Jannik, Schlotter, Ildikó, Schmidt-Kraepelin, Ulrike

“…Let G be a digraph where every node has preferences over its incoming edges. The preferences of a node extend naturally to preferences over branchings , i.e.,…”
Get full text

Computational complexity of necessary envy-freeness by Aziz, Haris, Schlotter, Ildikó, Walsh, Toby

Get full text

Obtaining a Proportional Allocation by Deleting Items by Dorn, Britta, de Haan, Ronald, Schlotter, Ildikó

“…We consider the following control problem on fair allocation of indivisible goods. Given a set I of items and a set of agents, each having strict linear…”
Get full text

Shortest odd paths in undirected graphs with conservative weight functions by Jüttner, Alpár, Király, Csaba, Mendoza-Cadena, Lydia Mirabel, Pap, Gyula, Schlotter, Ildikó, Yamaguchi, Yutaro

“…We consider the Shortest Odd Path problem, where given an undirected graph G, a weight function on its edges, and two vertices s and t in G, the aim is to find…”
Get full text

Complexity of stability in trading networks by Fleiner, Tamás, Jankó, Zsuzsanna, Schlotter, Ildikó, Teytelboym, Alexander

“…Efficient computability is an important property of solution concepts. We consider the computational complexity of finding and verifying various solution…”
Get full text

Obtaining a Planar Graph by Vertex Deletion by Marx, Dániel, Schlotter, Ildikó

“…In the  k - Apex problem the task is to find at most  k vertices whose deletion makes the given graph planar. The graphs for which there exists a solution form…”
Get full text

A Connection Between Sports and Matroids: How Many Teams Can We Beat? by Schlotter, Ildikó, Cechlárová, Katarína

“…Given an on-going sports competition, with each team having a current score and some matches left to be played, we ask whether it is possible for our…”
Get full text

Parameterized Complexity of Eulerian Deletion Problems by Cygan, Marek, Marx, Dániel, Pilipczuk, Marcin, Pilipczuk, Michał, Schlotter, Ildikó

“…We study a family of problems where the goal is to make a graph Eulerian, i.e., connected and with all the vertices having even degrees, by a minimum number of…”
Get full text

Parameterized Complexity and Local Search Approaches for the Stable Marriage Problem with Ties by Marx, Dániel, Schlotter, Ildikó

“…We consider the variant of the classical Stable Marriage problem where preference lists can be incomplete and may contain ties. In such a setting, finding a…”
Get full text

Stable assignment with couples: Parameterized complexity and local search by Marx, Dániel, Schlotter, Ildikó

“…We study the Hospitals/Residents with Couples problem, a variant of the classical Stable Marriage problem. This is the extension of the Hospitals/Residents…”
Get full text

Correction to: A Connection Between Sports and Matroids: How Many Teams Can We Beat? by Schlotter, Ildikó, Cechlárová, Katarína

“…The authors regret the following error in their article “A connection between sports and matroids: How many teams can we beat?” (Algorithmica, doi:…”
Get full text

Refining the complexity of the sports elimination problem by Cechlárová, Katarína, Potpinková, Eva, Schlotter, Ildikó

“…The sports elimination problem asks whether a team participating in a competition still has a chance to win, given the current standings and the remaining…”
Get full text

Cleaning Interval Graphs by Marx, Dániel, Schlotter, Ildikó

“…We investigate a special case of the Induced Subgraph Isomorphism problem, where both input graphs are interval graphs. We show the NP-hardness of this…”
Get full text

Parameterized complexity of spare capacity allocation and the multicost Steiner subgraph problem by Jordán, Tibor, Schlotter, Ildikó

“…We study the computational complexity of the Spare Capacity Allocation problem arising in optical networks that use a shared mesh restoration scheme. In this…”
Get full text

Shortest two disjoint paths in conservative graphs by Schlotter, Ildikó

“…We consider the following problem that we call the Shortest Two Disjoint Paths problem: given an undirected graph $G=(V,E)$ with edge weights $w:E \rightarrow…”
Get full text