@Article{bird,
  author = 	 {Bird, C.G.},
  title = 	 {On cost allocation for a spanning tree: a game theoretic approach},
  journal = 	 {Networks},
  year = 	 {1976},
  OPTkey = 	 {},
  volume = 	 {6},
  OPTnumber = 	 {},
  pages = 	 {335--350},
  OPTmonth = 	 {},
  OPTnote = 	 {},
  OPTannote = 	 {}
}




@Unpublished{Darmann,
  author = 	 {Darmann, A., and Klamler, C., and Pferschy, U.},
  title = 	 {Maximizing the Miniumum Voter Satisfaction on Spanning Trees},
  note = 	 {To appear in: Mathematical Social Sciences, doi:10.1016/j.mathsocsci.2009.05.002},
  OPTkey = 	 {},
  OPTmonth = 	 {},
  year = 	 {2009},
  OPTannote = 	 {}
}

@Unpublished{moulin,
  author = 	 {Bogomolnaia, A., and Moulin, H.},
  title = 	 {Sharing the cost of a minimal cost spanning tree: beyond the Folk solution},
  note = 	 {Mimeo, Rice University},
  OPTkey = 	 {},
  OPTmonth = 	 {},
  year = 	 {2008},
  OPTannote = 	 {}
}



@Article{dutta,
  author = 	 {Dutta, B. and A. Kar},
  title = 	 {Cost monotonicity, consistency and minimum cost spanning tree games},
  journal = 	 {Games and Economic Behavior},
  year = 	 {2004},
  OPTkey = 	 {},
  volume = 	 {48},
  OPTnumber = 	 {},
  pages = 	 {223--248},
  OPTmonth = 	 {},
  OPTnote = 	 {},
  OPTannote = 	 {}
}



@Article{kar,
  author = 	 {Kar, A.},
  title = 	 {Axiomatization of the Shapley value on minimum cost spanning tree games},
  journal = 	 {Games and Economic Behavior},
  year = 	 {2002},
  OPTkey = 	 {},
  Ovolume = 	 {38},
  OPTnumber = 	 {},
  pages = 	 {265--277},
  OPTmonth = 	 {},
  OPTnote = 	 {},
  OPTannote = 	 {}
}



@book{gj79, author = {Garey, M. R. and Johnson, D. S. }, publisher = {W. H. Freeman \& Co.}, title = {Computers and Intractability: A Guide to the Theory of NP-Completeness}, year = {1979} }

@Article{edmonds, author = {Edmonds, J.}, title = {Matroid intersection}, journal = {Annals of Discrete Mathematics}, year = {1979}, OPTkey = {}, volume = {4}, OPTnumber = {}, pages = {39-49}, OPTmonth = {}, OPTnote = {}, OPTannote = {} } 

@Book{schr03, author = {Schrijver, A.}, ALTeditor = {}, title = {Combinatorial Optimization, Polyhedra and efficiency}, publisher = {Springer}, year = {2003}, volume = {B}, OPTnumber = {}, OPTseries = {Combinatorial Optimization}, OPTaddress = {}, OPTedition = {}, OPTmonth = {}, OPTnote = {}, OPTannote = {} } 

@Book{Ahuja, author = {Ahuja, {R.K.} and Magnanti, {T.L.} and Orlin, {J.B.}}, ALTeditor = {}, title = {Network flows: theory, algorithms, and applications}, publisher = {Prentice Hall}, year = {1993}, OPTkey = {}, OPTvolume = {}, OPTnumber = {}, OPTseries = {}, OPTaddress = {}, OPTedition = {}, OPTmonth = {}, OPTnote = {}, OPTannote = {} }

@Misc{pfsch08,
  OPTkey = 	 {},
  author = 	 {Pferschy, U. and Schauer, J.},
  title = 	 {The Knapsack Problem with Conflict Graphs},
 howpublished={Optimization Online 2008-10-2128},
  year = 	 {2008},
%  howpublished = 
%{http://www.optimization-online.org/DBHTML/2008/10/2128.html},
  OPTmonth = 	 {},
%  note = 	 {online available preprint version},
  OPTannote = 	 {}
}

@inproceedings{boja95,
 author = {Bodlaender, H. L.  and K. Jansen},
 title = {On the Complexity of Scheduling Incompatible Jobs with Unit-Times},
 booktitle = {MFCS '93: Proceedings of the 18th International Symposium on Mathematical Foundations of Computer Science},
 year = {1993},
 isbn = {3-540-57182-5},
 pages = {291--300},
 publisher = {Springer},
 address = {London, UK},
 }

@inproceedings{jan99,
 author = {Jansen, K.},
 title = {An Approximation Scheme for Bin Packing with Conflicts},
 booktitle = {SWAT '98: Proceedings of the 6th Scandinavian Workshop on Algorithm Theory},
 year = {1998},
 isbn = {3-540-64682-5},
 pages = {35--46},
 publisher = {Springer},
 address = {London, UK},
 }

@article{jaoe97,
 author = {Jansen, K. and S. \"{O}hring},
 title = {Approximation algorithms for time constrained scheduling},
 journal = {Information and Copmutation},
 volume = {132},
 number = {2},
 year = {1997},
 issn = {0890-5401},
 pages = {85--108},
 doi = {http://dx.doi.org/10.1006/inco.1996.2616},
 publisher = {Academic Press, Inc.},
 address = {Duluth, MN, USA},
 }