World's Best Scientists 2026 revealed!
Algorithmica
H-index 22

Algorithmica

0178-4617

Published by: Springer

https://www.springer.com/journal/453

Ranking & Metrics

Discipline name Position Best Scientists Publications D-Index
Mathematics 232 51 94 11
Computer Science 251 148 230 22

Additional Metrics

Number of Best Scientists*: 166
Documents by Best Scientists*: 245
Top 100 Ranked Scientists*: 3
SCIMAGO H-index: 84
SCIMAGO SJR: 0.969
Impact Factor: N/A

Overview

Top Research Topics at Algorithmica?

The primary areas of discussion in Algorithmica are Combinatorics, Theory of computation, Discrete mathematics, Algorithm and Time complexity. Upper and lower bounds and Bounded function are some topics wherein Combinatorics research discussed in the journal have an impact. Upper and lower bounds works presented in Algorithmica have a specific focus on Competitive analysis.

It explores issues in Theory of computation which can be linked to other research areas like Theoretical computer science, Binary logarithm, Computational complexity theory, Set (abstract data type) and Mathematical optimization. Chordal graph, Planar graph, Pathwidth, Vertex (geometry) and Vertex cover are some of the study areas of Discrete mathematics discussed. The Chordal graph study tackled is a key component of adjacent topics in the area of Indifference graph.

Many of the studies tackled connect Algorithm with a similar field of study like Data structure.

  • Combinatorics (58.86%)
  • Theory of computation (49.37%)
  • Discrete mathematics (36.10%)

What are the most cited papers published in the journal?

  • On-line construction of suffix trees (1299 citations)
  • Approximation Algorithms for Connected Dominating Sets (1000 citations)
  • A sweepline algorithm for Voronoi diagrams (983 citations)

Research areas of the most cited articles at Algorithmica:

The most cited papers mainly deal with areas of study such as Combinatorics, Theory of computation, Discrete mathematics, Algorithm and Time complexity. The journal papers explore topics in Combinatorics which can be helpful for research in disciplines like Computational complexity theory and Upper and lower bounds. The most cited publications facilitate discussions on Theory of computation that incorporate concepts from other fields like Theoretical computer science, Simple (abstract algebra), Mathematical optimization, Computational geometry and Data structure.

What topics the last edition of the journal is best known for?

  • Algorithm
  • Artificial intelligence
  • Statistics

The previous edition focused in particular on these issues:

The journal was organized to reinforce research efforts on Combinatorics, Theory of computation, Parameterized complexity, Discrete mathematics and Time complexity. Algorithmica focuses on Combinatorics but the discussions also offer insight into other areas such as Upper and lower bounds and Set (abstract data type). The Theory of computation research presented falls under the domain of Algorithm.

In addition to Algorithm research, Algorithmica aims to explore topics under Evolutionary algorithm and Polynomial. Some problems in Discrete mathematics that were presented in the journal overlapped with concepts under Algorithmics, Approximation algorithm, Constraint (information theory) and Nash equilibrium. The featured Time complexity studies mainly concentrate on Vertex (graph theory) but also cover areas of interest in Graph coloring.

The most cited articles from the last journal are:

  • Runtime Analysis for Self-adaptive Mutation Rates (8 citations)
  • Universal Reconfiguration of Facet-Connected Modular Robots by Pivots: The O(1) Musketeers (6 citations)
  • The Complex Parameter Landscape of the Compact Genetic Algorithm (5 citations)

Papers citation over time

A key indicator for each journal is its effectiveness in reaching other researchers with the papers published at that venue.

The chart below presents the interquartile range (first quartile 25%, median 50% and third quartile 75%) of the number of citations of articles over time.

The top authors publishing in Algorithmica (based on the number of publications) are:

  • Saket Saurabh (31 papers) published 3 papers at the last edition, 2 less than at the previous edition,
  • Fedor V. Fomin (24 papers) published 1 paper at the last edition the same number as at the previous edition,
  • Leah Epstein (22 papers) published 1 paper at the last edition,
  • Kurt Mehlhorn (21 papers) absent at the last edition,
  • Hans L. Bodlaender (19 papers) absent at the last edition.

The overall trend for top authors publishing in this journal is outlined below. The chart shows the number of publications at each edition of the journal for top authors.

Only papers with recognized affiliations are considered

The top affiliations publishing in Algorithmica (based on the number of publications) are:

  • Max Planck Society (111 papers) published 2 papers at the last edition, 1 more than at the previous edition,
  • Tel Aviv University (87 papers) published 1 paper at the last edition, 2 less than at the previous edition,
  • IBM (83 papers) absent at the last edition,
  • Technion – Israel Institute of Technology (79 papers) published 2 papers at the last edition the same number as at the previous edition,
  • University of Waterloo (76 papers) published 3 papers at the last edition the same number as at the previous edition.

The overall trend for top affiliations publishing in this journal is outlined below. The chart shows the number of publications at each edition of the journal for top affiliations.

Publication chance based on affiliation

The publication chance index shows the ratio of articles published by the best research institutions in the journal edition to all articles published within that journal. The best research institutions were selected based on the largest number of articles published during all editions of the journal.

The chart below presents the percentage ratio of articles from top institutions (based on their ranking of total papers).Top affiliations were grouped by their rank into the following tiers: top 1-10, top 11-20, top 21-50, and top 51+. Only articles with a recognized affiliation are considered.

During the most recent 2021 edition, 5.83% of publications had an unrecognized affiliation. Out of the publications with recognized affiliations, 16.81% were posted by at least one author from the top 10 institutions publishing in the journal. Another 16.81% included authors affiliated with research institutions from the top 11-20 affiliations. Institutions from the 21-50 range included 17.70% of all publications and 48.67% were from other institutions.

Returning Authors Index

A very common phenomenon observed among researchers publishing scientific articles is the intentional selection of journals they have already attended in the past. In particular, it is worth analyzing the case when the authors participate in the same journal from year to year.

The Returning Authors Index presented below illustrates the ratio of authors who participated in both a given as well as the previous edition of the journal in relation to all participants in a given year.

Returning Institution Index

The graph below shows the Returning Institution Index, illustrating the ratio of institutions that participated in both a given and the previous edition of the conference in relation to all affiliations present in a given year.

The experience to innovation index

Our experience to innovation index was created to show a cross-section of the experience level of authors publishing in a journal. The index includes the authors publishing at the last edition of a journal, grouped by total number of publications throughout their academic career (P) and the total number of citations of these publications ever received (C).

The group intervals were selected empirically to best show the diversity of the authors' experiences, their labels were selected as a convenience, not as judgment. The authors were divided into the following groups:

  • Novice - P < 5 or C < 25 (the number of publications less than 5 or the number of citations less than 25),
  • Competent - P < 10 or C < 100 (the number of publications less than 10 or the number of citations less than 100),
  • Experienced - P < 25 or C < 625 (the number of publications less than 25 or the number of citations less than 625),
  • Master - P < 50 or C < 2500 (the number of publications less than 50 or the number of citations less than 2500),
  • Star - P ≥ 50 and C ≥ 2500 (both the number of publications greater than 50 and the number of citations greater than 2500).

The chart below illustrates experience levels of first authors in cases of publications with multiple authors.

Top Publications

  • Runtime Analysis for Self-adaptive Mutation Rates

    Benjamin Doerr;Carsten Witt;Jing Yang

    (2021)
    91 Citations
  • Self-Adjusting Mutation Rates with Provably Optimal Success Rules

    Benjamin Doerr;Carola Doerr;Johannes Lengler

    (2021)
    57 Citations
  • Multiplicative Up-Drift

    Benjamin Doerr;Timo Kötzing

    (2021)
    57 Citations
  • Stable Matching with Uncertain Linear Preferences

    Haris Aziz;Péter Biró;Serge Gaspers;Ronald de Haan

    (2020)
    48 Citations
  • The Runtime of the Compact Genetic Algorithm on Jump Functions

    Benjamin Doerr

    (2021)
    44 Citations
  • On the Tractability of Optimization Problems on H -Graphs

    Fedor V. Fomin;Petr A. Golovach;Jean-Florent Raymond

    (2020)
    39 Citations
  • Privately Outsourcing Exponentiation to a Single Server: Cryptanalysis and Optimal Constructions

    Céline Chevalier;Fabien Laguillaumie;Damien Vergnaud

    (2021)
    38 Citations
  • An Adversarial Model for Scheduling with Testing

    Christoph Dürr;Thomas Erlebach;Nicole Megow;Julie Meißner

    (2020)
    37 Citations
  • Dynamic and Internal Longest Common Substring

    Amihood Amir;Panagiotis Charalampopoulos;Solon P. Pissis;Jakub Radoszewski;Jakub Radoszewski

    (2020)
    35 Citations

Related Online Degrees & Career Pathways

Exploring online education options is a smart step for students interested in computer science careers in the USA. Many choose self paced online college courses to balance their studies with work or personal commitments. This flexibility allows learners to progress at their own speed, which can be crucial for mastering complex computer science topics.

For those looking to advance their expertise, there are a variety of affordable master degree programs available online. These programs offer specialized knowledge with the convenience of remote learning, opening doors to higher-paying roles in software development, cybersecurity, and data science.

Additionally, starting with an associate degrees easiest to get can be an effective way to enter the tech field quickly. These degrees provide foundational skills and enhance employability, especially for roles such as IT support and junior programming positions.

Lastly, selecting a program from accredited online colleges ensures the education meets quality standards, which matters for both knowledge acquisition and future employers. Accreditation also affects transfer credit acceptance and eligibility for financial aid.

Best Scientists Contributing to This Journal