@article{journals/eccc/ECCC-TR95-012,
  added-at = {2013-01-14T00:00:00.000+0100},
  author = {Faigle, Ulrich and Fekete, Sándor P. and Hochstättler, Winfried and Kern, Walter},
  biburl = {http://www.bibsonomy.org/bibtex/24889c7aabc2b7736c740b2bb62e2da27/dblp},
  ee = {http://eccc.hpi-web.de/eccc-reports/1995/TR95-012/index.html},
  interhash = {a83124f8d0081afc748108bd21867b46},
  intrahash = {4889c7aabc2b7736c740b2bb62e2da27},
  journal = {Electronic Colloquium on Computational Complexity (ECCC)},
  keywords = {dblp},
  number = 12,
  timestamp = {2013-01-14T00:00:00.000+0100},
  title = {On the Complexity of Testing Membership in the Core of min-Cost Spanning Tree Games},
  url = {http://dblp.uni-trier.de/db/journals/eccc/eccc2.html#ECCC-TR95-012},
  volume = 2,
  year = 1995
}