World's Best Scientists 2026 revealed!
Discrete Mathematics, Algorithms and Applications
H-index 6

Discrete Mathematics, Algorithms and Applications

1793-8309

Published by: World Scientific

https://www.worldscientific.com/worldscinet/dmaa

Ranking & Metrics

Discipline name Position Best Scientists Publications D-Index
Mathematics 463 14 27 6
Computer Science 977 11 11 3

Additional Metrics

Number of Best Scientists*: 26
Documents by Best Scientists*: 36
Top 100 Ranked Scientists*: 1
SCIMAGO H-index: 25
SCIMAGO SJR: 0.271
Impact Factor: 0.4

Overview

Top Research Topics at Discrete Mathematics, Algorithms and Applications?

The main points discussed in the journal deals with Combinatorics, Discrete mathematics, Graph, Vertex (graph theory) and Vertex (geometry). As a part of Discrete Mathematics, Algorithms and Applications, discussions in Combinatorics involve topics like Domination analysis, Dominating set, Connectivity, Chordal graph and Bound graph. Discrete Mathematics, Algorithms and Applications primarily discusses Discrete mathematics topics, particularly Graph power, Indifference graph, Pathwidth, Neighbourhood (graph theory) and Line graph.

It connects research in Graph with the related topic of Chromatic scale.

  • Combinatorics (73.35%)
  • Discrete mathematics (42.39%)
  • Graph (27.57%)

What are the most cited papers published in the journal?

  • ANALYSIS ON THEORETICAL BOUNDS FOR APPROXIMATING DOMINATING SET PROBLEMS (57 citations)
  • MAXIMUM WEIGHT CYCLE PACKING IN DIRECTED GRAPHS, WITH APPLICATION TO KIDNEY EXCHANGE PROGRAMS (51 citations)
  • F-Index of some graph operations (42 citations)

Research areas of the most cited articles at Discrete Mathematics, Algorithms and Applications:

The journal publications are mainly concerned with subjects like Combinatorics, Discrete mathematics, Approximation algorithm, Graph and Vertex (geometry). Issues in Combinatorics were discussed in the most cited articles, taking into consideration concepts from other disciplines like Geometric mean and Rank (linear algebra). Function (mathematics) and Upper and lower bounds are some topics wherein Discrete mathematics research discussed in the most cited publications has an impact.

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

  • Combinatorics
  • Algorithm
  • Algebra

The previous edition focused in particular on these issues:

The scientific interests tackled in Discrete Mathematics, Algorithms and Applications are Combinatorics, Graph, Vertex (graph theory), Graph (abstract data type) and Discrete mathematics. The study of Function (mathematics) and how it intertwines with concepts under NP-complete were explored in the presented Combinatorics research. The journal connects the study in Graph with the closely related area of Chromatic scale.

The work on Vertex (graph theory) tackled in Discrete Mathematics, Algorithms and Applications brings together disciplines like Undirected graph, Order (group theory) and Simple graph. Graph (abstract data type) research presented in Discrete Mathematics, Algorithms and Applications encompasses a variety of subjects, including Path (graph theory), Edge (geometry) and Planar graph. The study on Connectivity presented in the journal intersects with the topics under Simple (abstract algebra).

The most cited articles from the last journal are:

  • Doubly connected bi-domination in graphs (6 citations)
  • Metric dimension of heptagonal circular ladder (6 citations)
  • Total pitchfork domination and its inverse in graphs (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 Discrete Mathematics, Algorithms and Applications (based on the number of publications) are:

  • Weili Wu (17 papers) published 2 papers at the last edition, 1 more than at the previous edition,
  • Sudev Naduvath (12 papers) published 3 papers at the last edition, 2 more than at the previous edition,
  • Seyed Mahmoud Sheikholeslami (12 papers) published 1 paper at the last edition, 1 less than at the previous edition,
  • Jafar Amjadi (11 papers) published 3 papers at the last edition,
  • Yuehua Bu (10 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 Discrete Mathematics, Algorithms and Applications (based on the number of publications) are:

  • Zhejiang Normal University (32 papers) published 6 papers at the last edition, 4 more than at the previous edition,
  • Azarbaijan Shahid Madani University (23 papers) published 10 papers at the last edition, 7 more than at the previous edition,
  • University of Texas at Dallas (21 papers) published 1 paper at the last edition, 2 less than at the previous edition,
  • Manonmaniam Sundaranar University (20 papers) published 3 papers at the last edition, 1 less than at the previous edition,
  • Xinjiang University (20 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 2021 edition, 11.58% of publications had an unrecognized affiliation. Out of the publications with recognized affiliations, 22.62% were posted by at least one author from the top 10 institutions publishing in the journal. Another 8.33% included authors affiliated with research institutions from the top 11-20 affiliations. Institutions from the 21-50 range included 10.71% of all publications and 58.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

  • Bipolar-valued fuzzy soft hyper BCK ideals in hyper BCK algebras

    G. Muhiuddin;Habib Harizavi;Young Bae Jun

    (2020)
    23 Citations
  • Injective edge-coloring of subcubic graphs

    (2021)
    11 Citations
  • Schemes of Propagation Models and Source Estimators for Rumor Source Detection in Online Social Networks: A Short Survey of a Decade of Research

    Rong Jin;Weili Wu

    (2021)
    10 Citations
  • A fast double greedy algorithm for non-monotone DR-submodular function maximization

    Shuyang Gu;Ganquan Shi;Weili Wu;Changhong Lu

    (2020)
    7 Citations
  • Critical concept for double Roman domination in graphs

    Sakineh Nazari-Moghaddam;Lutz Volkmann

    (2020)
    6 Citations
  • L(3,2,1)-Labeling problems on trapezoid graphs

    Sk Amanathulla;Madhumangal Pal

    (2021)
    6 Citations
  • k-Submodular maximization with two kinds of constraints

    Ganquan Shi;Shuyang Gu;Weili Wu

    (2021)
    5 Citations

Related Online Degrees & Career Pathways

For those interested in advancing their education in computer science, numerous flexible online options exist. Many students opt for online PhD programs, which allow for deep specialization while accommodating busy schedules.

If you're looking to boost your credentials quickly, explore one year online masters programs. These intensive degrees provide valuable skills that can accelerate career advancement in tech fields.

Choosing the right degree can impact your earning potential and job prospects. Check out degrees you can get online that pay well to find programs that balance time commitment with high salary outcomes.

For those uncertain about the best path forward, resources highlighting the best degree options offer valuable guidance on aligning your interests with market demand in computer science and related fields.

Best Scientists Contributing to This Journal

Recently Published Articles