Related papers: Antiparallel d-stable Traces and a Stronger Versio…
In micro- and nano-scale systems, particles can be moved by using an external force like gravity or a magnetic field. In the presence of adhesive particles that can attach to each other, the challenge is to decide whether a shape is…
Commensurability oscillations in the magnetotransport of periodically patterned systems, emerging from the interplay of cyclotron orbit and the pattern periodicity, are a benchmark of mesoscopic physics in electron gas systems. Exploiting…
Collapse of the polypeptide backbone is an integral part of protein folding. Using polyglycine as a probe, we explore the nonequilibrium pathways of protein collapse in water. We find that the collapse depends on the competition between…
Self-assembling peptides (SAPs) have shown to offer great promise in therapeutics and have the ability to undergo self-assembly and form ordered nanostructures. However SAP gels are often associated with inherent weak and transient…
Let $G$ be a graph of order $n$. The path decomposition of $G$ is a set of disjoint paths, say $\mathcal{P}$, which cover all vertices of $G$. If all paths are induced paths in $G$, then we say $\mathcal{P}$ is an induced path decomposition…
Polypeptide-based diblock copolymers forming either well-defined self-assembled micelles or vesicles after direct dissolution in water or in dichloromethane, have been studied combining light and neutron scattering with electron microscopy…
We propose a two-body spherically symmetric (isotropic) potential such that particles interacting by the potential self assemble into linear semiflexible polymeric chains without branching. By suitable control of the potential parameters we…
Let $G$ be an undirected network with a distinguished set of terminals $T \subseteq V(G)$ and edge capacities $cap: E(G) \rightarrow \mathbb{R}_+$. By an odd $T$-walk we mean a walk in $G$ (with possible vertex and edge self-intersections)…
Sequence assembly from short reads is an important problem in biology. It is known that solving the sequence assembly problem exactly on a bi-directed de Bruijn graph or a string graph is intractable. However finding a Shortest Double…
Recent advancements in microbiology have motivated the study of the production of nanostructures with applications such as biomedical computing and molecular robotics. One way to construct these structures is to construct branched DNA…
We exactly settle the complexity of graph realization, graph rigidity, and graph global rigidity as applied to three types of graphs: "globally noncrossing" graphs, which avoid crossings in all of their configurations; matchstick graphs,…
In this work we propose Lasagne, a methodology to learn locality and structure aware graph node embeddings in an unsupervised way. In particular, we show that the performance of existing random-walk based approaches depends strongly on the…
Co-assembly of inorganic nanoparticles (NPs) and nanostructured polymer matrix represents an intricate interplay of enthalpic or entropic forces. Particle size largely affects the phase behavior of the nanocomposite. Theoretical studies…
Motivated by a relaxed notion of the celebrated Hamiltonian cycle, this paper investigates its variant, parity Hamiltonian cycle (PHC): A PHC of a graph is a closed walk which visits every vertex an odd number of times, where we remark that…
A directed graph $G$ is upward planar if it admits a planar embedding such that each edge is $y$-monotone. Unlike planarity testing, upward planarity testing is NP-hard except in restricted cases, such as when the graph has the…
We study the graphs formed from instances of the stable matching problem by connecting pairs of elements with an edge when there exists a stable matching in which they are matched. Our results include the NP-completeness of recognizing…
A weakness of next-hop routing is that following a link or router failure there may be no routes between some source-destination pairs, or packets may get stuck in a routing loop as the protocol operates to establish new routes. In this…
We prove a far-reaching strengthening of Szemer\'edi's regularity lemma for intersection graphs of pseudo-segments. It shows that the vertex set of such a graph can be partitioned into a bounded number of parts of roughly the same size such…
A tuple (s1,t1,s2,t2) of vertices in a simple undirected graph is 2-linked when there are two vertex-disjoint paths respectively from s1 to t1 and s2 to t2. A graph is 2-linked when all such tuples are 2-linked. We give a new and simple…
Despite the enormous success of graph neural networks (GNNs), most existing GNNs can only be applicable to undirected graphs where relationships among connected nodes are two-way symmetric (i.e., information can be passed back and forth).…