Author:
Zaragoza Martínez Francisco Javier
Funder
Deutsche Akademische Austauschdienst (DAAD), Germany
Subject
Applied Mathematics,Industrial and Manufacturing Engineering,Management Science and Operations Research,Software
Reference22 articles.
1. Linear time algorithms for NP-hard problems restricted to partial k-trees;Arnborg;Discrete Appl. Math.,1989
2. Chapter 2: The complexity of arc routing problems;van Bevern,2014
3. A partial k-arboretum of graphs with bounded treewidth;Bodlaender;Theoret. Comput. Sci.,1998
4. Discovering treewidth;Bodlaender,2005
5. Matching, Euler tours and the Chinese postman;Edmonds;Math. Program.,1973