Discrete Applied Mathematics

Papers
(The H4-Index of Discrete Applied Mathematics is 17. The table below lists those papers that are above that threshold based on CrossRef citation counts [max. 250 papers]. The publications cover those that have been published in the past four years, i.e., from 2021-04-01 to 2025-04-01.)
ArticleCitations
FPT algorithms for packing k-safe spanning rooted sub(di)graphs50
Minimum length word-representants of word-representable graphs44
The degree sequence of the preferential attachment model42
On the Nash number and the diminishing Grundy number of a graph37
Coloring of (P634
On the minimum Kirchhoff index of graphs with a given number of cut vertices24
An inductive proof of Dirac’s theorem on Hamilton cycles24
On the thinness of trees23
Planar median graphs and cubesquare-graphs22
Lower bounds on the integrality ratio of the subtour LP for the traveling salesman problem22
Mutual-visibility in strong products of graphs via total mutual-visibility22
Minimum Wiener index of triangulations and quadrangulations21
An improved algorithm for finding maximum outerplanar subgraphs21
On a class of m-to-1 functions20
Practical complexities of probabilistic algorithms for solving Boolean polynomial systems19
Rainbow short linear forests in edge-colored complete graph19
Editorial Board17
On enumerating short projected models17
Some results on vulnerability parameters and Wiener-type indices17
Independence, matching and packing coloring of the iterated Mycielskian of graphs17
0.11712503433228