The crossing number of a graph is the minimum number of edge intersections in a plane drawing of a graph, where each intersection is counted separately. If instead we count the nu...
Michael J. Pelsmajer, Marcus Schaefer, Daniel Stef...
The LF logical framework codifies a methodology for representing deductive systems, such as programming languages and logics, within a dependently typed λ-calculus. In this meth...
The usefulness of parameterized algorithmics has often depended on what Niedermeier has called, "the art of problem parameterization." In this paper we introduce and expl...
Michael R. Fellows, Serge Gaspers, Frances A. Rosa...
Based on the thermodynamic concept of a reservoir, we investigate a computational model for interaction with unresolved degrees of freedom (a thermal bath). We assume that a finite...
Abstract. The behaviour of critical points of Gaussian scale-space images is mainly described by their creation and annihilation. In existing literature these events are determined...