WADS
2001
Springer
13 years 9 months ago
2001
Springer
This paper investigates the problem of time-optimum movement planning in two and three dimensions for a point robot which has bounded control velocity through a set of n polygonal...
WADS
2001
Springer
13 years 9 months ago
2001
Springer
Abstract. We develop succinct data structures to represent (i) a sequence of values to support partial sum and select queries and update (changing values) and (ii) a dynamic array ...
WADS
2001
Springer
13 years 9 months ago
2001
Springer
WADS
2001
Springer
13 years 9 months ago
2001
Springer
In this paper we discuss the kinetic maintenance of the Euclidean Voronoi diagram and its dual, the Delaunay triangulation, for a set of moving disks. The most important aspect in ...
WADS
2001
Springer
13 years 9 months ago
2001
Springer
We show that there exists a linear time algorithm for deciding whether a graph of bounded tree-width has clique-width k for some fixed integer k. Communicated by Giuseppe Liotta ...
WADS
2001
Springer
13 years 9 months ago
2001
Springer
WADS
2001
Springer
13 years 9 months ago
2001
Springer
In this paper, we consider the problem of finding a mixed upward planarization of a mixed graph, i.e., a graph with directed and undirected edges. The problem is a generalization...
WADS
2001
Springer
13 years 9 months ago
2001
Springer
Abstract. We describe fully polynomial time approximation schemes for generalized multicommodity flow problems arising in VLSI applications such as Global Routing via Buffer Block...
WADS
2001
Springer
13 years 9 months ago
2001
Springer
Abstract. Many real-time embedded systems involve a collection of independently executing event-driven code blocks, having hard real-time constraints. Portions of such codes when t...
WADS
2001
Springer
13 years 9 months ago
2001
Springer
