102 citations · 176 across the 13 of their papers we have counts for
Showing 2018Show all
2 papers · 1 filter
cs.DS2018★ 102 cited
Mathematical models for stable matching problems with ties and incomplete lists
Maxence Delorme, Sergio García, Jacek Gondzio +3
We present new integer linear programming (ILP) models for NP-hard optimisation problems in instances of the Stable Marriage problem with Ties and Incomplete lists (SMTI) and its m…
cs.DS2018
The parameterized complexity of finding a 2-sphere in a simplicial complex
Benjamin Burton, Sergio Cabello, Stefan Kratsch +1
We consider the problem of finding a subcomplex K' of a simplicial complex K such that K' is homeomorphic to the 2-dimensional sphere, S^2. We study two variants of this problem. T…