World's Best Scientists 2026 revealed!
SIAM Journal on Discrete Mathematics
H-index 14

SIAM Journal on Discrete Mathematics

0895-4801

Published by: Society for Industrial and Applied Mathematics

https://www.siam.org/publications/journals/siam-journal-on-discrete-mathematics-sidma

Ranking & Metrics

Discipline name Position Best Scientists Publications D-Index
Mathematics 225 72 130 11
Engineering and Technology 1204 14 23 5

Additional Metrics

Number of Best Scientists*: 116
Documents by Best Scientists*: 167
Top 100 Ranked Scientists*: 6
SCIMAGO H-index: 72
SCIMAGO SJR: 1.094
Impact Factor: 1

Overview

Top Research Topics at SIAM Journal on Discrete Mathematics?

The journal covers a variety of subjects, including Discrete mathematics, Combinatorics, Graph, Upper and lower bounds and Conjecture. The Discrete mathematics research presented places emphasis on topics like Vertex (geometry), Time complexity, Bipartite graph, Planar graph and Vertex (graph theory). The journal focused on Combinatorics research but expanded to cover Bounded function.

Some problems in Chordal graph that were presented in the journal overlapped with concepts under Indifference graph and Pathwidth.

  • Discrete mathematics (96.65%)
  • Combinatorics (95.15%)
  • Graph (19.67%)

What are the most cited papers published in the journal?

  • A hierarchy of relaxation between the continuous and convex hull representations (808 citations)
  • Singularity analysis of generating functions (783 citations)
  • Labelling graphs with a condition at distance 2 (600 citations)

Research areas of the most cited articles at SIAM Journal on Discrete Mathematics:

The published articles facilitate discussions on Discrete mathematics, Combinatorics, Graph, Upper and lower bounds and Chordal graph. The most cited papers explore topics in Discrete mathematics which can be helpful for research in disciplines like Bounded function and Approximation algorithm. The most cited publications cover various topics on Combinatorics such as Graph theory, Vertex (geometry), Indifference graph, Vertex (graph theory) and Pathwidth.

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

  • Combinatorics
  • Discrete mathematics
  • Algebra

The previous edition focused in particular on these issues:

SIAM Journal on Discrete Mathematics tackles a plethora of topics, such as Discrete mathematics, Combinatorics, Graph, Graph (abstract data type) and Conjecture. The in-depth study on Discrete mathematics also explores topics in the intersecting field of Class (set theory). Integer, Edge (geometry), Random graph, Bipartite graph and Degree (graph theory) are all topics related to Combinatorics research discussed.

While it focused on Graph, it was also able to explore topics like Chromatic scale, Sequence and Dimension (graph theory). While Graph (abstract data type) is the focus of SIAM Journal on Discrete Mathematics, it also provided insights into the studies of Constant (mathematics), Approximation algorithm, Extremal graph theory and Planar graph. The study of Snark (graph theory) and how it intertwines with concepts under Cubic graph were explored in the presented Conjecture research.

The most cited articles from the last journal are:

  • Sublinear Separators in Intersection Graphs of Convex Shapes (5 citations)
  • Nearly Perfect Matchings in Uniform Hypergraphs (4 citations)
  • Bipartite independence number in graphs with bounded maximum degree (3 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 SIAM Journal on Discrete Mathematics (based on the number of publications) are:

  • Noga Alon (28 papers) absent at the last edition,
  • Alan Frieze (25 papers) published 2 papers at the last edition, 1 more than at the previous edition,
  • Saket Saurabh (22 papers) absent at the last edition,
  • Fedor V. Fomin (20 papers) published 2 papers at the last edition the same number as at the previous edition,
  • Michael Krivelevich (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 SIAM Journal on Discrete Mathematics (based on the number of publications) are:

  • University of Illinois at Urbana–Champaign (32 papers) absent at the last edition,
  • Tel Aviv University (32 papers) absent at the last edition,
  • Carnegie Mellon University (27 papers) absent at the last edition,
  • Technion – Israel Institute of Technology (20 papers) published 1 paper at the last edition,
  • Max Planck Society (20 papers) published 1 paper 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 2021 edition, 95.20% of publications had an unrecognized affiliation. Out of the publications with recognized affiliations, 33.33% were posted by at least one author from the top 10 institutions publishing in the journal. Another 33.33% included authors affiliated with research institutions from the top 11-20 affiliations. Institutions from the 21-50 range included 0.00% of all publications and 33.33% 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

  • Near-Linear Time Algorithm for $n$-Fold ILPs via Color Coding

    Klaus Jansen;Alexandra Lassota;Lars Rohwedder

    (2020)
    35 Citations
  • Towards Lower Bounds on the Depth of ReLU Neural Networks

    (2021)
    35 Citations
  • Sampling in Uniqueness from the Potts and Random-Cluster Models on Random Regular Graphs

    Antonio Blanca;Andreas Galanis;Leslie Ann Goldberg;Daniel Štefankovič

    (2020)
    24 Citations
  • On the Maximum Weight Independent Set Problem in Graphs without Induced Cycles of Length at Least Five

    Maria Chudnovsky;Marcin Pilipczuk;Michał Pilipczuk;Stéphan Thomassé

    (2020)
    22 Citations
  • Counting Partitions inside a Rectangle

    Stephen Melczer;Greta Panova;Robin Pemantle

    (2020)
    21 Citations
  • Fairly Allocating Many Goods with Few Queries

    Hoon Oh;Ariel D. Procaccia;Warut Suksompong

    (2021)
    19 Citations
  • Hitting Minors on Bounded Treewidth Graphs. I. General Upper Bounds

    Julien Baste;Ignasi Sau;Dimitrios M. Thilikos

    (2020)
    15 Citations
  • KERNELIZATION OF GRAPH HAMILTONICITY: Proper H-Graphs

    Steven Chaplick;Fedor V. Fomin;Petr A. Golovach;Dušan Knop

    (2021)
    14 Citations
  • Effective poset inequalities

    (2022)
    14 Citations
  • Large Induced Matchings in Random Graphs

    Oliver Cooley;Nemanja Draganić;Mihyun Kang;Benny Sudakov

    (2021)
    13 Citations

Related Online Degrees & Career Pathways

For those interested in advancing their studies in Computer Science, exploring options through self paced online colleges can offer the flexibility needed to balance education with work or personal commitments. These programs allow students to learn at their own speed, making it easier to stay engaged and progress efficiently.

Cost is often a major consideration. Prospective students should look into affordable graduate schools to find quality education without excessive financial burden. Many reputable institutions now offer budget-friendly online master’s programs tailored to enhance skills and career opportunities in tech fields.

For those just starting out or seeking a quicker entry into the workforce, identifying the associate degrees easiest to get can be beneficial. These programs provide foundational knowledge and practical skills that can lead to immediate job prospects or serve as stepping stones toward higher degrees.

Additionally, it’s crucial to choose programs from online schools with recognized accreditation. Doing so ensures the education you receive meets industry standards and helps maintain credibility with employers and professional networks.

Best Scientists Contributing to This Journal