Author of the publication

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Tight lower bounds for the complexity of multicoloring., , , , and . CoRR, (2016)Fully polynomial-time parameterized computations for graphs and matrices of low treewidth., , , , and . CoRR, (2015)PTAS for Sparse General-Valued CSPs., , and . CoRR, (2020)Fully polynomial-time parameterized computations for graphs and matrices of low treewidth., , , , and . SODA, page 1419-1432. SIAM, (2017)Improved hardness for H-colourings of G-colourable graphs., and . SODA, page 1426-1435. SIAM, (2020)On inverse powers of graphs and topological implications of Hedetniemi's conjecture.. J. Comb. Theory, Ser. B, (2019)Tight Complexity Lower Bounds for Integer Linear Programming with Few Constraints., , and . STACS, volume 126 of LIPIcs, page 44:1-44:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)PACE Solver Description: Sallow: A Heuristic Algorithm for Treedepth Decompositions.. IPEC, volume 180 of LIPIcs, page 36:1-36:4. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Reconfiguration over Tree Decompositions., , , and . IPEC, volume 8894 of Lecture Notes in Computer Science, page 246-257. Springer, (2014)Cutwidth: Obstructions and Algorithmic Aspects., , , , and . Algorithmica, 81 (2): 557-588 (2019)