Graph coloring has been employed since the 1980s to efficiently compute sparse Jacobian
and Hessian matrices using either finite differences or automatic differentiation. Several …

Multicellular systems, from bacterial biofilms to human organs, form interfaces (or
boundaries) between different cell collectives to spatially organize versatile functions,. The …

Graph models are extremely useful for a large number of applications as they play an
important role as structuring tools. They allow to model net structures–like roads, computers …

The aim of this article is to motivate and describe the parameter ecology program, which
studies how different parameters contribute to the difficulty of classical problems. We call for …

The interaction among topological defects can induce novel phenomena such as
disclination pairs in liquid crystals and superconducting vortex lattices. Nanoscale …

It is well known that every planar graph contains a vertex of degree at most 5. A theorem of
Kotzig states that every 3-connected planar graph contains an edge whose endvertices …

LinKnot? Knot Theory by Computer provides a unique view of selected topics in knot theory
suitable for students, research mathematicians, and readers with backgrounds in other exact …

Dimensional reduction is a simplification technique that eliminates one or more dimensions
from a boundary value problem. It results in significant computational savings with minimal …

A conspicuous difference between “traditional” philosophy of science and “traditional”
philosophy of mathematics concerns the relative importance of the notion of explanation …

A dynamic channel selection approach for wireless communication networks is provided by
measuring an ineffective communication metric on a currently-used channel. The network …