research
∙
10/06/2021
Partial order alignment by adjacencies and breakpoints
Linearizing two partial orders to maximize the number of adjacencies and...
share
research
∙
10/02/2021
Decomposing a graph into subgraphs with small components
The component size of a graph is the maximum number of edges in any conn...
research
∙
09/24/2021
Vertebrate interval graphs
A vertebrate interval graph is an interval graph in which the maximum si...
research
∙
09/23/2021
Partitioning an interval graph into subgraphs with small claws
The claw number of a graph G is the largest number v such that K_1,v is ...
research
∙
09/12/2021
Caterpillars and alternating paths
Let p(m) (respectively, q(m)) be the maximum number k such that any tree...
research
∙
09/06/2021
Disjoint axis-parallel segments without a circumscribing polygon
We construct a family of 17 disjoint axis-parallel line segments in the ...
research
∙
09/05/2021
Linking disjoint axis-parallel segments into a simple polygon is hard too
Deciding whether a family of disjoint axis-parallel line segments in the...
research
∙
09/01/2021
Moving intervals for packing and covering
We study several problems on geometric packing and covering with movemen...
research
∙
08/29/2021
Linking disjoint segments into a simple polygon is hard
Deciding whether a family of disjoint line segments in the plane can be ...
research
∙
08/22/2021
