Overview
Algorithmica is an international journal which publishes theoretical papers on algorithms that address problems arising in practical areas, and experimental papers of general appeal for practical importance or techniques. Founded in 1986, it is the longest running journal dedicated to the study of algorithms, and continues to be a leading publication in the field. The development of algorithms is an integral part of computer science. The increasing complexity and scope of computer applications makes the design of efficient algorithms essential.
Algorithmica covers algorithms in applied areas such as: VLSI, distributed computing, parallel processing, automated design, robotics, graphics, data base design, software tools, as well as algorithms in fundamental areas such as sorting, searching, data structures, computational geometry, and linear programming.
In addition, the journal features two special sections: Application Experience, presenting findings obtained from applications of theoretical results to practical situations, and Problems, offering short papers presenting problems on selected topics of computer science.
- Editor-in-Chief
-
- Mohammad T. Hajiaghayi
- Journal Impact Factor
- 0.9 (2023)
- 5-year Journal Impact Factor
- 1.0 (2023)
- Submission to first decision (median)
- 14 days
- Downloads
- 266,700 (2023)
Latest issue
Volume 86, Issue 12Latest articles
Journal information
- Electronic ISSN
- 1432-0541
- Print ISSN
- 0178-4617
- Abstracted and indexed in
-
- ACM Digital Library
- ANVUR
- BFI List
- Baidu
- CLOCKSS
- CNKI
- CNPIEC
- Current Contents/Engineering, Computing and Technology
- DBLP
- Dimensions
- EBSCO
- EI Compendex
- Google Scholar
- INIS Atomindex
- INSPEC
- INSPIRE
- Japanese Science and Technology Agency (JST)
- Mathematical Reviews
- Naver
- Norwegian Register for Scientific Journals and Series
- OCLC WorldCat Discovery Service
- Portico
- ProQuest
- SCImago
- SCOPUS
- Science Citation Index Expanded (SCIE)
- TD Net Discovery Service
- UGC-CARE List (India)
- Wanfang
- zbMATH
- Copyright information
-
© Springer Science+Business Media, LLC, part of Springer Nature