World's Best Scientists 2026 revealed!
Journal of Computer and System Sciences
H-index 15

Journal of Computer and System Sciences

Ranking & Metrics

Discipline name Position Best Scientists Publications D-Index
Mathematics 282 19 28 10
Computer Science 416 69 98 14

Additional Metrics

Number of Best Scientists*: 76
Documents by Best Scientists*: 104
Top 100 Ranked Scientists*: 0
SCIMAGO H-index: 106
SCIMAGO SJR: 1.033
Impact Factor: N/A

Overview

Top Research Topics at Journal of Computer and System Sciences?

The foci of the journal are Discrete mathematics, Combinatorics, Theoretical computer science, Algorithm and Time complexity. The journal facilitates discussions on Discrete mathematics that incorporate concepts from other fields like Computational complexity theory, Bounded function and Set (abstract data type). Journal of Computer and System Sciences holds forums on Combinatorics that merges themes from other disciplines such as Function (mathematics), Upper and lower bounds and Constant (mathematics).

  • Discrete mathematics (42.18%)
  • Combinatorics (32.13%)
  • Theoretical computer science (13.79%)

What are the most cited papers published in the journal?

  • Universal classes of hash functions (2323 citations)
  • Approximation algorithms for combinatorial problems (1972 citations)
  • A theory of type polymorphism in programming (1958 citations)

Research areas of the most cited articles at Journal of Computer and System Sciences:

The published articles tackle a plethora of topics, such as Discrete mathematics, Combinatorics, Algorithm, Theoretical computer science and Time complexity. Discrete mathematics research presented in the most cited papers is mostly focused on the subject of Nondeterministic algorithm. The journal papers explore issues in Combinatorics which can be linked to other research areas like Upper and lower bounds, Turing machine and Constant (mathematics).

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

  • Artificial intelligence
  • Programming language
  • Operating system

The previous edition focused in particular on these issues:

The topics of Combinatorics, Graph (abstract data type), Discrete mathematics, Function (mathematics) and Theoretical computer science are the focal point of discussions in the journal. In the journal, Structure (category theory), Bounded function and Constant (mathematics) are investigated in conjunction with one another to address concerns in Combinatorics research. Some problems in Graph (abstract data type) that were presented in Journal of Computer and System Sciences overlapped with concepts under Digraph, Time complexity, Matching (graph theory), Simple (abstract algebra) and Data structure.

The research on Discrete mathematics tackled can also make contributions to studies in the areas of Computational complexity theory, Quadratic equation and Edit distance. Function (mathematics) research presented in it encompasses a variety of subjects, including Independence (mathematical logic), Information distance, Difference hierarchy and Applied mathematics. The Theoretical computer science research presented in the journal also delves into studies in intersecting subjects like

  • Theme (computing) that intertwine with fields like Polynomial,
  • Stability (learning theory), which have a strong connection to Vertex cover..

The most cited articles from the last journal are:

  • On the Threshold of Intractability (13 citations)
  • The Projection Games Conjecture and the Hardness of Approximation of SSAT and related problems. (3 citations)
  • Single-source shortest paths and strong connectivity in dynamic planar graphs (0 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 Journal of Computer and System Sciences (based on the number of publications) are:

  • Joost Engelfriet (20 papers) absent at the last edition,
  • Sanjay Jain (20 papers) absent at the last edition,
  • Jeffrey D. Ullman (18 papers) absent at the last edition,
  • Fedor V. Fomin (16 papers) absent at the last edition,
  • Christos H. Papadimitriou (16 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 Journal of Computer and System Sciences (based on the number of publications) are:

  • IBM (87 papers) absent at the last edition,
  • Technion – Israel Institute of Technology (64 papers) absent at the last edition,
  • University of California, Berkeley (55 papers) absent at the last edition,
  • University of Waterloo (50 papers) published 1 paper at the last edition,
  • University of Southern California (49 papers) absent at the last 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 2022 edition, 20.00% of publications had an unrecognized affiliation. Out of the publications with recognized affiliations, 6.25% were posted by at least one author from the top 10 institutions publishing in the journal. Another 6.25% included authors affiliated with research institutions from the top 11-20 affiliations. Institutions from the 21-50 range included 18.75% of all publications and 68.75% 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

  • On temporal graph exploration

    Thomas Erlebach;Michael Hoffmann;Frank Kammer

    (2021)
    213 Citations
  • The complexity of finding small separators in temporal graphs

    Philipp Zschoche;Till Fluschnik;Hendrik Molter;Rolf Niedermeier

    (2020)
    84 Citations
  • Temporal vertex cover with a sliding time window

    Eleni C. Akrida;George B. Mertzios;Paul G. Spirakis;Viktor Zamaraev

    (2020)
    59 Citations
  • A trichotomy for regular simple path queries on graphs

    Guillaume Bagan;Angela Bonifati;Benoit Groz

    (2020)
    34 Citations
  • The temporal explorer who returns to the base

    Eleni C. Akrida;George B. Mertzios;Paul G. Spirakis;Paul G. Spirakis;Christoforos L. Raptopoulos

    (2021)
    34 Citations
  • 2-D Tucker is PPA complete

    James Aisenberg;Maria Luisa Bonet;Sam Buss

    (2020)
    32 Citations
  • Computing exact solutions of consensus halving and the Borsuk-Ulam theorem

    Argyrios Deligkas;John Fearnley;Themistoklis Melissourgos;Paul G. Spirakis;Paul G. Spirakis

    (2021)
    30 Citations
  • The complexity of reachability in parametric Markov decision processes

    Sebastian Junges;Joost-Pieter Katoen;Guillermo A. Pérez;Tobias Winkler

    (2021)
    28 Citations
  • Grammar-compressed indexes with logarithmic search time

    Francisco Claude;Gonzalo Navarro;Alejandro Pacheco

    (2021)
    27 Citations
  • Orthogonal planarity testing of bounded treewidth graphs

    (2021)
    26 Citations

Related Online Degrees & Career Pathways

Pursuing a Computer Science degree online offers flexibility and accessibility, but it’s important to consider factors like cost, duration, and career outcomes. Many students explore options that combine affordability and quality, with some programs recognized as the cheapest bachelor degree online, making higher education more accessible without sacrificing value.

For those eager to enter the workforce sooner, fast track bachelor's degree programs provide accelerated paths that can significantly reduce the time needed to graduate while still covering core computer science competencies.

Financial concerns are common, but some online colleges feature no application fee colleges, which can save students money during the application process. Combining this with informed choices about majors could lead students to pursue the easiest college majors with high pay, maximizing return on investment after graduation.

Overall, understanding these pathways allows aspiring computer scientists to make strategic decisions that align with their career goals and financial situations, ensuring a rewarding educational experience.

Best Scientists Contributing to This Journal