The pathwidth of a graph G is the minimum clique number of H minus one, over all interval supergraphs H of G. We prove in this paper that the PATHWIDTH problem is NP-hard for parti...
Most prior work on information extraction has focused on extracting information from text in digital documents. However, often, the most important information being reported in an...
A tool which can quickly interpret line drawings (with hidden lines removed) of engineering objects as boundary representation CAD models would be of significant benefit in the pr...
We consider the problem of time-constrained scheduling of packets in a communication network. Each packet has, in addition to its source and its destination, a release time and a ...
We aim to reconstruct three-dimensional polyhedral solids from axonometric-like line drawings. A new approach is proposed to make use of planes of mirror symmetry detected in such ...