The following publications are possibly variants of this publication:
- On the Complexity of Testing Membership in the Core of min-Cost Spanning Tree GamesUlrich Faigle, Sándor P. Fekete, Winfried Hochstättler, Walter Kern. eccc, 2(12), 1995. [doi]
- On the complexity of testing membership in the core of min-cost spanning tree gamesUlrich Faigle, Walter Kern, Sándor P. Fekete, Winfried Hochstättler. ijgt, 26(3):361-366, 1997. [doi]
- Note Computing the nucleolus of min-cost spanning tree games is NP-hard - Computing the nucleolus of min-cost spanning tree games is NP-hardUlrich Faigle, Walter Kern, Jeroen Kuipers. ijgt, 27(3):443-450, 1998. [doi]