[DMANET] [Algorithms] Second Call: Special Issue "Parameterized Algorithmics - Challenges from Real-World Applications"

Dear Colleagues,

we would like to recall the upcoming deadline for submissions to the
special issue

Parameterized Algorithmics - Challenges from Real-World Applications
http://www.mdpi.com/si/algorithms/Parameterized_Algorithmics

of the open access journal Algorithms (ISSN 1999-4893,
http://www.mdpi.com/journal/algorithms). The submission deadline
is 31 May 2014, but you may send your manuscript at any time before
then. If you plan to contribute a research or review article, please send
a short abstract to the Editorial Office (algorithms@mdpi.com).

A detailed call for submissions can be found below.

We look forward to your contributions.

Christian Komusiewicz
Stefan Kratsch
Rolf Niedermeier
Guest Editors

-------------------------------------------------------------------------------------------------------

Call for submissions:

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.

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

The deadline for submission is 31 May 2014, but you may send your
manuscript
at any time before then. All submissions are peer-reviewed and accepted
papers
will be published immediately. If you plan to contribute, please send a
short
abstract to the Editorial Office (algorithms@mdpi.com).

Algorithms is an open access journal, which has no income from selling
subscriptions. To defray the editorial and production costs, the journal
levies an
Article Processing Charge (APC) for accepted papers. Please refer to
http://www.mdpi.com/journal/algorithms/apc/ for more information. The
charge
currently is of 300 CHF (Swiss Francs) per accepted paper.
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************