Related papers: Antiparallel d-stable Traces and a Stronger Versio…

Experiments have reached a monumental capacity for designing and synthesizing microscopic particles for self-assembly, making it possible to precisely control particle concentrations, shapes, and interactions. However, more physical insight…

Persistence diagrams (PDs), often characterized as sets of death and birth of homology class, have been known for providing a topological representation of a graph structure, which is often useful in machine learning tasks. Prior works rely…

The regular polyhedra have the highest order of 3D symmetries and are exceptionally at- tractive templates for (self)-assembly using minimal types of building blocks, from nano-cages and virus capsids to large scale constructions like glass…

Let $P$ be a set of $n \geq 5$ points in convex position in the plane. The path graph $G(P)$ of $P$ is an abstract graph whose vertices are non-crossing spanning paths of $P$, such that two paths are adjacent if one can be obtained from the…

We investigate the computational complexity of finding temporally disjoint paths or walks in temporal graphs. There, the edge set changes over discrete time steps and a temporal path (resp. walk) uses edges that appear at monotonically…

We study the graph-theoretic properties of the trace of random walks on pseudorandom graphs. We show that for any $\varepsilon>0$, there exists a constant $C$ such that the cover time of an $(n,d,\lambda)$-graph $G$ with $d/\lambda\ge C$ is…

DNA and other biopolymers differ from classical polymers due to their torsional stiffness. This property changes the statistical character of their conformations under tension from a classical random walk to a problem we call the `torsional…

Translocation of DNA through a nanopore with embedded electrodes is at the centre of new rapid inexpensive sequencing methods which allow distinguishing the four nucleobases by their different electronic structure. However, the subnanometer…

Self-assembling peptides (SAPs) have the ability to spontaneously assemble into ordered nanostructures enabling the manufacture of "designer" nanomaterials. The reversible molecular association of SAPs has been shown to offer great promise…

We initiate the study of property testing in arbitrary planar graphs. We prove that bipartiteness can be tested in constant time, improving on the previous bound of $\tilde{O}(\sqrt{n})$ for graphs on $n$ vertices. The constant-time…

Multilevel self-assembly involving small structured groups of nano-particles provides new routes to development of functional materials with a sophisticated architecture. Apart from the inter-particle forces, the geometrical shapes and…

We analyze the problem of folding one polyhedron, viewed as a metric graph of its edges, into the shape of another, similar to 1D origami. We find such foldings between all pairs of Platonic solids and prove corresponding lower bounds,…

The 1-2-3 Conjecture, introduced by Karo\'nski, {\L}uczak, and Thomason in 2004, was recently solved by Keusch. This implies that, for any connected graph $G$ different from $K_2$, we can turn $G$ into a locally irregular multigraph $M(G)$,…

An elimination tree of a connected graph $G$ is a rooted tree on the vertices of $G$ obtained by choosing a root $v$ and recursing on the connected components of $G-v$ to obtain the subtrees of $v$. The graph associahedron of $G$ is a…

DNA nanoparticles with three-fold coordination have been observed to self-assemble in experiment into a network equivalent to the hexagonal (6.6.6) tiling, and a network equivalent to the 4.8.8 Archimedean tiling. Both networks are built…

An antidirected trail in a digraph is a trail (a walk with no arc repeated) in which the arcs alternate between forward and backward arcs. An antidirected path is an antidirected trail where no vertex is repeated. We show that it is…

We revisit the Maximum Node-Disjoint Paths problem, the natural optimization version of Node-Disjoint Paths, where we are given a graph $G$, $k$ pairs of vertices $(s_i, t_i)$ and an integer $\ell$, and are asked whether there exist at…

We propose a consistent polynomial-time method for the unseeded node matching problem for networks with smooth underlying structures. Despite widely conjectured by the research community that the structured graph matching problem to be…

Let $D$ be a digraph. A subset $S$ of $V(D)$ is a stable set if every pair of vertices in $S$ is non-adjacent in $D$. A collection of disjoint paths $\mathcal{P}$ of $D$ is a path partition of $V(D)$, if every vertex in $V(D)$ is on a path…

Just like atoms combine into molecules, colloids can self-organize into predetermined structures according to a set of design principles. Controlling valence -- the number of inter-particle bonds -- is a prerequisite for the assembly of…