Skip Content
You are currently on the new version of our website. Access the old version .

Parameterized Complexity and Algorithms

This special issue belongs to the section “Analysis of Algorithms and Complexity Theory“.

Special Issue Information

Keywords

  • parameterized algorithms
  • fixed-parameter algorithms
  • kernelizations
  • graph problems
  • computational social choice
  • cooperative game theory
  • planning and scheduling
  • decision-making theory
  • bioinformatics
  • clustering
  • matrix reconstruction
  • integer linear programming
  • heuristic algorithms
  • approximation algorithms

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.

Published Papers

Get Alerted

Add your email address to receive forthcoming issues of this journal.

XFacebookLinkedIn
Algorithms - ISSN 1999-4893