Discrete Applied Mathematics

Article	Citations
FPT algorithms for packing k-safe spanning rooted sub(di)graphs	50
On the Nash number and the diminishing Grundy number of a graph	42
Minimum length word-representants of word-representable graphs	42
Planar median graphs and cubesquare-graphs	37
Mutual-visibility in strong products of graphs via total mutual-visibility	34
An improved algorithm for finding maximum outerplanar subgraphs	24
Minimum Wiener index of triangulations and quadrangulations	24
The degree sequence of the preferential attachment model	22
On a class of m-to-1 functions	22
Rainbow short linear forests in edge-colored complete graph	22
Some results on vulnerability parameters and Wiener-type indices	21
Editorial Board	21
A theoretical investigation on the distinguishers of Salsa and ChaCha	21
Quadratic rotation symmetric Boolean functions	19
A note on generalized semitotal point graphs	19
Assessing the effect of multiple cost changes using reverse set tolerances	17
Preface: 18th Cologne–Twente Workshop on graphs and combinatorial optimization (CTW 2020)	17
Finding k-community structures in special graph classes	17
Sylvester power and weighted sums on the Frobenius set in arithmetic progression	17
Super graphs on groups, II	16
On the average hitting times ofCay	15
Counting independent sets in tricyclic graphs	15
On monophonic position sets in graphs	15
Optimal realizations and the block decomposition of a finite metric space	14
Algorithmic results on locating-total domination in graphs	14

The read once formula of a series–parallel network	14
Word-representability of split graphs generated by morphisms	14
Independence, matching and packing coloring of the iterated Mycielskian of graphs	13
On the hardness of problems around s-clubs on split graphs	13
On enumerating short projected models	12
On coloring a class of claw-free and hole-twin-free graphs	12
The combinatorics of Motzkin polyominoes	12
Distinguishing graphs via cycles	12
Axiomatizing the Public Good Index via merging and new arrival properties	11
Four-searchable biconnected outerplanar graphs	11
Minimum values of the second largest Q-eigenvalue	11
Practical complexities of probabilistic algorithms for solving Boolean polynomial systems	11
Hardness results of global total k-domination problem in graphs	11
Measurement and algorithm for conditional local diagnosis of regular networks under the MM* model	11
Editorial Board	10
Adjacent vertex distinguishing edge choosability of 1-planar graphs with maximum degree at least 23	10
Exact capacitated domination: On the computational complexity of uniqueness	10
Collision-free routing problem with restricted L-path	10
Editorial Board	10
On sum of powers of normalized Laplacian eigenvalues and resistance distances of graphs	10
Envy-freeness and relaxed stability for lower-quotas: A parameterized perspective	10
On chordal and perfect plane near-triangulations	10
Factorization and pseudofactorization of weighted graphs	9
Rich words in the block reversal of a word	9
Counting maximal independent sets in some n-gonal cacti	9
Emerging applications, models and algorithms in combinatorial optimization	9
Eternal dominating sets on digraphs and orientations of graphs	9
Exact and approximate results on the least size of a graph with a given degree set	9
Constructing bounded degree graphs with prescribed degree and neighbor degree sequences	9
The difference between several metric dimension graph invariants	9
A unified construction of weightwise perfectly balanced Boolean functions	9
On three blocks paths P(k	9
Competition graphs of degree bounded digraphs	8
Tree with maximum non-self-centrality number among all trees of fixed order and maximum degree	8
Fractional matching preclusion number of graphs	8
Some further results on the maximal hitting times of trees with some given parameters	8
Editorial Board	8
The vertex Turán density in 3-ary n-cubes	8
The co-secure domination in proper interval graphs	8
The 5-puzzle doubly covers the soccer ball	8
A characterization of well-indumatchable graphs having girth greater than seven	8
Non-trivial t-intersecting separated families	8
Antimagic orientation of subdivided caterpillars	8
A single representative min–max–min robust selection problem with alternatives and budgeted uncertainty	8
On broadcasting time in the model of travelling agents	8
Weighted microscopic image reconstruction	8
Cycle selections	8
On the average hitting times of the squares of cycles	8
Editorial Board	8
The multi-returning secretary problem	8

Stability factor for robust balancing of simple assembly lines under uncertainty	7
Relating dissociation, independence, and matchings	7
Exploring symmetries in cographs: Obtaining spectra and energies	7
Algorithmic aspects of broadcast independence	7
Some local–global phenomena in locally finite graphs	7
Finding kings in tournaments	7
Solution to a conjecture on resistance diameter of lexicographic product of paths	7
On linear layout of bicube and construction of optimal incomplete bicube	7
The minimum ABC index of chemical trees	7
Editorial Board	7
Graph curvature via resistance distance	7
Constructions of (vectorial) bent functions outside the completed Maiorana–McFarland class	7
How far is my network from being edge-based? Proximity measures for edge-basedness of unrooted phylogenetic networks	7
Covering automorphisms and some eigenvalues of a graph	7
Greedy versus recursive greedy: Uncorrelated heuristics for the binary paint shop problem	7
Some results about the inset edge and average distance of trees	7
Rainbow independent sets in graphs with maximum degree two	7
Positive matching decompositions of graphs	7
Factors, spectral radius and toughness in bipartite graphs	7
Exact algorithms for counting 3-colorings of graphs	7
Graphic lattices made by graph felicitous-type labelings and colorings of topological coding	7
Vapnik–Chervonenkis dimension and density on Johnson and Hamming graphs	7
Editorial Board	7
Role coloring bipartite graphs	7
Disproof of a conjecture on the rainbow triangles in arc-colored digraphs	7
The digrundy number of digraphs	7
Security in Sierpiński graphs	7
Polyhedra associated with locating-dominating, open locating-dominating and locating total-dominating sets in graphs	7
Facet-generating procedures for the maximum-impact coloring polytope	7
Characterization of the Jaccard dissimilarity metric and a generalization	7
Graph polynomials and paintability of plane graphs	6
Cubic vertices of minimal bicritical graphs	6
On the diameter and zero forcing number of some graph classes in the Johnson, Grassmann and Hamming association scheme	6
On the conjecture of the r-uniform supertrees with the eight largest	6
Dichotomizing k-vertex-critical 6
Synchronizing dynamic Huffman codes	6
Screw discrete dynamical systems and their applications to exact slow NIM	6
Unicyclic and bicyclic graphs with maximum exponential second Zagreb index	6
Average-case complexity of a branch-and-bound algorithm for Min Dominating Set	6
On injective edge-coloring of graphs with maximum degree 4	6
Editorial Board	6
Rainbow triangles in arc-colored digraphs	6
A note on the minimum size of matching-saturated graphs	6
On CD-chromatic number and its lower bound in some classes of graphs	6
Feedback game on 3-chromatic Eulerian triangulations of surfaces	6
Matroid optimization problems with monotone monomials in the objective	6
The Turán number of the square of a path	6
Pagoda functions for peg solitaire on graphs	6
Note on the eccentricity spectral radius of uniform hypertrees with given diameter	6
Equitable factorizations of edge-connected graphs	6
Editorial Board	6
Maximum bisections of graphs without cycles of length four and five	6
On the chromatic number of powers of subdivisions of graphs	6
Hamiltonian cycles avoiding prescribed arcs in semicomplete digraphs	6
Neighbor connectivity of pancake graphs and burnt pancake graphs	6
Rainbow domination regular graphs that are not vertex transitive	6
Approximation algorithms for some Minimum Postmen Cover Problems	6
Are all pairs of hypomorphic digraphs S-isomorphic?	6
Vectorial bent functions weakly/strongly outside the completed Maiorana–McFarland class	6
Selective dynamic compression	6
Multi-objective matroid optimization with ordinal weights	6
A note on eigenvalue, spectral radius and energy of extended adjacency matrix	6
On nonrepetitive colorings of paths and cycles	6
Every 2-connected {claw, Z2	6
On the generating functions and special functions associated with superoscillations	6
On extremal values of some degree-based topological indices with a forbidden or a prescribed subgraph	5
New results on edge-coloring and total-coloring of split graphs	5
Distributions of statistics on separable permutations	5
Algorithmic enumeration of surrounding polygons	5
Improving the Caro–Wei bound and applications to Turán stability	5
On the semi-proper orientations of graphs	5
Uniqueness and reconstruction of finite lattice sets from their line sums	5
The weighted Mostar index of cacti	5
On sufficient spectral radius conditions for hamiltonicity	5
Super domination: Graph classes, products and enumeration	5
Weighted exchange distance of basis pairs	5
Charging station optimization for balanced electric car sharing	5
A note on Hamilton ℓ-cycle decomposition of complete	5
On the tractability of (k,i	5
Recoloring some hereditary graph classes	5

Independence number and minimum degree for path-factor critical uniform graphs	5
Some new results concerning power graphs and enhanced power graphs of groups	5
Approximation ratio of the min-degree greedy algorithm for Maximum Independent Set on interval and chordal graphs	5
A stability result for Berge-K	5
Computational complexity of covering disconnected multigraphs	5
The oriented chromatic number of the hexagonal grid is 6	5
Enumerating connected induced subgraphs: Improved delay and experimental comparison	5
Independence number and spectral radius of cactus graphs	5
Listing the bonds of a graph in O<	5
Erratum to “A rounding theorem for unique binary tomographic reconstruction” [Discrete Appl. Math. 268 (2019) 54–69]	5
PTASs for secure dominating set in planar graphs and growth-bounded graphs	5
On the rainbow planar Turán number of double stars	5
Extremal spectral radius of degree-based weighted adjacency matrices of graphs with given order and size	5
Efficient enumeration of transversal edge-partitions	5
A note on equitable Hamiltonian cycles	5
On the total version of the covering Italian domination problem	5
Hamiltonicity of covering graphs of trees	5
An improved upper bound for neighbor sum distinguishing edge colorings of graphs	5
Some properties on eccentricity matrices of uniform hypertrees	5
Locally definable vertex set properties are efficiently enumerable	5
Parameterized complexity for iterated type partitions and modular-width	5
On b-greedy colourings and z-colourings	5
New constructions of balanced Boolean functions with the maximum possible Walsh supports	5
A survey on rainbow (vertex-)index of graphs	5
Secure total domination number in maximal outerplanar graphs	5
The gap between the rank of a complex unit gain graph and its underlying graph	5
On some classes of quasi-triangulated graphs	5
Wiener, edge-Wiener, and vertex-edge-Wiener index of Basilica graphs	4
A new condition on dominated pair degree sum for a digraph to be supereulerian	4
A geometric lower bound on the extension complexity of polytopes based on the f	4
Polynomial delay hybrid algorithms to enumerate candidate keys for a relation	4
Location problems with continuous demand and unreliable facilities: Applications of families of incremental Voronoi diagrams	4
Proper vertex-pancyclicity of edge-colored complete graphs without joint monochromatic triangles	4
A type of generalized mesh-star transformation and applications in electrical networks	4
Coupled task scheduling with convex resource consumption functions	4
On leaky forcing and resilience	4
Minimum 2-dominating sets in regular graphs	4
On a conjecture of Schweser and Stiebitz	4
A systematic method of constructing weightwise almost perfectly balanced Boolean functions on an arbitrary number of variables	4
Rainbow independent sets on dense graph classes	4
Revising Johnson’s table for the 21st century	4
On star edge colorings of bipartite and subcubic graphs	4
A note on the minimum inverse sum indeg index of cacti	4
Metric dimension and metric independence number of incidence graphs of symmetric designs	4
On the constructions of resilient Boolean functions with five-valued Walsh spectra and resilient semi-bent functions	4
On vertices of outdegree k in minimally 4
On the pebbling numbers of Flower, Blanuša and Watkins snarks	4
On the Kirchhoff index of a unicyclic graph and the matchings of the subdivision	4
Rooted NNI moves and distance-1 tail moves on tree-based phylogenetic networks	4
Going Wide with the 1-2-3 Conjecture	4
Generalised outerplanar Turán numbers and maximum number of k-vertex	4
Parameterized and exact algorithms for class domination coloring	4
Algorithms for Radon partitions with tolerance	4
Avoidable vertices and edges in graphs: Existence, characterization, and applications	4
On extendability of co-edge-regular graphs	4
A simplified algorithm computing all s-4
Disproofs of two conjectures on no hole anti-n-labeling of graphs	4
The limiting behaviours for the Gutman index, Schultz index, multiplicative degree-Kirchhoff index and additive degree-Kirchhoff index of a random polyphenylene chain	4
The sum necessary to ensure that a degree sequence pair has an A-conn	4
Mixed metric dimension of graphs with edge disjoint cycles	4
Thin edges in the subgraph induced by noncubic vertices of a brace	4
Proper conflict-free coloring of sparse graphs	4
Parameterized algorithms for the Happy Set problem	4
Discrete isoperimetric method for bandwidth, pathwidth and treewidth of hypercubes	4
Facial matchings in plane graphs	4
Gallai–Ramsey numbers for multiple triangles	4
A short note on the sum of k largest distance eigenvalues of bipartit	4
On the Δ-interval and the 4
The advantage of truncated permutations	4
Bounded-degree light approximate shortest-path trees in doubling metrics	4
Reliability evaluation of DQcube based on g-good neighbor and g-component fault pattern	4
Integer k-matchings of graphs: 4
Finding densest k-connected subgraphs	4
A note on the packing chromatic number of lexicographic products	4
The characteristic polynomial of a graph containing loops	4
Exploring algorithmic solutions for the Independent Roman Domination problem in graphs	4
Extensions of results on phylogeny graphs of degree bounded digraphs	3
Corrigendum to “The lower bound of the weightwise nonlinearity profile of a class of weightwise perfectly balanced functions” [Discrete Appl. Math. 297 (2021) 60–70]	3
Editorial Board	3
Investigations on c-boomerang uniformity and perfect nonlinearity	3
Conditional diagnosability of multiprocessor systems based on Cayley graphs generated by transpositions	3
Online 2-stage stable matching	3
Laplacian and Wiener index of extension of zero divisor graph	3
Recursive MDS matrices over finite commutative rings	3
Upper bounds for stabbing simplices by a line	3
Editorial Board	3
Intersection graphs of induced subtrees of any graph and a generalization of chordal graphs	3
Short k-rotation symmetric Boolean functions	3
Cyclic base ordering of certain degenerate graphs	3
Erdös–Gallai-type problems for distance-edge-monitoring numbers	3
Preface: 17th Cologne–Twente Workshop on Graphs and Combinatorial Optimization (CTW 2019)	3
Edges incident with a vertex of degree greater than four and the number of contractible edges in a 4-connected graph	3
On the information ratio of graphs without high-degree neighbors	3
Preface: LAGOS’21 - XI Latin and American Algorithms, Graphs, and Optimization Symposium - São Paulo - Brazil	3
Hardness results of global roman domination in graphs	3