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

Feature Paper in Algorithms and Complexity Theory

This topical collection belongs to the section “Analysis of Algorithms and Complexity Theory“.

Topical Collection Information

Keywords

  • Theory of algorithms
  • Sorting and searching algorithms
  • Parameterized complexity
  • Polynomial, moderately exponential, parameterized approximation of NP-hard problems
  • Automata theory and formal languages
  • Computational geometry
  • Quantum algorithms

Published Papers

Get Alerted

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

XFacebookLinkedIn
Algorithms - ISSN 1999-4893