Related papers: Computing Covers of Plane Forests
A planar stuffed map is an embedding of a graph into the 2-sphere $S^{2}$, considered up to orientation-preserving homeomorphisms, such that the complement of the graph is a collection of disjoint topologically connected components that are…
Let $\varphi(x_1,\ldots,x_h,y) = u_1x_1 + \cdots + u_hx_h+vy$ be a linear form with nonzero integer coefficients $u_1,\ldots, u_h, v.$ Let $\mathcal{A} = (A_1,\ldots, A_h)$ be an $h$-tuple of finite sets of integers and let $B$ be an…
While the notion of arboricity of a graph is well-known in graph theory, very few results are dedicated to the minimal number of trees covering the edges of a graph, called the tree number of a graph.
We study the problem of decomposing (clustering) a tree with respect to costs attributed to pairs of nodes, so as to minimize the sum of costs for those pairs of nodes that are in the same component (cluster). For the general case and for…
Imprecise measurements of a point set P = (p1, ..., pn) can be modelled by a family of regions F = (R1, ..., Rn), where each imprecise region Ri contains a unique point pi. A retrieval models an accurate measurement by replacing an…
We explore the following problem: given a collection of creases on a piece of paper, each assigned a folding direction of mountain or valley, is there a flat folding by a sequence of simple folds? There are several models of simple folds;…
The Positional Burrows-Wheeler Transform (PBWT) is a fundamental data structure for the efficient representation and analysis of large-scale haplotype panels. For a panel of $h$ sequences $\{S_1, \dots, S_h\}$ over $m$ sites, a key…
It is an open question whether there exists a polynomial-time algorithm for computing the rotation distances between pairs of extended ordered binary trees. The problem of computing the rotation distance between an arbitrary pair of trees,…
For an undirected graph G, we consider the following problems: given a fixed graph H, can we partition the vertices of G into two non-empty sets A and B such that neither the induced graph G[A] nor G[B] contain H (i) as a subgraph? (ii) as…
Given a collection S of subsets of some set U, and M a subset of U, the set cover problem is to find the smallest subcollection C of S such that M is a subset of the union of the sets in C. While the general problem is NP-hard to solve,…
Let $(M,\omega)$ be a geometrically bounded symplectic manifold, $N\subseteq M$ a closed, regular (i.e. "fibering") coisotropic submanifold, and $\phi:M\to M$ a Hamiltonian diffeomorphism. The main result of this article is that the number…
We present a systematic investigation into how tree-decompositions of finite adhesion capture topological properties of the space formed by a graph together with its ends. As main results, we characterise when the ends of a graph can be…
We study problems connected to first-order logic in graphs of bounded twin-width. Inspired by the approach of Bonnet et al. [FOCS 2020], we introduce a robust methodology of local types and describe their behavior in contraction sequences…
We present an efficient solution to the following problem, of relevance in a numerical optimization scheme: calculation of integrals of the type \[\iint_{T \cap \{f\ge0\}} \phi_1\phi_2 \, dx\,dy\] for quadratic polynomials $f,\phi_1,\phi_2$…
The kTree problem is a special case of Subgraph Isomorphism where the pattern graph is a tree, that is, the input is an $n$-node graph $G$ and a $k$-node tree $T$, and the goal is to determine whether $G$ has a subgraph isomorphic to $T$.…
Tropical geometry is a piecewise linear "shadow" of algebraic geometry. It allows for the computation of several cohomological invariants of an algebraic variety. In particular, its application to enumerative algebraic geometry led to…
The $\text{PSL}(4,\mathbb{R})$ Hitchin component of a closed surface group $\pi_1(S)$ consists of holonomies of properly convex foliated projective structures on the unit tangent bundle of $S$. We prove that the leaves of the…
The author has been interested in regions surrounded by real algebraic curves of degree $1$ or $2$ in the plane. The author is mainly interested in their shapes and combinatorics. This is a fundamental and natural problem in mathematics…
In this paper, we present partial results towards a classification of symplectic mapping tori using dynamical properties of wrapped Fukaya categories. More precisely, we construct a symplectic manifold $T_\phi$ associated to a Weinstein…
Suppose we put an $\epsilon$-disk around each lattice point in the plane, and then we rotate this object around the origin for a set $\Theta$ of angles. When do we cover the whole plane, except for a neighborhood of the origin? This is the…