Consider a drawing of a graph G in the plane such that crossing edges are coloured differently. The minimum number of colours, taken over all drawings of G, is the classical graph...
We describe two algorithms for static path-planning, with the aim of deriving the trajectory that always maximises the distance of the path from the nearest obstacle. The bubble a...
"This book on applications of logic in the semantic analysis of language pays the
reader the compliment of not assuming anything about what he or she knows (in particular, no...
In this paper we introduce a new framework for geometric modeling that combines implicit and parametric surface representations with volumetric warpings. The framework is based on...
After two decades of research on automated discovery, many principles are shaping up as a foundation of discovery science. In this paper we view discovery science as automation of ...