1. Adhar, G.S., Peng, S.: Parallel algorithms for finding connected, independent and total domination in interval graphs. Algorithms and Parallel VLSI Architectures, II (Château de Bonas, 1991), pp. 85–90. Elsevier, Amsterdam (1992)
2. Alber, J., Bodlaender, H.L., Fernau, F., Niedermeier, R.: Fixed parameter algorithms for planar dominating set and related problems. In: Algorithm theory of Scandinavian Workshop on Algorithm Theory 2000 (Bergen, 2000), pp. 97–110. Springer, Berlin (2000)
3. Alon, N.: Transversal number of uniform hypergraphs. Graphs Combin. 6, 1–4 (1990)
4. Alon, N., Bregman, Z.: Every 8-uniform 8-regular hypergraph is 2-colorable. Graphs Combin. 4, 303–306 (1988)
5. Alon, N., Gutner, S.: Linear time algorithms for finding a dominating set of fixed size in degenerated graphs. Algorithmica 54(4), 544–556 (2009)