All Research Papers Published In Discrete Applied Mathematics

Research Article
10.1016/j.dam.2026.02.049

Crossing-free monochromatic trees for bicolored point sets

Mar 18, 2026
Discrete Applied Mathematics
José Fernández Goycoolea + 3 more +3

Research Article
10.1016/j.dam.2026.03.011

Ramsey numbers avoiding properly colored cycles

Mar 16, 2026
Discrete Applied Mathematics
Jing Liang + 4 more +4

Research Article
10.1016/j.dam.2026.03.002

On maximally edge-connectivity of squares of graphs

Mar 12, 2026
Discrete Applied Mathematics
Mengfan Chen + 1 more +1

Research Article
10.1016/j.dam.2025.11.021

2-edge-Hamilton-connectedness of complete hypercube-like networks

Mar 01, 2026
Discrete Applied Mathematics
Huimei Guo + 2 more +2

Research Article
10.1016/j.dam.2025.12.009

Complexity of action path finding with small precondition sets

Mar 01, 2026
Discrete Applied Mathematics
Peter Damaschke + 1 more +1

Suppose that we are given a finite set of Boolean attributes and a set of actions defined on them. Every action has the effect of changing some attribute values and may also depend on further attribute values which are, however, not changed. The subset of attributes affected by an action is known as precondition. The goal is to find some sequence of executable actions that transform a given initial state into a desired target state. This type of problem appears, e.g., in robot motion planning. In this paper, we study cases of the problem where the precondition of every action only depends on a conjunction of terms with at most two attributes. We classify a number of cases as polynomial-time solvable or NP-complete. They amount to extended versions of some classic graph problems, among them topological orderings and perfect matchings. This appears to be the first systematic study of preconditions, despite the rich literature on many aspects of path finding in finite state spaces. A complete dichotomy of polynomial-time and NP-complete cases remains an open question.

Research Article
10.1016/j.dam.2025.11.048

Two extremal problems for 4-cycles in 4-partite graphs

Mar 01, 2026
Discrete Applied Mathematics
Zemin Jin + 2 more +2

Research Article
10.1016/j.dam.2025.11.044

Colorful two-piercing theorem for boxes

Mar 01, 2026
Discrete Applied Mathematics
Sourav Chakraborty + 2 more +2

Research Article
10.1016/j.dam.2025.11.015

The <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="d1e608" altimg="si8.svg"> <mml:mi>ϵ</mml:mi> </mml:math> -spectral radii of <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="d1e613" altimg="si9.svg"> <mml:mi>k</mml:mi> </mml:math> -uniform hypertrees

Mar 01, 2026
Discrete Applied Mathematics
Weimin Li + 3 more +3

Research Article
10.1016/j.dam.2025.12.024

<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="d1e44" altimg="si6.svg"> <mml:mrow> <mml:mo>(</mml:mo> <mml:mi>t</mml:mi> <mml:mo>,</mml:mo> <mml:mi>r</mml:mi> <mml:mo>)</mml:mo> </mml:mrow> </mml:math> -Broadcast Domination in graphs

Mar 01, 2026
Discrete Applied Mathematics
Gennaro Cordasco + 2 more +2

Research Article
10.1016/j.dam.2025.11.050

The lower bounds of 4-tree connectivity of Cartesian product graphs

Mar 01, 2026
Discrete Applied Mathematics
Lin Li + 4 more +4