STACS
2007
Springer
13 years 10 months ago
2007
Springer
We study the following problem. Given a weighted planar graph G, assign labels L(v) to vertices so that given L(u), L(v) and L(x) for x ∈ X for any X ⊂ V (G), compute the dist...
STACS
2007
Springer
13 years 10 months ago
2007
Springer
STACS
2007
Springer
13 years 10 months ago
2007
Springer
Abstract. We study computationally hard combinatorial problems arising from the important engineering question of how to maximize the number of connections that can be simultaneous...
STACS
2007
Springer
13 years 10 months ago
2007
Springer
In holographic algorithms, symmetric signatures have been particularly useful. We give a complete characterization of these symmet
STACS
2007
Springer
13 years 10 months ago
2007
Springer
We consider the problem of maintaining aggregates over recent elements of a massive data stream. Motivated by applications involving network data, we consider asynchronous data str...
STACS
2007
Springer
13 years 10 months ago
2007
Springer
We consider deducibility constraints, which are equivalent to particular Diophantine systems, arising in the automatic verification of security protocols, in presence of associati...
STACS
2007
Springer
13 years 10 months ago
2007
Springer
STACS
2007
Springer
13 years 10 months ago
2007
Springer
Abstract. Roughgarden and Sundararajan recently introduced an alternative measure of efficiency for cost sharing mechanisms. We study cost sharing methods for combinatorial optimiz...
STACS
2007
Springer
13 years 10 months ago
2007
Springer
We consider commutative string rewriting systems (Vector Addition Systems, Petri nets), i.e., string rewriting systems in which all pairs of letters commute. We are interested in r...
STACS
2007
Springer
13 years 10 months ago
2007
Springer
In this paper, it is shown that the Feedback Vertex Set problem on unweighted, undirected graphs has a kernel of cubic size. I.e., a polynomial time algorithm is described, that, w...