Fellows, M.R.
Fellows, Michael Ralph, 1952-....
![Sudoc [ABES], France](/viaf/images/flags/SUDOC.png "Sudoc [ABES], France")
Michael Fellows American computer scientist
Fellows, M. R. (Michael Ralph), 1952-
Fellows, Mike 1952-
Fellows, Michael R. 1952-
Fellows, Mike
Fellows, Michael R
Fellows, Michael
VIAF ID: 74521505 (Personal)
Permalink: http://viaf.org/viaf/74521505
Preferred Forms
-
200 _ |
‡a
Fellows
‡b
Michael Ralph
‡f
1952-....
-
100 1 _ ‡a Fellows, M. R
-
100 1 _
‡a
Fellows, M. R.
(sparse)
-
100 1 _ ‡a Fellows, M. R.
-
100 1 _
‡a
Fellows, M. R.
-
100 1 _ ‡a Fellows, M. R. ‡q (Michael Ralph), ‡d 1952-
-
100 1 _
‡a
Fellows, M. R.
‡q
(Michael Ralph),
‡d
1952-
-
100 1 _ ‡a Fellows, M. R. ‡q (Michael Ralph), ‡d 1952-
-
100 1 _ ‡a Fellows, M.R.
-
100 1 _ ‡a Fellows, Michael
-
100 1 _ ‡a Fellows, Michael R
-
100 1 _
‡a
Fellows, Michael R.
‡d
1952-
-
100 1 _ ‡a Fellows, Michael Ralph ‡d (1952- ).
-
100 1 _
‡a
Fellows, Michael Ralph,
‡d
1952-
-
100 1 _
‡a
Fellows, Michael Ralph,
‡d
1952-....
-
100 1 _ ‡a Fellows, Mike
-
100 1 _
‡a
Fellows, Mike
‡d
1952-
-
100 0 _
‡a
Michael Fellows
‡c
American computer scientist
4xx's: Alternate Name Forms (22)
5xx's: Related Names (1)
Works
| Title | Sources |
|---|---|
| complexity of induced minors and related problems |
|
| The Complexity of Polynomial-Time Approximation |
|
| Computer science unplugged |
|
| CS unplugged, 2015: |
|
| Encoding graphs in graphs, 1985 |
|
| Explaining cryptographic systems |
|
| Fast search algorithms for layout permutation problems |
|
| Finite-state computability of annotations of strings and trees (extended abstract) |
|
| Fixed-parameter algorithms for Kemeny rankings |
|
| Forbidden minors to graphs with small feedback sets |
|
| Foreword from the guest editors |
|
| FPT Is Characterized by Useful Obstruction Sets |
|
| Frontiers in algorithmics and algorithmic aspects in information and management third joint international conference ; proceedings |
|
| Graph-Based Data Clustering with Overlaps |
|
| Graph Layout Problems Parameterized by Vertex Cover |
|
| Haplotype Inference Constrained by Plausible Haplotype Data |
|
| Index sets and parametric reductions |
|
| O informatyce bez komputera : scenariusze zajęć z dziećmi |
|
| Konpyūta o tsukawanai jōhō kyōiku anpuragudo konpyūta saiensu |
|
| Large planar graphs with given diameter and maximum degree |
|
| Leaf Powers and Their Properties: Using the Trees |
|
| Local search: Is brute-force avoidable? |
|
| Multivariate Algorithmic Revolution and Beyond Essays Dedicated to Michael R. Fellows on the Occasion of His 60th Birthday |
|
| Myhill-Nerode Methods for Hypergraphs |
|
| n97054411 |
|
| nonblocker: Parameterized Algorithmics for minimum dominating set |
|
| Nonconstructive tools for proving polynomial-time decidability |
|
| On finding optimal and near-optimal lineal spanning trees |
|
| On finding short resolution refutations and small unsatisfiable subsets |
|
| On Problems without Polynomial Kernels (Extended Abstract) |
|
| On search, decision, and the efficiency of polynomial-time algorithms |
|
| On the galactic number of a hypercube |
|
| On the Structure of Parameterized Problems in NP |
|
| Parameterized algorithmics for finding connected motifs in biological networks. |
|
| Parameterized Algorithms and Hardness Results for Some Graph Motif Problems |
|
| Parameterized and exact computation : first international workshop, IWPEC 2004, Bergen, Norway, September 14-17, 2004 : proceedings |
|
| Parameterized Approximation via Fidelity Preserving Transformations |
|
| Parameterized Complexity |
|
| Parameterizing by the Number of Numbers |
|
| Polynomial-time data reduction for dominating set |
|
| Processor utilization in a linearly connected parallel processing system |
|
| Quadratic Kernelization for Convex Recoloring of Trees |
|
| Radius and diameter in Manhattan lattices |
|
| Recent Developments in the Theory of Pre-processing |
|
| Satisfying more than half of a system of linear equations over GF(2): A multivariate approach |
|
| Small diameter symmetric networks from linear groups |
|
| Towards Fully Multivariate Algorithmics: Some New Results and Directions in Parameter Ecology |
|
| Tractable Parameterizations for the Minimum Linear Arrangement Problem |
|
| Train Marshalling Is Fixed Parameter Tractable |
|
| Transversals of Vertex Partitions in Graphs |
|
| Upper and lower bounds for finding connected motifs in vertex-colored graphs |
|
| W-Hierarchies Defined by Symmetric Gates |
|
| W[2]-hardness of precedence constrained K-processor scheduling |
|
| Welcome Message from the Program Chairs |
|
| Well-Quasi-Orders in Subclasses of Bounded Treewidth Graphs |
|
| What Makes Equitable Connected Partition Easy |
|
| (놀이로 배우는) 컴퓨터 과학 |
|
| コンピュータを使わない情報教育アンプラグドコンピュータサイエンス |
|
