References

1. Umberto Bertelè & Francesco Brioschi (1973): On non-serial dynamic programming. Journal of Combinatorial Theory, Series A 14(2), pp. 137148, doi:10.1016/0097-3165(73)90016-2.
2. Hans L. Bodlaender, Ton Kloks, Richard B. Tan & Jan van Leeuwen (2004): Approximations for lambda-Colorings of Graphs. Comput. J. 47(2), pp. 193–204, doi:10.1093/comjnl/47.2.193.
3. J.A. Bondy & V. Chvatal (1976): A method in graph theory. Discrete Mathematics 15(2), pp. 111 – 135, doi:10.1016/0012-365X(76)90078-9.
4. Bruno Courcelle (1990): The Monadic Second-Order Logic of Graphs. I. Recognizable Sets of Finite Graphs. Inf. Comput. 85(1), pp. 12–75, doi:10.1016/0890-5401(90)90043-H.
5. Reinhard Diestel (2010): Graph Theory. Springer Berlin Heidelberg, doi:10.1007/978-3-642-14279-6.
6. Jakub Gajarský, Michael Lampis & Sebastian Ordyniak (2013): Parameterized Algorithms for Modular-Width. In: Parameterized and Exact Computation - 8th International Symposium, IPEC 2013, Sophia Antipolis, France, September 4-6, 2013, Revised Selected Papers, pp. 163–176, doi:10.1007/978-3-319-03898-8_15.
7. Ton Kloks (1994): Treewidth, Computations and Approximations. Lecture Notes in Computer Science 842. Springer, doi:10.1007/BFb0045375.
8. Michael Lampis (2012): Algorithmic Meta-theorems for Restrictions of Treewidth. Algorithmica 64(1), pp. 19–37, doi:10.1007/s00453-011-9554-x.
9. Jaroslav Nesetril & Patrice Ossona de Mendez (2012): Sparsity - Graphs, Structures, and Algorithms. Algorithms and combinatorics 28. Springer, doi:10.1007/978-3-642-27875-4.

Comments and questions to: eptcs@eptcs.org

For website issues: webmaster@eptcs.org