Join Our Newsletter

COLOGNETWENTE

2008

10 years 2 months ago
2008

Given a set P of n points in the plane, a Manhattan network of P is a network that contains a rectilinear shortest path between every pair of points of P. A minimum Manhattan netw...

CCCG

2008

10 years 2 months ago
2008

In this paper we showed that a p( 2)-center location problem in general networks can be transformed to the well known Klee's measure problem [5]. This resulted in an improved...

CCCG

2008

10 years 2 months ago
2008

Given a set of n points P = {p1, p2, . . . , pn} in the plane, we show how to preprocess P such that for any query line segment L we can report in O(log n) time the smallest enclo...

CCCG

2010

10 years 2 months ago
2010

In this paper we consider a natural extension of the socalled reverse facility location problem which was introduced by Cabello et al. [3]. Given a set of n users and a set of m f...

DGCI

2006

Springer

10 years 3 months ago
2006

Springer

Filling operations are procedures which are used in Discrete Tomography for the reconstruction of lattice sets having some convexity constraints. In [1], an algorithm which perform...

CEC

2008

IEEE

10 years 3 months ago
2008

IEEE

We present a simple framework for dealing with search spaces consisting of permutations. To demonstrate its usefulness, we build upon it a simple (1 + 1)-evolutionary algorithm fo...

CSL

1995

Springer

10 years 5 months ago
1995

Springer

We propose so called contraction free sequent calculi for the three prominent modal logics K, T, and S4. Deduction search in these calculi is shown to provide more eﬃcient decisi...

FPL

2004

Springer

10 years 5 months ago
2004

Springer

We describe algorithmic results for two crucial aspects of allocating resources on computational hardware devices with partial reconfigurability. By using methods from the field of...

FOCS

2004

IEEE

10 years 5 months ago
2004

IEEE

In the cyclic-to-random shuffle, we are given n cards arranged in a circle. At step k, we exchange the k'th card along the circle with a uniformly chosen random card. The pro...

FOCS

2004

IEEE

10 years 5 months ago
2004

IEEE

Questions about order versus disorder in systems and models have been fascinating scientists over the years. In Computer Science, order is intimately related to sorting, commonly ...