We give an algorithm that, given graphs G and H, tests whether H is a minor of G in time
O_H(n^1+o(1)); here, n is the number of vertices of G and the O_H(.)-notation hides factors …

Route planning is ubiquitous and has a profound impact on our daily life. However, the
existing path algorithms tend to produce similar paths between similar OD (Origin …

Ising machines have received growing interest as efficient and hardware-friendly solvers for
combinatorial optimization problems (COPs). They search for the absolute or approximate …

The grid theorem, originally proved in 1986 by Robertson and Seymour in Graph Minors V,
is one of the most central results in the study of graph minors. It has found numerous …

Motivation: Genome-wide haplotype reconstruction from sequence data, or haplotype
assembly, is at the center of major challenges in molecular biology and life sciences. For …

We investigate the computational complexity of finding temporally disjoint paths and walks in
temporal graphs. There, the edge set changes over discrete time steps. Temporal paths and …

This work addresses the balanced connected k-partition problem (BCP k), which is formally
defined as follows. Given a connected graph G=(V, E) with nonnegative weights on the …

We prove an asymptotically tight bound on the extremal density guaranteeing subdivisions
of bounded-degree bipartite graphs with a mild separability condition. As corollaries, we …

We introduce a graph-parametric framework for obtaining obstruction characterizations of
graph parameters with respect to partial ordering relations. For this, we define the notions of …

Clique-width is a well-studied graph parameter owing to its use in understanding algorithmic
tractability: if the clique-width of a graph class ${\cal G} $ is bounded by a constant, a wide …