Special Issue "Parameterized Algorithmics—Challenges from Real-World Applications"


A special issue of Algorithms (ISSN 1999-4893).

Deadline for manuscript submissions: 31 May 2014

Special Issue Editors

Guest Editor
Dr. Christian Komusiewicz
Algorithmik und Komplexitätstheorie, Institut für Softwaretechnik und Theoretische Informatik, Technische Universität Berlin, Sekr. TEL 5-1, Ernst Reuter Platz 7, D-10587 Berlin, Germany
Website: http://www.user.tu-berlin.de/ckomus/
E-Mail: christian.komusiewicz@tu-berlin.de
Interests: parameterized algorithmics; computational biology; graph modification problems; dense subgraphs

Guest Editor
Dr. Stefan Kratsch
Algorithmik und Komplexitätstheorie, Institut für Softwaretechnik und Theoretische Informatik, Technische Universität Berlin, Sekr. TEL 5-1, Ernst Reuter Platz 7, D-10587 Berlin. Germany
Website: http://www.user.tu-berlin.de/stefan.kratsch/
E-Mail: stefan.kratsch@tu-berlin.de
Interests: parameterized complexity; especially kernelization; graph problems; constraint satisfaction problems; computational complexity; communication complexity

Guest Editor
Prof. Dr. Rolf Niedermeier
Technische Universität Berlin, Fakultät IV - Elektrotechnik und Informatik, Sekr. TEL 5-1, Ernst-Reuter-Platz 7, D-10587 Berlin
Website: http://www.akt.tu-berlin.de/menue/team/niedermeier-rolf/
E-Mail: christlinde.thielcke@tu-berlin.de
Interests: parameterized computational complexity; NP-hard problems; exact algorithms; graph algorithms; complexity of voting problems; biological and social network analysis

Special Issue Information

Dear Colleagues,

Over the last decade, parameterized complexity analysis for NP-hard problems has developed into one of the most prospering areas in algorithms and complexity research. So far, the main research focus is on purely theoretical analysis (mostly concerning graph-theoretic problems).

However, practical success often relies on one or more of the following aspects:

  • The problem under study occurs in real-world applications and ideally comes along with real-world data for testing.
  • The considered parameterization yields small parameter values in real-world instances.
  • The running time analysis accounts for the combinatorial explosion behind exponential parameter functions, as well as for polynomial running time factors in the overall input size.

We invite submissions that address one or more of the aforementioned points in analyzing the parameterized complexity of NP-hard problems, which arises from application areas including (but not limited to) network analysis (biological, social, and technical), computational geometry, SAT solving, bioinformatics, string problems, operations research and combinatorial optimization, computational social choice, data clustering, and mining.

We particularly welcome submissions that introduce new but practically relevant problem formulations and/or parameterizations, present linear-time fixed-parameter tractability and/or kernelization results, or that take into account aspects of algorithm engineering. In particular, such aspects could include the measurement or estimation of parameter values in real-world data. Finally, feature papers or surveys addressing some of the above aspects are also of interest.

Dr. Christian Komusiewicz
Dr. Stefan Kratsch
Prof. Dr. Rolf Niedermeier
Guest Editors


Manuscripts should be submitted online at www.mdpi.com by registering and logging in to this website. Once you are registered, click here to go to the submission form. Manuscripts can be submitted until the deadline. Papers will be published continuously (as soon as accepted) and will be listed together on the special issue website. Research articles, review articles as well as communications are invited. For planned papers, a title and short abstract (about 100 words) can be sent to the Editorial Office for announcement on this website.

Submitted manuscripts should not have been published previously, nor be under consideration for publication elsewhere (except conference proceedings papers). All manuscripts are refereed through a peer-review process. A guide for authors and other relevant information for submission of manuscripts is available on the Instructions for Authors page. Algorithms is an international peer-reviewed Open Access quarterly journal published by MDPI.

Please visit the Instructions for Authors page before submitting a manuscript. The Article Processing Charge (APC) for publication in this open access journal is 300 CHF (Swiss Francs). English correction and/or formatting fees of 250 CHF (Swiss Francs) will be charged in certain cases for those articles accepted for publication that require extensive additional formatting and/or English corrections.


  • NP-hard problems
  • exact algorithms
  • fixed-parameter tractability
  • kernelization and data reduction
  • efficient algorithms
  • algorithm engineering

Published Papers

No papers have been published in this special issue yet.

Last update: 10 February 2014

Algorithms EISSN 1999-4893 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert