Discrete Applied Mathematics

Papers
(The H4-Index of Discrete Applied Mathematics is 19. 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-08-01 to 2025-08-01.)
ArticleCitations
Editorial Board53
Corrigendum to “An algorithm to find maximum area polygons circumscribed about a convex polygon” [Discrete Appl. Math. 255 (2019) 98–108]48
Independence, matching and packing coloring of the iterated Mycielskian of graphs43
Flow resistance to resistance ratios in cubic graphs39
Super graphs on groups, II39
On the chromatic number of graphs of odd girth without longer odd holes37
Solution to a problem of Katona on counting cliques of weighted graphs30
Extremal spectral radius of degree-based weighted adjacency matrices of graphs with given order and size28
A new condition on dominated pair degree sum for a digraph to be supereulerian28
Discrete isoperimetric method for bandwidth, pathwidth and treewidth of hypercubes27
Wiener, edge-Wiener, and vertex-edge-Wiener index of Basilica graphs26
Bounded-degree light approximate shortest-path trees in doubling metrics25
Parameterized complexity for iterated type partitions and modular-width24
Erratum to “A rounding theorem for unique binary tomographic reconstruction” [Discrete Appl. Math. 268 (2019) 54–69]23
Graphs with many edge-colorings such that complete graphs are rainbow22
Flip paths between lattice triangulations21
Distinguishing graphs via cycles20
The combinatorics of Motzkin polyominoes20
Graphic lattices made by graph felicitous-type labelings and colorings of topological coding19
Two-disjoint-cycle-cover bipancyclicity of bubble-sort star graphs19
Editorial Board19
0.1337890625