ISAAC
2009
Springer
14 years 6 months ago
2009
Springer
ISAAC
2009
Springer
14 years 6 months ago
2009
Springer
Abstract. We investigate the computational complexity of a new combinatorial problem of inferring a smallest possible multi-labeled phylogenetic tree (MUL tree) which is consistent...
ISAAC
2009
Springer
14 years 6 months ago
2009
Springer
Abstract. The theory of multidimensional persistence captures the topology of a multifiltration – a multiparameter family of increasing spaces. Multifiltrations arise naturally...
ISAAC
2009
Springer
14 years 6 months ago
2009
Springer
ISAAC
2009
Springer
14 years 6 months ago
2009
Springer
A range-finding scanner can collect information about the shape of an (unknown) polygonal room in which it is placed. Suppose that a set of scanners returns not only a set of poin...
ISAAC
2009
Springer
14 years 6 months ago
2009
Springer
Abstract. Folding an n × n checkerboard pattern from a square of paper that is white on one side and black on the other has been thought for several years to require a paper squar...
ISAAC
2009
Springer
14 years 6 months ago
2009
Springer
Given m unit disks and n points in the plane, the discrete unit disk cover problem is to select a minimum subset of the disks to cover the points. This problem is NP-hard [11] and ...
ISAAC
2009
Springer
14 years 6 months ago
2009
Springer
The faulty memory RAM presented by Finocchi and Italiano [1] is a variant of the RAM model where the content of any memory cell can get corrupted at any time, and corrupted cells c...
ISAAC
2009
Springer
14 years 6 months ago
2009
Springer
ISAAC
2009
Springer
14 years 6 months ago
2009
Springer
