Back to Results
First PageMeta Content
NP-complete problems / Analysis of algorithms / Parameterized complexity / Graph coloring / Kernelization / Dominating set / Feedback vertex set / Vertex cover / Tree decomposition / Theoretical computer science / Graph theory / Computational complexity theory


0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
Add to Reading List

Document Date: 2009-09-08 08:50:37


Open Document

File Size: 539,32 KB

Share Result on Facebook

City

Middendorf / Moravici / Znojmo / Bergen / Barcelona / Chennai / Bangalore / Berlin / Cambridge / Prague / Aachen / /

Company

JCSS / IBM / AT&T / ACM Press / Google / Honeywell / Vertex / /

Country

Hungary / Norway / France / Australia / India / Sweden / Austria / United States / Czechia / Czech Republic / /

Currency

USD / EUR / /

/

Facility

University of Montpellier / Budapest University of Technology / CRM Centre / Brno University of Technology / Masaryk University / Valia Mitsou / 1 City University of New York / 1 National Technical University / University of Newcastle / University of Bergen / Vienna University of Technology / Max Planck Institute / /

IndustryTerm

kernelization algorithms / k-local search / local search / subexponential time algorithms / exponential time branching algorithms / parameterized branching algorithms / exponential time algorithms / Fixed parameter algorithms / heuristic algorithms / celebrated disjoint paths algorithm / pre-processing / geometric algorithms / search procedure / examplary algorithms / approximation algorithms / fixed-parameter and exact algorithms / /

NaturalFeature

Island of Corse / /

OperatingSystem

XP / /

Organization

Universidad de Chile in Santiago / Department of Computer and Information Science / Budapest Univ. of Technology and Economics / University of Athens2 Treewidth / AGAPE Spring School / Vienna University of Technology / MIT / Max Planck Institute / Department of Informatics / CRM Centre / University of Newcastle / University of Bergen / City University of New York / Center for Mathematical Modelling / Department of Computer / Scientific Committee / Masaryk University / Budapest University of Technology and Economics / Brno University of Technology / Wilhelm-Schickard Institut f¨ / /

Person

Jiong Guo / Alexey A. Stepanov / I. Sau-Valls / Fred Havet / Kurt Mehlhorn / Thor Johnson / Fernando Sanchez / Magdalena Gr / Ed Blum / Fran / Arthur C. Clarke / Sebastian Ordyniak / F. Lalande / Erik Demaine / Fedor V. Fomin / Thomas Erlebach / Max Leaf / Max Leaf Minimum Fill / Georgia Kaouri / Felix Jon Reidl / Takuro Fukunaga / Frances Rosamond / Moritz Mueller / P. Lachaume / Michael Lampis / Paul D. Seymour / P. Bonsma / Jan Arne Telle / Saket Saurabh / Valia Mitsou / N. Cohen / Peter Dankelmann / Martin Gr / Christophe Paul / Somnath Sikdar / C. Jullien / I. Todinca / Paul Bonsma / Mike Fellows / M. Syska / Robin Thomas / Clifford Stein / Sue Whitesides / F. Grandoni / Hiroshi Nagamochi / Ali Safari / Dieter Kratsch / Blanc Grant / Paul Hunter / Florian Zickfeld / Kirk Pruhs / D. Kratsch / Sophia-Antipolis / F. V. Fomin / H. W. Lenstra / Jr. / S. Briesemeister / Michael Fellows / Tom Friedetzky / Jan Obdrz / Stephan Kreutzer / Eun Jung Kim / David Johnson / Peter Rossmanith / Serge Gaspers / Q. Bui / Daniel Lokshtanov / Mohammad Ali / Anke Truss / Mathias Weller / Neil Robertson / Gregory Gutin / Ralph Fellows / Max-Leaf Problems / Frederic Dorn / /

Position

Advisor / king / Professor position / Managing Editor / Supervising Editor / Editor / CONGRATULATIONS Grants Project Leader / Assistant Newsletter Editor / Newsletter Editor / lecturer / /

ProgrammingLanguage

D / /

PublishedMedium

la Recherche / Lecture Notes in Computer Science / /

Technology

FPT algorithm / celebrated disjoint paths algorithm / 3-D / FPT-time algorithm / Even Faster Algorithm / Fixed parameter algorithms / html / Optimization algorithms / EPTAS algorithms / approximation algorithms / same algorithm / CRM / FPT algorithms / PTAS algorithms / parameterized branching algorithms / improved algorithm / moderately exponential time algorithms / CKX algorithm / 3-Hitting Set algorithm / known P-time kernelization algorithms / moderately exponential time branching algorithms / http / how subexponential time algorithms / Fixedparameter algorithms / /

URL

www.fpt / http /

SocialTag