<--- Back to Details
First PageDocument Content
NP-complete problems / Parameterized complexity / Analysis of algorithms / Michael Fellows / Kernelization / Feedback vertex set / Vertex cover / Lecture Notes in Computer Science / Clique / Theoretical computer science / Computational complexity theory / Applied mathematics
Date: 2009-09-21 11:20:05
NP-complete problems
Parameterized complexity
Analysis of algorithms
Michael Fellows
Kernelization
Feedback vertex set
Vertex cover
Lecture Notes in Computer Science
Clique
Theoretical computer science
Computational complexity theory
Applied mathematics

Michael Ralph Fellows My Publications by Year Please also see DBLP AUTHOR Michael Fellows Books This is Mega-Mathematics!, 134 pp., available for free at the World Wide Web site: http://www.c3.lan

Add to Reading List

Source URL: www.mrfellows.net

Download Document from Source Website

File Size: 85,32 KB

Share Document on Facebook

Similar Documents

2015 IRTS SUMMER FELLOWS Andreea Arama Queens College The IRTS Michael Brochstein/Queens College Fellow - Sponsored by Bruce Lefkowitz Andreea Arama is a rising senior at the Macaulay Honors College at Queens College, ma

2015 IRTS SUMMER FELLOWS Andreea Arama Queens College The IRTS Michael Brochstein/Queens College Fellow - Sponsored by Bruce Lefkowitz Andreea Arama is a rising senior at the Macaulay Honors College at Queens College, ma

DocID: 1sreN - View Document

Two Students Named Recipients of ACM/IEEE-CS George Michael Memorial HPC Fellowships NEW YORK, NY & LOS ALAMITOS, Calif., August 5, Maciej Besta of ETH Zurich and Dhairya Malhotra of the University of Texas at Au

Two Students Named Recipients of ACM/IEEE-CS George Michael Memorial HPC Fellowships NEW YORK, NY & LOS ALAMITOS, Calif., August 5, Maciej Besta of ETH Zurich and Dhairya Malhotra of the University of Texas at Au

DocID: 1rxIy - View Document

Top 50 authors in computer science  Author Michael I. Jordan Andrew Y. Ng Andrew Zisserman

Top 50 authors in computer science Author Michael I. Jordan Andrew Y. Ng Andrew Zisserman

DocID: 1rll2 - View Document

Microsoft Word - Newsletter CASEdoc

Microsoft Word - Newsletter CASEdoc

DocID: 1rjrs - View Document

Upper and Lower Bounds for Finding Connected Motifs in Vertex-Colored Graphs ⋆ Michael R. Fellows a,1 Guillaume Fertin b Danny Hermelin c,2 and St´ephane Vialette d a Office

Upper and Lower Bounds for Finding Connected Motifs in Vertex-Colored Graphs ⋆ Michael R. Fellows a,1 Guillaume Fertin b Danny Hermelin c,2 and St´ephane Vialette d a Office

DocID: 1r8ab - View Document