Michael R. Fellows | AC Group | TU Wienhttps://ac.tuwien.ac.at/team/michael-r.-fellows/Michael R. FellowsHugo Blox Builder (https://hugoblox.com)en-usSat, 01 Jan 2011 00:00:00 +0000https://ac.tuwien.ac.at/media/logo_hu10234977157890132473.pngMichael R. Fellowshttps://ac.tuwien.ac.at/team/michael-r.-fellows/On the complexity of some colorful problems parameterized by treewidthhttps://ac.tuwien.ac.at/publication/on-the-complexity-of-some-colorful-problems-parameterized-by-treewidth-2/Sat, 01 Jan 2011 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-the-complexity-of-some-colorful-problems-parameterized-by-treewidth-2/Clique-width is NP-completehttps://ac.tuwien.ac.at/publication/clique-width-is-np-complete/Thu, 01 Jan 2009 00:00:00 +0000https://ac.tuwien.ac.at/publication/clique-width-is-np-complete/On the Complexity of Some Colorful Problems Parameterized by Treewidthhttps://ac.tuwien.ac.at/publication/on-the-complexity-of-some-colorful-problems-parameterized-by-treewidth/Mon, 01 Jan 2007 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-the-complexity-of-some-colorful-problems-parameterized-by-treewidth/Clique-width Minimization is NP-hardhttps://ac.tuwien.ac.at/publication/clique-width-minimization-is-np-hard/Sun, 01 Jan 2006 00:00:00 +0000https://ac.tuwien.ac.at/publication/clique-width-minimization-is-np-hard/On Finding Short Resolution Refutations and Small Unsatisfiable Subsetshttps://ac.tuwien.ac.at/publication/on-finding-short-resolution-refutations-and-small-unsatisfiable-subsets-2/Sun, 01 Jan 2006 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-finding-short-resolution-refutations-and-small-unsatisfiable-subsets-2/On Finding Short Resolution Refutations and Small Unsatisfiable Subsetshttps://ac.tuwien.ac.at/publication/on-finding-short-resolution-refutations-and-small-unsatisfiable-subsets/Thu, 01 Jan 2004 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-finding-short-resolution-refutations-and-small-unsatisfiable-subsets/