1 citations · 1 across the 2 of their papers we have counts for
4 papers
Maximum-utility popular matchings with bounded instability
Ildikó Schlotter, Ágnes Cseh
In a graph where vertices have preferences over their neighbors, a matching is called popular if it does not lose a head-to-head election against any other matching when the vertic…
Popular Branchings and Their Dual Certificates
Telikepalli Kavitha, Tamás Király, Jannik Matuschke +2
Let 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., directed forests; a…
Obtaining a Proportional Allocation by Deleting Items
Britta Dorn, Ronald de Haan, Ildikó Schlotter
We consider the following control problem on fair allocation of indivisible goods. Given a set of items and a set of agents, each having strict linear preference over the items…
Obtaining a Planar Graph by Vertex Deletion
Dániel Marx, Ildikó Schlotter
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 a minor closed class of…