We combine the known notion of the edge intersection graphs of paths in a tree with a VLSI
grid layout model to introduce the edge intersection graphs of paths on a grid. Let 𝒫 be a …

We investigate the class of vertex intersection graphs of paths on a grid, and specifically
consider the subclasses that are obtained when each path in the representation has at most k …

GFP (green fluorescent protein) fusion proteins have revolutionized research on protein
dynamics at synapses. However, corresponding analyses usually involve protein expression …

We consider the following problem: Given a complete graph G=(V,E) with a cost on every
edge and a given collection of subsets of V, we have to find a minimum cost spanning tree T …

Edge-intersection graphs of paths in grids are graphs that can be represented such that
vertices are paths in a grid and edges between vertices of the graph exist whenever two grid …

Let P be a collection of nontrivial simple paths on a host tree T. The edge intersection graph
of P, denoted by EPT(P), has vertex set that corresponds to the members of P, and two …

Recent studies indicate that synaptic vesicles (SVs) are continuously interchanged among
nearby synapses at very significant rates. These dynamics and the lack of obvious barriers …

An (h,s,t)-representation of a graph G consists of a collection of subtrees of a tree T, where
each subtree corresponds to a vertex in G, such that (i) the maximum degree of T is at most h, (…

We consider the following complete optimal stars-clustering-tree problem: Given a complete
graph G=(V,E) with a weight on every edge and a collection of subsets of V, we want to find …

In this note, we prove that a collection of single bend paths on a grid, the so‐called B 1
representations, have strong Helly number 4. This corrects a false claim from Ref. [Golumbic et al.…