We consider a strict k-colouring of a multigraph G as a surjection f from the vertex set of G into a set of colours {1,2,. . . ,k} such that, for every non-pendant vertex x of G, ...
For a directed graph G without loops or parallel edges, let (G) denote the size of the smallest feedback arc set, i.e., the smallest subset X E(G) such that G \ X has no directed...
Recognition of unfamiliar faces can be severely impaired when two pictures of a face are taken from different camera distances. This effect of perspective transformation may be pr...
In this short note, we revisit the so-called Ermakov–Pinney (EP) equation viewing its properties from a physically motivated perspective. We discuss its ties with the Schr¨odin...
A key problem in software engineering is changing the code. We present a sequence of visualizations and visual metaphors designed to help engineers understand and manage the softw...
Stephen G. Eick, Todd L. Graves, Alan F. Karr, Aud...