3 citations · 6 across the 18 of their papers we have counts for
Showing 2025Show all
2 papers · 1 filter
cs.GT2025
Near-Feasible Solutions to Complex Stable Matching Problems
Gergely Csáji
In this paper, we demonstrate that in many NP-complete variants of the stable matching problem, such as the Stable Hypergraph Matching problem, the Stable Multicommodity Flow probl…
cs.GT2025
Stable Hypergraph Matching in Unimodular Hypergraphs
Péter Biró, Gergely Csáji, Ildikó Schlotter
We study the NP-hard Stable Hypergraph Matching (SHM) problem and its generalization allowing capacities, the Stable Hypergraph -Matching (SHM) problem, and investigate their…