4 citations · 6 across the 5 of their papers we have counts for
5 papers
On the Complexity of Nucleolus Computation for Bipartite b-Matching Games
Jochen Koenemann, Justin Toth, Felix Zhou
We explore the complexity of nucleolus computation in b-matching games on bipartite graphs. We show that computing the nucleolus of a simple b-matching game is NP-hard even on bipa…
A General Framework for Computing the Nucleolus Via Dynamic Programming
Jochen Koenemann, Justin Toth
This paper defines a general class of cooperative games for which the nucleolus is efficiently computable. This class includes new members for which the complexity of computing the…
Optimized Cranial Bandeau Remodeling
James Drake, Marina Drygala, Ricardo Fukasawa +9
Craniosynostosis, a condition affecting 1 in 2000 infants, is caused by premature fusing of cranial vault sutures, and manifests itself in abnormal skull growth patterns. Left untr…
Computing the Nucleolus of Weighted Cooperative Matching Games in Polynomial Time
Jochen Koenemann, Kanstantsin Pashkovich, Justin Toth
We provide an efficient algorithm for computing the nucleolus for an instance of a weighted cooperative matching game. This resolves a long-standing open question posed in [Faigle,…
An Elementary Integrality Proof of Rothblum's Stable Matching Formulation
Jochen Könemann, Kanstantsin Pashkovich, Justin Toth
In this paper we provide a short new proof for the integrality of Rothblum's linear description of the convex hull of incidence vectors of stable matchings in bipartite graphs. In…