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
Posted Content
Algorithms for learning and teaching sets of vertices in graphs
TL;DR: The learning complexity of special sets of vertices in graphs is studied in the model(s) of exact learning by (extended) equivalence and membership queries, and it is shown that the k-element vertex covers in a graph can be learned in a number of rounds of interaction that is independent of the size of the graph.
Journal ArticleDOI
A brief history of Edward K. Blum and the Journal of Computer and System Sciences
TL;DR: An appreciation of Edward “Ed” Blum is given, with accolades and stories from family and colleagues, at the time Ed founded the Journal of Computer and System Sciences.
Algebraic formulas for counting spanning trees in regular multigraphs
TL;DR: In this article, the authors show that the number of spanning trees in a regular multigraph does not depend on the selection of a reference point and on trees orientation with respect to that point.
Book ChapterDOI
The M-Hierarchy, and XP-Optimality
TL;DR: Methods are given to show that, under reasonable hypotheses, current algorithms for various computational tasks are optimal up to an O-factor up to the level of XP.
Journal ArticleDOI
Some Open Problems in Parameterized Complexity Related to the Work of Jianer Chen
TL;DR: This short paper highlights some open problems related to the work of Jianer Chen in the area of parameterized/multivariate algorithmics.