1 citations · 2 across the 8 of their papers we have counts for
8 papers
Partial order alignment by adjacencies and breakpoints
Rain Jiang, Kai Jiang, Minghui Jiang
Linearizing two partial orders to maximize the number of adjacencies and minimize the number of breakpoints is APX-hard. This holds even if one of the two partial orders is already…
Vertebrate interval graphs
Rain Jiang, Kai Jiang, Minghui Jiang
A vertebrate interval graph is an interval graph in which the maximum size of a set of independent vertices equals the number of maximal cliques. For any fixed , there is…
Partitioning an interval graph into subgraphs with small claws
Rain Jiang, Kai Jiang, Minghui Jiang
The claw number of a graph is the largest number such that is an induced subgraph of . Interval graphs with claw number at most are cluster graphs when $v…
Caterpillars and alternating paths
Rain Jiang, Kai Jiang, Minghui Jiang
Let (respectively, ) be the maximum number such that any tree with edges can be transformed by contracting edges (respectively, by removing vertices) into a ca…
Disjoint axis-parallel segments without a circumscribing polygon
Rain Jiang, Kai Jiang, Minghui Jiang
We construct a family of 17 disjoint axis-parallel line segments in the plane that do not admit a circumscribing polygon.
Linking disjoint axis-parallel segments into a simple polygon is hard too
Rain Jiang, Kai Jiang, Minghui Jiang
Deciding whether a family of disjoint axis-parallel line segments in the plane can be linked into a simple polygon (or a simple polygonal chain) by adding segments between their en…