Back to Results
First PageMeta Content
NP-complete problems / Bidimensionality / Parameterized complexity / Kernelization / Branch-decomposition / Path decomposition / Tree decomposition / Clique / Feedback vertex set / Graph theory / Theoretical computer science / Mathematics


Parameterized Complexity-News The Newsletter of the Parameterized Complexity Community Volume 3, MayWelcome
Add to Reading List

Document Date: 2009-09-04 06:03:09


Open Document

File Size: 112,52 KB

Share Result on Facebook

City

Efficient Enumeration / Jena / Diego / Newcastle / Shanghai / New York / Sydney / Victoria / Berlin / San Diego / Faculty Kernelization / /

Company

CNF / Prentice-Hall / Niedermeier / Wilson / Langston / IOS Press / Moscato / European Mathematical Psychology Group / Vertex / /

Country

Switzerland / Hungary / United Kingdom / China / India / Germany / Sweden / Austria / United States / /

Currency

GBP / EUR / /

/

Facility

Macquarie University / Budapest University of Technology / University of Bergen / Carleton University / Griffith University / Haifa University / /

IndustryTerm

brute-force search / local search / decision support systems / k-change local search problem / local search problem / dynamic programming algorithm / probabilistic networks / linear time algorithms / Fixed parameter algorithms / feasible solution / experimental graph algorithms / heuristic algorithms / tabu search / web page http /

Organization

Durham Univ / Department of Computer and Information Science / Macquarie University / African Union / Fudan Univ. / University of Bergen / Haifa University / Griffith University / Israel Academy of Sciences and Humanities / Budapest University of Technology and Economics / Carleton University / Wilhelm-Schickard Institut f¨ / /

Person

Jie Meng / Jiong Guo / Iris van Rooij / Bernard Mans / Alexey A. Stepanov / H. Tod Wareham / Hans L. Bodlaender / Sebastian Briesemeister / Michael Hallett / Chunmei Liu / Michael Langston / Rolf Niedermeier / Magdalena Gr / Karl Abrahamson / Christian Knauer / Arnold Saxton / Daniel Marx / Khaled Elbasprise / Richard Johnsonbaugh / Erik Demaine / Fedor V. Fomin / Mark Dras / Max Leaf / Andy Perkins / Falk Hueffner / Frances Rosamond / Imran Rau / Moritz Mueller / Jan Arne Telle / P. Bonsma / Todd Wareham / Berry / Saket Saurabh / Petr Hlineny / Nijmegen Royal Holloway / Stefan Dantchev Rolf / Igor Razgon / Stefan Szeider / Martin Grohe / Stephen Gilmour / Armin Biere / Somnath Sikdar / Jon Scharff / Paul Bonsma / Rodney Downey / Mike Fellows / Arie Koster / Hans van Maaren / Ulrike Stege / Quang Bao Anh Bui / Hans Bodlaender / Toby Walsh / Rod Downey / Bergen / Jens Gramm / Christian Sloper / Yinglei Song / Rudolph Fleischer / Georg Gottlob / Yijia Chen / Frederic Dorn / Michael Dom / Marko Samer / Iris vonRooij / Florian Zickfeld / Mark Weyer / Rolf Neidermeier / Jianer Chen / Luke Mathieson / Marcus Schaefer / S. Briesemeister / Michael Fellows / Marco Cesati / Fran Rosamond / Matthias Hagen / Max Cardinality / Serge Gaspers / Brynn Voy / Q. Bui / Valerie King / Anke Truß / Gregory Gutin / Anders Yeo / Max-Leaf Problems / /

Position

Advisor / Chief Editor / researcher in the CAI division / Editor / advisors / Assistant Professor / Adams Fellowship Organizing Chair / /

ProgrammingLanguage

K / /

ProvinceOrState

New York / California / Victoria / /

PublishedMedium

The Computer Journal / the Parameterized Complexity News / Foreword / Theory of Computing / /

Technology

3-D / linear time algorithms / experimental graph algorithms / Fixed parameter algorithms / branch-and-bound algorithm / FPT approximation algorithm / Fixed-Parameter Algorithms / chordal graph graph recognition algorithms / local search algorithms / Approximation Algorithms / linear time algorithm / dynamic programming algorithm / tabu search algorithm / same algorithm / iterative Lin-Kernighan algorithm / brute force algorithm / ESA / P-time algorithm / dynamic programming algorithms / artificial intelligence / Lauritzen-Spiegelhalter algorithm / http / /

URL

http /

SocialTag