Back to Results
First PageMeta Content
NP-complete problems / Parameterized complexity / Kernelization / Path decomposition / Clique / Tree decomposition / Vertex cover / Dominating set / Edge coloring / Graph theory / Theoretical computer science / Mathematics


Open Problems in Parameterized and Exact Computation — IWPEC 2008 Hans L. Bodlaender Erik D. Demaine Michael R. Fellows Jiong Guo
Add to Reading List

Document Date: 2009-10-14 09:04:12


Open Document

File Size: 180,85 KB

Share Result on Facebook

City

Bergen / Bern / Freiburg / New York / Victoria / Jena / Haifa / Cambridge / B. Hayes / /

Company

CNF / Artificial Intelligence Laboratory / Vertex / /

Country

Germany / Netherlands / Norway / United States / Canada / Australia / Israel / India / /

Currency

pence / /

Facility

University of Bergen / C.I.T Campus / building FPT / Computing Sciences Utrecht University / University of Haifa / The University of Newcastle / Germany †† The Institute of Mathematical Sciences / Utrecht University / /

IndustryTerm

distillation algorithms / win/win algorithm / subexponential time algorithms / polynomial-time algorithm / brute-force exponential algorithm / lower bound technology / Polynomial algorithms / polynomial time algorithm / gates computing constants / distillation algorithm / fixed-parameter tractable algorithm / Win/win algorithms / polynomialtime algorithms / /

OperatingSystem

XP / /

Organization

Department of Information / MIT / Department of Informatics / University of Haifa / Institut f¨ / University of Newcastle / University of Bergen / Institute of Mathematical Sciences / Department of Computer Science / Complexity Research Unit / Mathematisches Institut / Utrecht University / /

Person

Mike Fellows / Danny Hermelin / Daniel Lokshtanovk Johan van Rooij / Karsten Weihe / Erik D. Demaine† Daniel Lokshtanovk / Hans Bodlaender / Albert Ludwigs Universit / Raman Johan van Rooij Frances / M. Mahajan / V / Erik Demaine / Frances A. Rosamond / Hans L. Bodlaender∗ Danny Hermelin / Johan van Rooij / Danny Hermelin¶ Erik / Daniel Lokshtanov / Hans L. Bodlaender Erik / Michael R. Fellows Jiong Guo Danny / /

ProvinceOrState

British Columbia / New York / Victoria / Massachusetts / /

PublishedMedium

Theory of Computing / Lecture Notes in Computer Science / /

SportsEvent

TB Utrecht The Netherlands Open / /

Technology

FPT algorithms / polynomial time algorithm / fixed-parameter tractable algorithm / distillation algorithms / J. Algorithms / Polynomial algorithms / J. Graph Algorithms / brute-force exponential algorithm / polynomialtime algorithms / Win/win algorithms / distillation algorithm / polynomial-time algorithm / subexponential time algorithms / Dom / Win/Win algorithm / SNP / lower bound technology / /

URL

www.cs.uu.nl / /

SocialTag