Related papers: Preprocessing Chains for Fast Dihedral Rotations I…
Let $P$ and $Q$ be simple polygons with $n$ vertices each. We wish to compute triangulations of $P$ and $Q$ that are combinatorially equivalent, if they exist. We consider two versions of the problem: if a triangulation of $P$ is given, we…
As an important physical quantity to understand the internal structure of polymer chains, the structure factor is being studied both in theory and experiment. Theoretically, the structure factor of Gaussian chains have been solved…
Working in the multitape Turing model, we show how to reduce the problem of matrix transposition to the problem of integer multiplication. If transposing an $n \times n$ binary matrix requires $\Omega(n^2 \log n)$ steps on a Turing machine,…
We study the problem of ordered stabbing of $n$ balls (of arbitrary and possibly different radii, no ball contained in another) in $\mathbb{R}^d$, $d \geq 3$, with either a directed line segment or a (directed) polygonal curve. Here, the…
We consider the problem of finding \textit{semi-matching} in bipartite graphs which is also extensively studied under various names in the scheduling literature. We give faster algorithms for both weighted and unweighted case. For the…
The present work deals with the formulation of a Virtual Element Method (VEM) for two dimensional structural problems. The contribution is split in two parts: in part I, the elastic problem is discussed, while in part II [3] the method is…
We introduce an invariant linked to some foundational questions in geometric measure theory and provide bounds on this invariant by decomposing an arbitrary cycle into uniformly rectifiable pieces. Our invariant measures the difficulty of…
Consider the following Online Boolean Matrix-Vector Multiplication problem: We are given an $n\times n$ matrix $M$ and will receive $n$ column-vectors of size $n$, denoted by $v_1,\ldots,v_n$, one by one. After seeing each vector $v_i$, we…
We employ a three-dimensional molecular dynamics to simulate translocation of a polymer through a nanopore driven by an external force. The translocation is investigated for different three pore diameter and two different external forces.…
As an example for the interplay of structure, dynamics, and phase behavior of macromolecular systems, this article focuses on the problem of bottle-brush polymers with either rigid or flexible backbones. On a polymer with chain length…
The correlations between the sequence of monomers in a polymer and its three-dimensional structure is a grand challenge in polymer science and biology. The properties and functions of macromolecules depend on their 3D shape that has…
We define a natural class of range query problems, and prove that all problems within this class have the same time complexity (up to polylogarithmic factors). The equivalence is very general, and even applies to online algorithms. This…
We introduce a notion of $k$-convexity and explore polygons in the plane that have this property. Polygons which are \mbox{$k$-convex} can be triangulated with fast yet simple algorithms. However, recognizing them in general is a 3SUM-hard…
Binary embedding is the problem of mapping points from a high-dimensional space to a Hamming cube in lower dimension while preserving pairwise distances. An efficient way to accomplish this is to make use of fast embedding techniques…
Let $C_{k_1}, \ldots, C_{k_n}$ be cycles with $k_i\geq 2$ vertices ($1\le i\le n$). By attaching these $n$ cycles together in a linear order, we obtain a graph called a polygon chain. By attaching these $n$ cycles together in a cyclic…
We consider the problem of cutting a set of edges on a polyhedral manifold surface, possibly with boundary, to obtain a single topological disk, minimizing either the total number of cut edges or their total length. We show that this…
We present simulation data for the motion of a polymer chain through a regular lattice of impenetrable obstacles (Evans-Edwards model). Chain lengths range from N=20 to N=640, and time up to $10^{7}$ Monte Carlo steps. For $N \geq 160$ we…
We consider several well-studied problems in dynamic algorithms and prove that sufficient progress on any of them would imply a breakthrough on one of five major open problems in the theory of algorithms: 1. Is the 3SUM problem on $n$…
We consider the problem of finding an optimal piecewise linear path (polygonal line) connecting two given points with the possibility of making n turns at some points (the absolute value of each turn angle does not exceed a prescribed…
Various applications of graphs, in particular applications related to finding shortest paths, naturally get inputs with real weights on the edges. However, for algorithmic or visualization reasons, inputs with integer weights would often be…