3 papers
cs.DS2020
A simple combinatorial algorithm for restricted 2-matchings in subcubic graphs -- via half-edges
Katarzyna Paluch, Mateusz Wasylkiewicz
We consider three variants of the problem of finding a maximum weight restricted -matching in a subcubic graph . (A -matching is any subset of the edges such that each ver…
cs.DS2015
Characterisation of Strongly Stable Matchings
Pratik Ghosal, Adam Kunysz, Katarzyna Paluch
An instance of a strongly stable matching problem (SSMP) is an undirected bipartite graph , with an adjacency list of each vertex being a linearly ordered list of…
cs.DS2010
Popular b-matchings
Katarzyna Paluch
Suppose that each member of a set of agents has a preference list of a subset of houses, possibly involving ties and each agent and house has their capacity denoting the maximum nu…