Introduction The COVID‐19 pandemic resulted in a wide variety of adverse consequences,
including disruption of long‐term, human research studies globally. Two long‐term …

The longest path problem is the problem of finding a path of maximum length in a graph.
Polynomial solutions for this problem are known only for small classes of graphs, while it is …

We obtain new polynomial kernels and compression algorithms for Path Cover and Cycle
Cover, the well-known generalizations of the classical Hamiltonian Path and Hamiltonian …

We prove that for all an interval graph is‐Hamilton‐connected if and only if its scattering
number is at most k. This complements a previously known fact that an interval graph has a …

The longest path problem is the problem of finding a path of maximum length in a graph. As
a generalization of the Hamiltonian path problem, it is NP-complete on general graphs and …

A Hamiltonian path of a graph G is a simple path that contains each vertex of G exactly once.
A Hamiltonian cycle of a graph is a simple cycle with the same property. The Hamiltonian …

Graph theory has developed into a very broad field since its introduction by Euler in the 18th
century. Graphs are an intuitively pleasing and flexible method for dealing with relationships …

We define and solve a scheduling problem for operating the continuous steel slab caster
which converts molten steel into slabs. The nature of our problem has an interesting …

A certifying algorithm for a problem is an algorithm that provides a certificate with each
answer that it produces. The certificate is an evidence that can be used to authenticate the …

A path cover of a graph G=(V, E) is a family of vertex-disjoint paths that covers all vertices in
V. Given a graph G, the path cover problem is to find a path cover of minimum cardinality …