Parameterized Complexity (1998)
| Citations: | 697 - 56 self |
BibTeX
@MISC{Downey98parameterizedcomplexity,
author = {Rod G. Downey and Michael R. Fellows and Rolf Niedermeier and Peter Rossmanith and Rod G. Downey (wellington and New Zeal and Michael R. Fellows (newcastle and Rolf Niedermeier (tubingen and Peter Rossmanith (tu Munchen},
title = {Parameterized Complexity},
year = {1998}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
the rapidly developing systematic connections between FPT and useful heuristic algorithms | a new and exciting bridge between the theory of computing and computing in practice. The organizers of the seminar strongly believe that knowledge of parameterized complexity techniques and results belongs into the toolkit of every algorithm designer. The purpose of the seminar was to bring together leading experts from all over the world, and from the diverse areas of computer science that have been attracted to this new framework. The seminar was intended as the rst larger international meeting with a specic focus on parameterized complexity, and it hopefully serves as a driving force in the development of the eld. 1 We had 49 participants from Australia, Canada, India, Israel, New Zealand, USA, and various European countries. During the workshop 25 lectures were given. Moreover, one night session was devoted to open problems and Thursday was basically used for problem discussion
Citations
| 443 | The Complexity of Robot Motion Planning - Canny - 1987 |
| 92 | Motion planning in the presence of moving obstacles - Reif, Sharir - 1985 |
| 54 | Algorithmic motion planning in robotics - Schwartz, Sharir - 1990 |
| 13 | Complexity of the generalized mover's problem - Reif - 1987 |
| 9 | Parameterized complexity analysis in robot motion planning - Cesati, Wareham - 1995 |
