MFCS
2004
Springer
13 years 10 months ago
2004
Springer
MFCS
2004
Springer
13 years 10 months ago
2004
Springer
We study the on-line versions of two fundamental graph problems, maximum independent set and minimum coloring, for the case of disk graphs which are graphs resulting from intersect...
MFCS
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. This paper deals with updates of XML documents that satisfy a given schema, e.g., a DTD. In this context, when a given update violates the schema, it might be the case th...
MFCS
2004
Springer
13 years 10 months ago
2004
Springer
Let G = (V, E) be a (directed) graph with vertex set V and edge (arc) set E. Given a set P of (source-sink) pairs of vertices of G, an important problem that arises in the computat...
MFCS
2004
Springer
13 years 10 months ago
2004
Springer
We define BACI (Boxed Ambients with Communication Interfaces), an ambient calculus with a flexible communication policy. Traditionally, typed ambient calculi have a fixed commu...
MFCS
2004
Springer
13 years 10 months ago
2004
Springer
Given a fixed computable binary operation , we study the complexity of the following generation problem: The input consists of strings ½ Ò . The question is whether is in the c...