We add two minimum level nonplanar (MLNP) patterns for trees to the previous set of tree patterns given by Healy et al. [3]. Neither of these patterns match any of the previous pat...
We show that computing the crossing number of a graph with a given rotation system is NP-complete. This result leads to a new and much simpler proof of Hlinˇen´y’s result, tha...
Michael J. Pelsmajer, Marcus Schaefer, Daniel Stef...
Background: Numerous functional genomics approaches have been developed to study the model organism yeast, Saccharomyces cerevisiae, with the aim of systematically understanding t...
Negar Memarian, Matthew Jessulat, Javad Alirezaie,...
We prove that the crossing number of a graph decays in a “continuous fashion” in the following sense. For any ε > 0 there is a δ > 0 such that for n sufficiently large...