M
Michael R. Fellows
Researcher at University of Bergen
Publications - 313
Citations - 19261
Michael R. Fellows is an academic researcher from University of Bergen. The author has contributed to research in topics: Parameterized complexity & Vertex cover. The author has an hindex of 67, co-authored 311 publications receiving 18287 citations. Previous affiliations of Michael R. Fellows include Durham University & University of Idaho.
Papers
More filters
Book ChapterDOI
On the complexity of some colorful problems parameterized by treewidth
Michael R. Fellows,Fedor V. Fomin,Daniel Lokshtanov,Frances A. Rosamond,Saket Saurabh,Stefan Szeider,Carsten Thomassen +6 more
TL;DR: The problem of determining whether χl(G) ≤ r, the LIST CHROMATIC NUMBER problem, is solvable in linear time for every fixed treewidth bound t, and a list-based variation, LIST EQUITABLE COLORING is W[1]-hard for trees, parameterized by the number of colors on the lists.
On well-partial-order theory and its application to combinatorial problems of VLSI design
TL;DR: The existence of decision algorithms with low-degree polynomial running times for a number of well-studied graph layout, placement, and routing problems is nonconstructively proved using the recent Robertson–Seymour theorems on the well-partial-ordering of graphs.
Journal ArticleDOI
Upper and lower bounds for finding connected motifs in vertex-colored graphs
TL;DR: This paper gives an extensive picture of tractable and intractable instances of the problem of finding occurrences of motifs in vertex-colored graphs, where a motif is a multiset of colors, and an occurrence is a subset of connected vertices whose multisets of colors equals the motif.
Book ChapterDOI
Refined Search Tree Technique for DOMINATING SET on Planar Graphs
Jochen Alber,Hongbing Fan,Michael R. Fellows,Henning Fernau,Rolf Niedermeier,Frances A. Rosamond,Ulrike Stege +6 more
TL;DR: A fixed parameter algorithm with running time O(8kn), where k is the size of the dominating set and n is the number of vertices in the graph is derived.