"Parameterized Complexity and Algorithms for Nonclassical Logics" in the
journal Algorithms, an *EI-*, *ESCI-*, and *Scopus-indexed* open access
journal.
We are looking for latest and original results on the new field of
research in the area of parameterized complexity and algorithms for
nonclassical logics.
We encourage your high-quality papers with subjects covering recent
research on this (non-exhaustive) list of possible directions with an
emphasis on nonclassical logics: Parameterized complexity
classifications, Parameterized proof-theoretic approaches, Parameterized
counting complexity investigations, Parameterized enumeration
complexity, Experimental studies, New results on lower bounds,
Developments on fine-grained parameterized complexity.
Further information can be found at the Special Issue website:
https://www.mdpi.com/journal/algorithms/special_issues/Nonclassical_Logics
The submission deadline is 31 January 2021. Papers will be published on
an ongoing basis, so you can submit your paper at any point before the
deadline.
We look forward to receiving your submission.
CiteScore of Algorithms (2019): 2.2
CiteScoreTracker 2020 (updated on 7 July, 2020): 2.3
Best regards,
Alina Chen
Assistant Editor
E-Mail: alina.chen@mdpi.com
--
MDPI Branch Office, Wuhan
Skype: live:a70ca49eff100a5b
**********************************************************
*
* 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/
*
**********************************************************
Posts
