Advances in Parameterized Complexity: Theory, Algorithms, and Applications
A special issue of Algorithms (ISSN 1999-4893). This special issue belongs to the section "Analysis of Algorithms and Complexity Theory".
Deadline for manuscript submissions: 30 September 2026 | Viewed by 516
Editor
Interests: design and analysis of algorithms; network algorithms; social network analysis; parameterized algorithms and complexity; combinatorial structures
Special Issues, Collections and Topics in MDPI journals
Special Issue Information
Dear Colleagues,
In recent years, parameterized complexity has advanced significantly. It has been employed in diverse domains such as algorithmic graph theory, algorithmic game theory, computational social choice, bioinformatics, machine learning, multiagent systems, planning and scheduling and big data science.
However, there is still a long way to go. Therefore, this Special Issue welcomes contributions that strengthen the connection between parameterized algorithms and practical applications, and aims to promote novel theoretical insights through this exchange of knowledge. In addition, we aim to outline opportunities for future research in parameterized complexity at the intersection of diverse disciplines and present new or enhanced results regarding the parameterized complexity of combinatorial problems, novel algorithmic methods or paradigms within parameterized complexity, and surveys highlighting recent progress and applications in these fields.
Dr. Adele Anna Rescigno
Guest Editor
Manuscript Submission Information
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. All submissions that pass pre-check are peer-reviewed. Accepted papers will be published continuously in the journal (as soon as accepted) and will be listed together on the special issue website. Research articles, review articles as well as short communications are invited. For planned papers, a title and short abstract (about 250 words) can be sent to the Editorial Office for assessment.
Submitted manuscripts should not have been published previously, nor be under consideration for publication elsewhere (except conference proceedings papers). All manuscripts are thoroughly refereed through a single-anonymized 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 monthly 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 1800 CHF (Swiss Francs). Submitted papers should be well formatted and use good English. Authors may use MDPI's English editing service prior to publication or during author revisions.
Keywords
- algorithm design and analysis
- parameterized algorithms and their applications
- exact exponential-time algorithm
- fixed-parameter tractability
- kernelization results
- parameterized complexity theory
- parameterized approximability and inapproximability
Benefits of Publishing in a Special Issue
- Ease of navigation: Grouping papers by topic helps scholars navigate broad scope journals more efficiently.
- Greater discoverability: Special Issues support the reach and impact of scientific research. Articles in Special Issues are more discoverable and cited more frequently.
- Expansion of research network: Special Issues facilitate connections among authors, fostering scientific collaborations.
- External promotion: Articles in Special Issues are often promoted through the journal's social media, increasing their visibility.
- Reprint: MDPI Books provides the opportunity to republish successful Special Issues in book format, both online and in print.
Further information on MDPI's Special Issue policies can be found here.
