A. Ahadi and A. Dehghan, The complexity of the proper orientation number. Information Processing Letters, vol.113, p.799803, 2013.

J. R. Alfonsín, On variations of the subset sum problem, Discrete Applied Mathematics, vol.81, issue.1, p.17, 1998.

J. Araújo, J. Baste, and I. Sau, Ruling out FPT algorithms for Weighted Coloring on forests, Theoretical Computer Science, 2018.

J. Araújo, N. Cohen, S. F. De-rezende, F. Havet, and P. F. Moura, On the proper orientation number of bipartite graphs, Theoretical Computer Science, vol.566, p.5975, 2015.

J. Araújo, F. Havet, C. L. Sales, and A. Silva, Proper orientation of cacti, Theoretical Computer Science, vol.639, p.1425, 2016.

J. Araújo, N. Nisse, and S. Pérennes, Weighted Coloring in Trees, SIAM Journal on Discrete Mathematics, vol.28, issue.4, p.20292041, 2014.

Y. Asahiro, E. Miyano, and H. Ono, Graph classes and the complexity of the graph orientation minimizing the maximum weighted outdegree, Discrete Applied Mathematics, vol.159, issue.7, p.498508, 2011.

H. L. Bodlaender, P. G. Drange, M. S. Dregi, F. V. Fomin, D. Lokshtanov et al., A c k n 5-approximation algorithm for treewidth, SIAM Journal on Computing, vol.45, issue.2, p.317378, 2016.

A. Bondy and U. Murty, Graph Theory, 2008.

M. Cygan, F. V. Fomin, L. Kowalik, D. Lokshtanov, D. Marx et al., Parameterized Algorithms, 2015.

R. G. Downey and M. R. Fellows, Fundamentals of Parameterized Complexity. Texts in Computer Science, 2013.

M. R. Garey and D. S. Johnson, Computers and Intractability, 1979.

R. Impagliazzo, R. Paturi, and F. Zane, Which problems have strongly exponential complexity?, Journal of Computer and System Sciences, vol.63, issue.4, p.512530, 2001.

R. M. Karp, Reducibility among combinatorial problems, Proceedings of a symposium on the Complexity of Computer Computations, IBM Thomas J, p.85103, 1972.

T. Kloks,

. Treewidth, Computations and Approximations, vol.842

. Springer, , 1994.

F. Knox, S. G. De-la-maza, B. Mohar, C. L. Sales, and N. Matsumoto, Proper orientations of planar bipartite graphs, Graphs and Combinatorics, vol.33, issue.5, p.11891194, 2017.

N. Robertson and P. D. Seymour, Graph minors. III. Planar tree-width, Journal of Combinatorial Theory, Series B, vol.36, issue.1, p.4964, 1984.

S. Szeider, Monadic second order logic on graphs with local cardinality constraints, ACM Transactions on Computational Logic, vol.12, issue.2, 2011.

S. Szeider, Not So Easy Problems for Tree Decomposable Graphs

. Corr, , 2011.