DAM
2007
13 years 11 months ago
2007
DAM
2007
13 years 11 months ago
2007
In 1997 Lampert and Slater introduced parallel knock-out schemes, an iterative process on graphs that goes through several rounds. In each round of this process, every vertex elim...
DAM
2007
13 years 11 months ago
2007
The papers in this special issue originated at SAT 2001, the Fourth International Symposium on the Theory and Applications of Satisfiability Testing. This foreword reviews the cu...
DAM
2007
13 years 11 months ago
2007
Determining the maximum number of D-dimensional spheres of radius r that can be adjacent to a central sphere of radius r is known as the Kissing Number Problem (KNP). The problem ...
DAM
2007
13 years 11 months ago
2007
This note extends results of Fern´andez, Leighton, and L´opez-Presa on the uniqueness of rth roots for disconnected graphs with respect to the Cartesian product to other product...
DAM
2007
13 years 11 months ago
2007
DAM
2007
13 years 11 months ago
2007
Digital planarity is defined by digitizing Euclidean planes in the three-dimensional digital space of voxels; voxels are given either in the grid point or the grid cube model. Th...
DAM
2007
13 years 11 months ago
2007
We point out several security flaws in the cryptosystem based on tree replacement systems proposed by Samuel, Thomas, Abisha and Subramanian at INDOCRYPT 2002. Due to the success...
DAM
2007
13 years 11 months ago
2007
DAM
2007
13 years 11 months ago
2007
We use syntactic monoid methods, together with an enhanced pumping lemma, to investigate the structure of splicing languages. We obtain an algorithm for deciding whether a regular...