Invitation to Fixed-Parameter Algorithms

By Rolf Niedermeier. 2006

719 citations recorded by the source corpus.

Subfields: Computational Theory and Mathematics, Computer Networks and Communications

View Paper: https://www.semanticscholar.org/paper/eae00d81c27e628391c78086803cd1072d2bf93a

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computational Theory and Mathematics

1. Dimitrios M. Thilikos
2. Vincent Conitzer
3. Dexter Campbell Kozen
4. Jiong Guo
5. Rolf Niedermeier
6. Stefan Szeider
7. Sebastian Ordyniak

In Computer Networks and Communications

1. Ariel D. Procaccia
2. Dimitrios M. Thilikos

Citations in the corpus

• Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time (2011, neutral): “We feel that the results for Connected Vertex Cover, Connected Dominating Set, Connected Feedback Vertex Set, and Connected Odd Cycle Transversal are of particular interest here and should be compared to the algorithms and lower bounds for the analogous problems without the connectivity requirement.”
• Handbook of Computational Social Choice (2016, background): “A plethora of intractability results indicates that a fixed parameter tractability approach (Niedermeier, 2006) may also be fruitful.”
• Invitation to fixed-parameter algorithms (2007, methodology): “On the other hand, the content and the structure of [14] certainly makes it more inviting for a student or a beginner in this field.”