1. A graph-theoretic game and its applications to the k-server problem;Alon;SIAM Journal on Computing,1995
2. Edge-swapping algorithms for the minimum fundamental cycle basis problem;Amaldi;Mathematical Methods of Operations Research,2009
3. On the cycle polytope of a binary matroid;Barahona;Journal of Combinatorial Theory B,1986
4. F. Bunke, Circuit bases problems in binary matroids, Ph.D. Thesis, Department of Mathematics, University of Kaiserslautern, 2006
5. F. Bunke, H.W. Hamacher, F. Maffioli, A.M. Schwahn, Minimum cut bases in undirected networks, Report in Wirtschaftsmathematik 108, University of Kaiserslautern, 2007. http://kluedo.ub.uni-kl.de/volltexte/2007/2087/