Covers being one of the most popular form of regularities in strings, have drawn much attention over time. In this paper, we focus on the problem of linear time inference of strings from cover arrays using the least sized alphabet possible. We present an algorithm that can reconstruct a string x over a two-letter alphabet whenever a valid cover array C is given as an input. This algorithm uses ...

This brief paper has two purposes. First, we gauge developments in the study of the Antarctic ice sheet over the last seven years by comparing the contents of this issue with the volume produced from an American Geophysical Union meeting, held in September 1998, on the West Antarctic ice sheet. We focus on the uptake of satellite-based observation; ice-ocean interactions; ice streams as foci of...

A cost-sharing mechanism defines how to share the cost of a service among serviced customers. It solicits bids from potential customers and selects a subset of customers to serve and a price to charge each of them. The mechanism is group-strategyproof if no subset of customers can gain by lying about their values. There is a rich literature that designs group-strategyproof cost-sharing mechanis...

In response to [3] and [4] we prove that the recognition of cover graphs of finite posets is an NP-hard problem.

A linear three-dimensional problem of hydroelastic wave diffraction by a bottom-mounted circular cylinder is analysed. The fluid is of finite depth and is covered by an ice sheet, which is clamped to the cylinder surface. The ice stretches from the cylinder to infinity in all lateral directions. The hydroelastic behaviour of the ice sheet is described by linear elastic plate theory, and the flu...

Min Sum Set Cover and its Generalizations Name: Sungjin Im Affil./Addr. Electrical Engineering and Computer Science, University of California, Merced, CA, USA

We describe an elegant O * (2 k) algorithm for the disjoint compression problem for Odd Cycle Transver-sal based on a reduction to Above Guarantee Vertex Cover. We believe that this algorithm refines the understanding of the Odd Cycle Transversal algorithm by Reed, Smith and Vetta [RSV04].

In this paper we study the set cover games when the elements are selfish agents, each of which has a privately known valuation of receiving the service from the sets, i.e., being covered by some set. Each set is assumed to have a fixed cost. We develop several approximately efficient strategyproof mechanisms that decide, after soliciting the declared bids by all elements, which elements will be...

This paper discusses the complexity of graph pebbling, dealing with both traditional pebbling and the recently introduced game of cover pebbling. Determining whether a configuration is solvable according to either the traditional definition or the cover pebbling definition is shown to be NP -complete. The problem of determining the cover pebbling number for an arbitrary demand configuration is ...