1. [1] P. Berman, M. Karpinski, and A.D. Scott, “Approximation hardness of short symmetric instances of max-3sat,” Technical Report, 2004.
2. [2] V. Borbel'ová and K. Cechlárová, “On the stable b-matching problem in multigraphs,” Discrete Applied Mathematics, vol.156, no.5, pp.673-684, 2008.
3. [3] K. Cechlárová and T. Fleiner, “On a generalization of the stable roommates problem,” ACM Trans. Algorithms (TALG), vol.1, no.1, pp.143-156, 2005. 10.1145/1077464.1077474
4. [4] K. Cechlárová and T. Fleiner, “Stable roommates with free edges,” Technical Report, 2009-01, Egerváry Research Group on Combinatorial Optimization, Budapest, 2009.
5. [5] K. Cechlárová and V. Val'ová, “The stable multiple activities problem,” 2005. IM preprint, Series A, no.1/2005.