Discrete Mathematics & Theoretical Computer Science

Top Research Topics at Discrete Mathematics & Theoretical Computer Science?

Discrete Mathematics & Theoretical Computer Science mainly tackles studies in Combinatorics, Discrete mathematics, Pure mathematics, Graph and Conjecture. The journal explores issues in Combinatorics which can be linked to other research areas like Upper and lower bounds and Set (abstract data type). The Discrete mathematics study featured in Discrete Mathematics & Theoretical Computer Science draws parallels with the field of Degree (graph theory).

It connects research in Pure mathematics with the related topic of Type (model theory).

• Combinatorics (75.96%)
• Discrete mathematics (35.11%)
• Pure mathematics (14.54%)

What are the most cited papers published in the journal?

• HyperLogLog: the analysis of a near-optimal cardinality estimation algorithm (421 citations)
• On linear layouts of graphs (127 citations)
• Pseudo-BCK Algebras: An Extension of BCK Algebras (114 citations)

Research areas of the most cited articles at Discrete Mathematics & Theoretical Computer Science:

The most cited publications investigate studies in Combinatorics, Discrete mathematics, Pure mathematics, Graph and Bijection. The published papers dive deep in exploring the relationship between the study of Combinatorics and Mathematical proof. Most of the Discrete mathematics studies addressed in the journal articles also intersect with Set (abstract data type).

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

• Combinatorics
• Algebra
• Geometry

The previous edition focused in particular on these issues:

Discrete Mathematics & Theoretical Computer Science is organized to address concerns in the fields of Combinatorics, Permutation, Enumeration, Upper and lower bounds and Class (set theory). Topics in Combinatorics explored in Discrete Mathematics & Theoretical Computer Science were investigated in conjunction with research in Bounded function and Order (ring theory). Discrete Mathematics & Theoretical Computer Science explores topics in Enumeration which can be helpful for research in disciplines like Binary logarithm, Interval (graph theory), Integer sequence and Bijection, injection and surjection.

The concepts on Upper and lower bounds presented in it can also apply to other research fields, including Connection (algebraic framework), Digraph, Degree (graph theory), Girth (graph theory) and Plane (geometry). The studies in Class (set theory) featured incorporate elements of Collapse (topology), Generalization, Tree (descriptive set theory) and A priori and a posteriori. Graph research discussed in Discrete Mathematics & Theoretical Computer Science aim to provide more information in the subject of Discrete mathematics.

The most cited articles from the last journal are:

• Flip-sort and combinatorial aspects of pop-stack sorting (11 citations)
• Generalized Fitch Graphs III: Symmetrized Fitch maps and Sets of Symmetric Binary Relations that are explained by Unrooted Edge-labeled Trees (3 citations)
• Wiener index in graphs with given minimum degree and maximum degree (2 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.

Top authors and change over time

The top authors publishing in Discrete Mathematics & Theoretical Computer Science (based on the number of publications) are:

• Helmut Prodinger (22 papers) absent at the last edition,
• Guy Louchard (16 papers) absent at the last edition,
• Sergi Elizalde (14 papers) absent at the last edition,
• Alois Panholzer (13 papers) absent at the last edition,
• David R. Wood (13 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.

Top affiliations and change over time

Only papers with recognized affiliations are considered

The top affiliations publishing in Discrete Mathematics & Theoretical Computer Science (based on the number of publications) are:

• Massachusetts Institute of Technology (37 papers) absent at the last edition,
• École Polytechnique (36 papers) absent at the last edition,
• University of Paris-Sud (23 papers) absent at the last edition,
• Stellenbosch University (21 papers) absent at the last edition,
• University of Minnesota (18 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, 97.22% of publications had an unrecognized affiliation. Out of the publications with recognized affiliations, 100.00% were posted by at least one author from the top 10 institutions publishing in the journal. Another 0.00% 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 0.00% 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.