Related papers: Untangling two systems of noncrossing curves

We consider the task of drawing a graph on multiple horizontal layers, where each node is assigned a layer, and each edge connects nodes of different layers. Known algorithms determine the orders of nodes on each layer to minimize crossings…

A path (cycle) in a $2$-edge-colored multigraph is alternating if no two consecutive edges have the same color. The problem of determining the existence of alternating Hamiltonian paths and cycles in $2$-edge-colored multigraphs is an…

Drawing a graph in the plane with as few crossings as possible is one of the central problems in graph drawing and computational geometry. Another option is to remove the smallest number of vertices or edges such that the remaining graph…

We prove essentially tight lower bounds, conditionally to the Exponential Time Hypothesis, for two fundamental but seemingly very different cutting problems on surface-embedded graphs: the Shortest Cut Graph problem and the Multiway Cut…

We prove a topological extension of Dirac's theorem suggested by Gowers in 2005: for any connected, closed surface $\mathscr{S}$, we show that any two-dimensional simplicial complex on $n$ vertices in which each pair of vertices belongs to…

We prove that each superinjective simplicial map of the complex of curves of a compact, connected, nonorientable surface is induced by a homeomorphism of the surface, if $(g, n) \in \{(1, 0), (1, 1), (2, 0), (2, 1), (3, 0)\}$ or $g + n \geq…

We will describe some results regarding the algorithmic nature of homeomorphism problems for manifolds; in particular, the following theorem. Theorem 1: Every PL or smooth simply connected manifold M^n of dimension n at least 5 can be…

Given positive integers $m_1, m_2, ..., m_n$, and $n$ general points $p_i$ of ${\bf CP}^2$, bounds are given for the least degree $t$ among plane curves passing through each point $p_i$ with multiplicity at least $m_i$, and for the least…

We present some algorithms that provide useful topological information about curves in surfaces. One of the main algorithms computes the geometric intersection number of two properly embedded 1-manifolds $C_1$ and $C_2$ in a compact…

Finite element codes typically use data structures that represent unstructured meshes as collections of cells, faces, and edges, each of which require associated coordinate systems. One then needs to store how the coordinate system of each…

Bipartite graphs model the relationship between two disjoint sets of objects. They have a wide range of applications and are often visualized as a 2-layered drawing, where each set of objects is visualized as a set of vertices (points) on…

A thrackle is a drawing of a graph on a surface such that (i) adjacent edges only intersect at their common vertex; and (ii) nonadjacent edges intersect at exactly one point, at which they cross. Conway conjectured that if a graph with $n$…

Let $N$ be a connected nonorientable surface of genus $g$ with $n$ punctures. Suppose that $g$ is odd and $g+n \geqslant 6$. We prove that the automorphism group of the complex of curves of $N$ is isomorphic to the mapping class group…

We show that a set of $n$ algebraic plane curves of constant maximum degree can be cut into $O(n^{3/2}\operatorname{polylog} n)$ Jordan arcs, so that each pair of arcs intersect at most once, i.e., they form a collection of pseudo-segments.…

Let $\Omega_1,\Omega_2$ be two disjoint open sets in $\mathbf C^n$ whose boundaries share a smooth real hypersurface $M$ as relatively open subsets. Assume that $\Omega_i$ is equipped with a complex structure $J^i$ which is smooth up to…

In this work, we solve the problem of finding non-intersecting paths between points on a plane with a new approach by borrowing ideas from geometric topology, in particular, from the study of polygonal schema in mathematics. We use a…

This is an expository paper, in which we give a summary of some of the joint work of John Luecke and the author on Dehn surgery. We consider the situation where we have two Dehn fillings $M(\alpha)$ and $M(\beta)$ on a given 3-manifold $M$,…

In this paper we introduce and study the concept of nonlocal ordered curvature. In the classical (differential) setting, the problem was introduced by Nirenberg and Li, where they conjectured that if a bounded, smooth surface has its mean…

A classical result of A.D. Alexandrov states that a connected compact smooth $n-$dimensional manifold without boundary, embedded in $\Bbb R^{n+1}$, and such that its mean curvature is constant, is a sphere. Here we study the problem of…

Let $G$ be a simple topological graph and let $\Gamma$ be a polyline drawing of $G$. We say that $\Gamma$ \emph{partially preserves the topology} of $G$ if it has the same external boundary, the same rotation system, and the same set of…