Academic Journal
Q2Algorithmica
About Algorithmica
Algorithmica is a scholarly journal published by Springer New York. SCImago 2025 lists it in Q2, with an SJR of 0.566 and H-index of 87.
Coverage: 1986-2026. Research categories: Applied Mathematics (Q2); Computer Science Applications (Q2); Computer Science (miscellaneous) (Q2).
Source-backed journal facts
Topics in published research
Complexity and Algorithms in Graphs; Advanced Graph Theory Research; Computational Geometry and Mesh Generation; Optimization and Search Problems; Algorithms and Data Compression; Data Management and Algorithms.
OpenAlex classifies topics from published works. These topics are not the publisher’s official aims and scope.
Reported open-access list prices
3,290.00 USD; 2,690.00 EUR; 2,390.00 GBP
APC list prices reported by OpenAlex, which obtains this information from DOAJ. Confirm current charges, taxes, waivers and eligibility with the publisher; this is not a fee quotation.
Source: OpenAlex source record. Retrieved 2026-10-03. Source record updated 2026-10-02. OpenAlex metrics are different from SCImago metrics and the Clarivate Journal Impact Factor.
Journal Metrics
Quartile, SJR and the listed SCImago H-index use the 2025 imported SCImago dataset. A quartile may vary by subject category. Values without a source or reporting year are unverified historical entries. Verify the current Journal Impact Factor with Clarivate or the publisher before using it.
Aims & Scope
The publisher’s official aims and scope have not yet been verified for this profile. Use the journal website to check subject fit and accepted article types before submitting.
Recent Research Articles
Latest publications matched automatically by ISSN.
Maximum List r-Colorable Induced Subgraphs in $$kP_3$$-Free Graphs
Esther Galby, Paloma T. Lima, Andrea Munaro, Amir Nikabadi et al.
2026-11 · DOI: 10.1007/s00453-026-01410-7Approximating Unrelated Machine Weighted Completion Time Using Iterative Rounding and Computer Assisted Proofs
Shi Li
2026-11 · DOI: 10.1007/s00453-026-01411-6Edge Multiway Cut and Node Multiway Cut are Hard for Planar Subcubic Graphs
Matthew Johnson, Barnaby Martin, Sukanya Pandey, Daniël Paulusma et al.
2026-11 · DOI: 10.1007/s00453-026-01412-5New Tradeoffs for Decremental Approximate All-Pairs Shortest Paths
Michal Dory, Sebastian Forster, Yasamin Nazari, Tijn de Vos et al.
2026-11 · DOI: 10.1007/s00453-026-01407-2Couples can be Tractable: New Algorithms and Hardness Results for the Hospitals/Residents Problem with Couples
Gergely Csáji, David Manlove, Iain McBride, James Trimble et al.
2026-10 · DOI: 10.1007/s00453-026-01405-4String problems in the congested clique model
Shay Golan, Matan Kraus
2026-10 · DOI: 10.1007/s00453-026-01406-3Graph and String Parameters: Connections Between Pathwidth, Cutwidth and the Locality Number
Katrin Casel, Joel D. Day, Pamela Fleischmann, Tomasz Kociumaka et al.
2026-10 · DOI: 10.1007/s00453-026-01404-5Why Dominance is Not Enough: Lessons from Practical Evolutionary Multi-objective Algorithms
Duc-Cuong Dang, Andre Opris, Dirk Sudholt
2026-10 · DOI: 10.1007/s00453-026-01403-6Approximate Monotone Local Search for Weighted Problems
Barış Can Esmer, Ariel Kulik, Dániel Marx, Daniel Neuen et al.
2026-10 · DOI: 10.1007/s00453-026-01402-7MUL-Tree Pruning for Consistency and Compatibility
Christopher Hampson, Daniel J. Harvey, Costas S. Iliopoulos, Jesper Jansson et al.
2026-08 · DOI: 10.1007/s00453-026-01400-9Reforming an Unfair Allocation by Exchanging Goods
Sheung Man Yuen, Ayumi Igarashi, Naoyuki Kamiyama, Warut Suksompong et al.
2026-08 · DOI: 10.1007/s00453-026-01401-8Fault-Tolerant ST-Diameter Oracles
Davide Bilò, Keerti Choudhary, Sarel Cohen, Tobias Friedrich et al.
2026-08 · DOI: 10.1007/s00453-026-01399-zSegment Proximity Graphs and Nearest Neighbor Queries amid Disjoint Segments
Pankaj K. Agarwal, Haim Kaplan, Matthew J. Katz, Micha Sharir et al.
2026-08 · DOI: 10.1007/s00453-026-01395-3A Lower Bound on the Trace Norm of Boolean Matrices and its Applications
Tsun-Ming Cheung, Hamed Hatami, Kaave Hosseini, Aleksandar Nikolov et al.
2026-08 · DOI: 10.1007/s00453-026-01396-2Counting Polyominoes, Revisited
Gill Barequet, Gil Ben-Shachar
2026-06 · DOI: 10.1007/s00453-026-01392-6Tree-Packing Revisited: Faster Fully Dynamic Min-Cut and Arboricity
Tijn de Vos, Aleksander Christiansen
2026-06 · DOI: 10.1007/s00453-026-01394-4A General Upper Bound for the Runtime of a Coevolutionary Algorithm on Impartial Combinatorial Games
Alistair Benford, Per Kristian Lehre
2026-06 · DOI: 10.1007/s00453-026-01397-1Compressed Dictionary Matching on Run-Length Encoded Strings
Philip Bille, Inge Li Gørtz, Simon J. Puglisi, Simon Rumle Tarnow et al.
2026-06 · DOI: 10.1007/s00453-026-01398-0Tight Runtime Bounds for Evolutionary Algorithms on Sorting and Crossing Minimisation for Layered Graph Drawings
Jakob Baumann, Ignaz Rutter, Dirk Sudholt
2026-06 · DOI: 10.1007/s00453-025-01361-5Faster Combinatorial k-Clique Algorithms
Amir Abboud, Nick Fischer, Yarin Shechter
2026-06 · DOI: 10.1007/s00453-026-01390-8Reviews
Community Reviews
Version History
October 4, 2026 at 9:14 pm
October 2, 2026