1. Abu-Khzam FN, Collins RL, Fellows MR, Langston MA, Suters WH, Symons CT (2004) Kernelization algorithms for the vertex cover problem: Theory and experiments. In: Proceedings of the 6th workshop on algorithm engineering and experiments (ALENEX ’04). SIAM, pp 62–69
2. Abu-Khzam FN, Fellows MR, Langston MA, Suters WH (2007) Crown structures for vertex cover kernelization. Theory Comput Syst 41(3):411–430
3. Agarwal A, Charikar M, Makarychev K, Makarychev Y (2005) $O(\sqrt{\log n})$ approximation algorithms for min UnCut, min 2CNF deletion, and directed cut problems. In: Proceedings of the 37th ACM symposium on theory of computing (STOC ’05). ACM, pp 573–581
4. Antal T, Krapivsky PL, Redner S (2006) Social balance on networks: The dynamics of friendship and enmity. Physica D: Nonlinear Phenom 224(1–2):130–136
5. Avidor A, Langberg M (2007) The multi-multiway cut problem. Theor Comput Sci 377(1–3):35–42