Related papers: Antiparallel d-stable Traces and a Stronger Versio…
Let $G$ be a graph embedded on a closed surface. We call $G$ a \emph{polyhedral embedding} if all facial walks are cycles, and any two of them are either disjoint or intersect in a single vertex or a single edge. In this paper, we present a…
Artificial nanowalkers are inspired by biomolecular counterparts from living cells, but remain far from comparable to the latter in design principles. The walkers reported to date mostly rely on chemical mechanisms to gain a direction; they…
We address the correspondence search problem among multiple graphs with complex properties while considering the matching consistency. We describe each pair of graphs by combining multiple attributes, then jointly match them in a unified…
We consider the parameterized complexity of the problem of tracking shortest s-t paths in graphs, motivated by applications in security and wireless networks. Given an undirected and unweighted graph with a source s and a destination t,…
We establish the use of dielectrophoresis for the directed parallel assembly of individual flakes and nanoribbons of few-layer graphene into electronic devices. This is a bottom-up approach where source and drain electrodes are…
Let $G$ be a graph with $n$ vertices and maximum degree $d$. Fix some minor-closed property $\mathcal{P}$ (such as planarity). We say that $G$ is $\varepsilon$-far from $\mathcal{P}$ if one has to remove $\varepsilon dn$ edges to make it…
Shape-controlled synthesis of multiply twinned nanostructures is heavily emphasized in nanoscience, in large part due to the desire to control the size, shape, and terminating facets of metal nanoparticles for applications in catalysis.…
Graph embedding has become an increasingly important technique for analyzing graph-structured data. By representing nodes in a graph as vectors in a low-dimensional space, graph embedding enables efficient graph processing and analysis…
This paper aims at a comprehensive understanding on the novel elastic property of double-stranded DNA (dsDNA) discovered very recently through single-molecule manipulation techniques. A general elastic model for double-stranded biopolymers…
Peppytides is a coarse-grained, accurate, physical model of the polypeptide chain. I have shared instructions to make your own polypeptide chain and STL files of Peppytides in MAKE magazine in Jan 2014 issue. However, Peppytides involves a…
Two graphs $G_1=(V,E_1)$ and $G_2=(V,E_2)$ admit a geometric simultaneous embedding if there exists a set of points P and a bijection M: P -> V that induce planar straight-line embeddings both for $G_1$ and for $G_2$. While it is known that…
We consider the polyhedral properties of two spanning tree problems with additional constraints. In the first problem, it is required to find a tree with a minimum sum of edge weights among all spanning trees with the number of leaves less…
In this paper, we study the large-scale structure of dense regular graphs. This involves the notion of robust expansion, a recent concept which has already been used successfully to settle several longstanding problems. Roughly speaking, a…
We study a generalization of strongly regular graphs. We call a graph strongly walk-regular if there is an $\ell >1$ such that the number of walks of length $\ell$ from a vertex to another vertex depends only on whether the two vertices are…
We introduce and study the complexity of Path Packing. Given a graph $G$ and a list of paths, the task is to embed the paths edge-disjoint in $G$. This generalizes the well known Hamiltonian-Path problem. Since Hamiltonian Path is…
We investigate extremal problems for quasirandom hypergraphs. We say that a $3$-uniform hypergraph $H=(V,E)$ is $(d,\eta)$-quasirandom if for any subset $X\subseteq V$ and every set of pairs $P\subseteq V\times V$ the number of pairs…
This work describes a new algorithm for creating a superposition over the edge set of a graph, encoding a quantum sample of the random walk stationary distribution. The algorithm requires a number of quantum walk steps scaling as…
In view of the many quantum field theoretical descriptions of graphene in $2+1$ dimensions, we present another field theoretical feature of graphene, in the presence of defects. Particularly, we shall be interested in gapped graphene in the…
We study the stable matching problem in non-bipartite graphs with incomplete but strict preference lists, where the edges have weights and the goal is to compute a stable matching of minimum or maximum weight. This problem is known to be…
We introduce a two-dimensional lattice model for the description of knotted polymer rings. A polymer configuration is modeled by a closed polygon drawn on the square diagonal lattice, with possible crossings describing pairs of strands of…