The complexity of the proper orientation number. Information Processing Letters, vol.113, p.799803, 2013. ,
On variations of the subset sum problem, Discrete Applied Mathematics, vol.81, issue.1, p.17, 1998. ,
Ruling out FPT algorithms for Weighted Coloring on forests, Theoretical Computer Science, 2018. ,
On the proper orientation number of bipartite graphs, Theoretical Computer Science, vol.566, p.5975, 2015. ,
Proper orientation of cacti, Theoretical Computer Science, vol.639, p.1425, 2016. ,
Weighted Coloring in Trees, SIAM Journal on Discrete Mathematics, vol.28, issue.4, p.20292041, 2014. ,
Graph classes and the complexity of the graph orientation minimizing the maximum weighted outdegree, Discrete Applied Mathematics, vol.159, issue.7, p.498508, 2011. ,
A c k n 5-approximation algorithm for treewidth, SIAM Journal on Computing, vol.45, issue.2, p.317378, 2016. ,
, Graph Theory, 2008.
, Parameterized Algorithms, 2015.
Fundamentals of Parameterized Complexity. Texts in Computer Science, 2013. ,
Computers and Intractability, 1979. ,
Which problems have strongly exponential complexity?, Journal of Computer and System Sciences, vol.63, issue.4, p.512530, 2001. ,
Reducibility among combinatorial problems, Proceedings of a symposium on the Complexity of Computer Computations, IBM Thomas J, p.85103, 1972. ,
,
, Computations and Approximations, vol.842
, , 1994.
Proper orientations of planar bipartite graphs, Graphs and Combinatorics, vol.33, issue.5, p.11891194, 2017. ,
Graph minors. III. Planar tree-width, Journal of Combinatorial Theory, Series B, vol.36, issue.1, p.4964, 1984. ,
Monadic second order logic on graphs with local cardinality constraints, ACM Transactions on Computational Logic, vol.12, issue.2, 2011. ,
Not So Easy Problems for Tree Decomposable Graphs ,
, , 2011.