KAIST / Nijmegen / Buffalo / Sophia Antipolis / Budapest / Montreal / Leicester / Taipei / Paris / Tokyo / Auckland / Jena / Bonn / Brno / Newcastle / Shanghai / Changsha / Helsinki / Warsaw / Tel Aviv / Warwick / Bangalore / Washington / DC / Victoria / Berlin / Cambridge / Montpellier / Melbourne / Chicago / /
Company
Oxford University Press / Philips / Dell / AT&T / Nokia / Google / Ireland Young Researcher Award / Oak Ridge National Labs / Microsoft / /
Country
Switzerland / Hungary / Netherlands / South Africa / Norway / France / Canada / Australia / United Kingdom / India / Denmark / Taiwan / Germany / Slovenia / Chile / Austria / United States / South Korea / Czech Republic / /
Currency
USD / EUR / NOK / AUD / /
Facility
Howard University / University of New South Wales / Petr Hlineny Charles University / Dalhousie University / University of Waterloo / Memorial Univ. / University Dauphine / University of Bergen / Memorial Univ / University of Victoria / Vienna University of Technology / Chinese University / Nijmegen Institute / Daniel Marx India Institute / Rudiger Reischuk Max Planck Research Institute / Charles Darwin University / Brazil Federal University of Rio de Janeiro / University of Maryland / Fudan University / University of Cork / Prabhakar Ragde Czech Republic Masaryk University / /
UCSD / San Diego / Royal Mathematical Society in the Netherlands / Yijia Chen City Univ. of Hong Kong / office of Naval Research / Institute for Mathematical Sciences / Masaryk Univ / International Summer School / University of Maryland / Chinese University of Hong Kong / National Chung Cheng Univ / Chen City Univ. of Hong Kong / Vienna Univ of Technology / French National Agency for Research / Rudiger Reischuk Max Planck Research Institute / Budapest Univ. of Technology and Economics / Iyad Kanj Univ. / McGill Univ. / Research Council of Norway / Computing Society / Univ. of Waterloo / Memorial Univ / Liming Cai Univ. of Maryland / DePaul Univ / Universidad de Chile / Memorial Univ of Newfoundland / Mathematics and Computer Science Eindhoven Univ of Technology / Univ. of Newcastle / University of Victoria / Texas A&M / University of Cork / Oxford University / Vienna University of Technology / Griffith Univ / Charles Darwin Univ / Central South Univ. / Dalhousie University / National Dong Hwa Univ / AGAPE Spring School on Parameterized Complexity / Auckland Centre for Algorithmic Aspects of Game Theory and Social Choice / Ryan Williams Univ. / Kurt Mehlhorn Univ. / Brazil Federal University of Rio de Janeiro / National Science Foundation / Howard University / Washington / MIT / Univ. of Twente / Lebanese American Univ. / Charles Darwin University / University of New South Wales / Parameterized Complexity Africa Univ. of Johannesburg / Marcus Schafer DePaul Univ. / University of Waterloo / International Summer School on Fixed Parameter Algorithms / University of Bergen / National Tsing Hua Univ / Erik D. Demaine Univ. / Detlef Seese Christian Albrechts Univ. / Charles University / Prague / Univ. of Wellington / Fudan University / Shanghai / Zhibiao Yang Shanghai Jiaotong Univ. / Winter School / Masaryk University / Ron Dutton Univ. of Chicago / Bergen Research Foundation / Steering Committee / Stanford / Technion / Nijmegen Institute for Cognition and Information / /
Person
Jiong Guo / Iris van Rooij / Rolf Klein / Fred Havet / C. Paul / David Juedes Univ Oregon / Martin Grohe Technische Universit / Richard Karp / Ron Shamir / Michael Hallett / Dong Hwa / Michael Langston / Rolf Niedermeier / Patricia Evans / Daniel Marx / Ulrike Stege Waterloo / Fedor V. Fomin / Erik Demaine / Cristina Bazgan Lyon / Abu-Khasam Netherlands Utrecht / Cai Denmark Copenhagen / Charles Darwin / Frances Rosamond / Noga Alon / Jorg Flum Karlsruhe / Jorg Rothe / Stefan Woltran / M. Langston / Jan Arne Telle / Jayme Szwarcfiter / Gregory Z. Gutin / Stefan Kreutzer / Catherine McCartin Wellington / Hans Bodlaender Eindhoven / Yusuke Kobayashi / Mikko Koivisto / Saket Saurabh / Petr Hlineny / Igor Razgon / Stefan Szeider / Pablo Moscato / Cristina Bazgan / Anders Yeo / Norbert Zeh McGill / Christophe Paul / Marcus Cesati / Leizhen Cai / I. Todinca / Juan Andres Montoya / Christian Albrechts Univ / Hua Univ / Peter Shaw / Paul Bonsma / Mike Fellows / Alejandro Lopez-Ortiz / Joerg Flum (Freiburg) / Ulrike Stege / Felix Brandt Freiburg / Sue Whitesides / Hwa Univ / Toby Walsh / Marcus Schafer DePaul / Guo Trier / Rudolf Fleischer / Rod Downey / Gerhard Weoginger / Matthias Mnich / Rodney G. Downey / Ken-Ichi Kawarabayashi / Daniel Kral / Kenneth W. Regan / Dieter Kratsch / Reinhard Pichler / Blanc Grant / Chung Cheng / Henning Fernau Greece Athens / Frank Dehne / Gerhard Woeginger Nijmegen / R. Niedermeier / Osamu Watanabe / R. Downey / Arkady Slinko Massey / Rolf Niedermeier Dusseldorf / Benny Chor / Iyad Kanj / Igor Razgon Royal Holloway / Jianxin Wang / Michael Fellows / Academia Sinica / Dimitrios M. Thilikos / Arkadii Slinko / Vladimir Estivill-Castro / Marek Cygan South Korea Sangil / Mohammad Taghi Hajiaghayi / D.Kratsch / S. Thomasse / Darwin Univ / Peter Rossmanith / Peter Damaschke / Johan M. M. van Rooij / Serge Gaspers / Georg Gottlob Durham / Klaus Jansen Luebeck / Daniel Lokshtanov / Rodney Downey Norway Bergen / Klaus Jansen / Cheng Univ / Stephane Thomasse Metz / Gregory Gutin / Faisal Abu-Khasam / /
Position
Project Leader / Advisor / President / Vice-Chancellor / Editor / Research Council Discovery Early Career Researcher / Director / newsletter Editor / /
ProvinceOrState
Ohio / New Brunswick / British Columbia / Georgia / Maryland / Newfoundland / Victoria / Tennessee / New South Wales / Florida / /
PublishedMedium
The Computer Journal / Milestones / la Recherche / Theoretical Computer Science / /
Region
South Wales / Central Florida / South Korea / /
Technology
Fixed Parameter Algorithms / approximation algorithms / bioinformatics / ESA / pdf / artificial intelligence / parallel processing / /
A quick summary of the field of Parameterized Complexity, 2012 Overview Parameterized Complexity is a recent branch of computational complexity theory that provides a framework for a refined analysis of hard algorithmic