MFCS
13 years 11 months ago
2004 Springer 
Abstract. Bidimensionality provides a tool for developing subexponential fixed-parameter algorithms for combinatorial optimization problems on graph families that exclude a minor....
MFCS
13 years 11 months ago
2004 Springer 
We study the problem of optimal preemptive scheduling with respect to a general target function. Given n jobs with associated weights and m ≤ n uniformly related machines, one a...
MFCS
13 years 11 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
13 years 11 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
13 years 11 months ago
2004 Springer |
Theoretical Computer Science