Given an n-vertex graph and two straight-line planar drawings of the graph that have the same faces and the same outer face, we show that there is a morph (i.e., a continuous transformation) between… (More)

Alamdari et al. [1] showed that given two straight-line planar drawings of a graph, there is a morph between them that preserves planarity and consists of a polynomial number of steps where each step… (More)

We propose a Ramsey theory for binary trees and prove that for every r-coloring of “strong copies” of a small binary tree in a huge complete binary tree T , we can find a strong copy of a large… (More)

The prevalent method for RNA secondary structure prediction for a single sequence is free energy minimization based on the nearest neighbor thermodynamic model (NNTM). One of the least well-developed… (More)

Tanglegrams are special graphs that consist of a pair of rooted binary trees with the same number of leaves, and a perfect matching between the two leaf-sets. These objects are of use in… (More)

As a step towards characterizing the graphs of orthogonally convex polyhedra, we show that for any simple orthogonally convex polyhedron there is an orthoball that is equivalent in the sense that it… (More)

We consider the problem of morphing between two planar drawings of the same triangulated graph, maintaining straight-line planarity. A paper in SODA 2013 gave a morph that consists of O(n) steps… (More)