We study the algorithmic complexity of partitioning the vertex set of a given (di) graph into a
small number of paths. The Path Partition problem (PP) has been studied extensively, as it …

Structural graph parameters, such as treewidth, pathwidth, and clique-width, are a central
topic of study in parameterized complexity. A main aim of research in this area is to …

A dominating set S of graph G is called an r-grouped dominating set if S can be partitioned
into S 1, S 2,…, S k such that the size of each unit S i is r and the subgraph of G induced by S …

We study the Short Path Packing problem which asks, given a graph $ G $, integers $ k $
and $\ell $, and vertices $ s $ and $ t $, whether there exist $ k $ pairwise internally vertex …

Given an undirected graph G and a set A⊆ V (G), an A-path is a path in G that starts and
ends at two distinct vertices of A with intermediate vertices in V (G)⧵ A. An A-path is called …

Motivated by the algorithmic study of 3-dimensional manifolds, we explore the structural
relationship between the JSJ decomposition of a given 3-manifold and its triangulations …

In this work we summarize much of the research conducted by the author since his PhD
defense in the area of structural parameterizations of intractable graph problems. The …

Yaokun Wu's Homepage - 欧宝app官方网站下载 吳耀琨Yaokun Wu Home||Teaching||Papers||Talks||Links
Image Image A. Tian, Y. Wu,Stability of large rainbow intersecting family with product measure …