Let A be the edge-node incidence matrix of a bipartite graph G = (U, V ; E), I be a subset the nodes of G, and b be a vector such that 2b is integral. We consider the following mi...
Abstract: This paper discusses three rectilinear (that is, axis-parallel) covering problems in d dimensions and their variants. The first problem is the Rectilinear Line Cover whe...
Vladimir Estivill-Castro, Apichat Heednacram, Fran...
In this paper we introduce a general strategy for approximating the solution to minimisation problems in random regular graphs. We describe how the approach can be applied to the m...
We investigate here the computational complexity of three natural problems in directed acyclic graphs. We prove their NP Completeness and consider their restrictions to linear orde...
This paper discusses the relation among four problems: graph testing, DNA complex screening, superimposed codes and secure key distribution. We prove a surprising equivalence relat...