We describe efficient algorithms for finding even cycles in undirected graphs. Our main results are the following: (i) For every k ≥ 2, there is an O(V ) time algorithm that decides whether an undirected graph G = (V,E) contains a simple cycle of length 2k and finds one if it does. (ii) There is an O(V ) time algorithm that finds a shortest even cycle in an undirected graph G = (V,E).

Problems of the following kind have been the focus of much recent research in the realm of parameterized complexity: Given an input graph (digraph) on n vertices and a positive integer parameter k, find if there exist k edges (arcs) whose deletion results in a graph that satisfies some specified parity constraints. In particular, when the objective is to obtain a connected graph in which all th...

Electronic Speckle Pattern Interferometry (ESPI) is a highly sensitive optoelectronic whole field technique used for measuring surface displacement strain analysis, surface roughness, surface contour etc. This nondestructive evaluation technique permits measurement of deformations in the micrometer and sub micrometer ranges produced in a test specimen under different loading conditions. In ESPI...

A new technology for music has emerged with unprecedented speed. Just over forty years ago, the first digitally-produced sounds gave pioneering composers from around the world a taste of vast new possibilities. Numerical experiments with sound became a logical extension of compositional interests that were pushing the boundaries of timbre, perception, new instruments and performance techniques,...

Pitch Fork is a prototype of an alternate, actuated digital musical instrument (DMI). It uses 5 infra-red and 4 piezoelectric sensors to control an additive synthesis engine. Iron bars are used as the physical point of contact in interaction with the aim of using this materials natural acoustic properties as a control signal for aspects of the digitally produced sound. This choice of material w...