STACS
2010
Springer
15 years 10 months ago
2010
Springer
153
click to vote
STACS
2010
Springer
15 years 10 months ago
2010
Springer
Abstract. The problem of Subgraph Isomorphism is defined as follows: Given a pattern H and a host graph G on n vertices, does G contain a subgraph that is isomorphic to H? Eppstei...
STACS
2010
Springer
15 years 10 months ago
2010
Springer
Research on parameterized algorithmics for NP-hard problems has steadily grown over the last years. We survey and discuss how parameterized complexity analysis naturally develops i...
133
click to vote
STACS
2010
Springer
15 years 10 months ago
2010
Springer
One-counter processes (OCPs) are pushdown processes which operate only on a unary stack alphabet. We study the computational complexity of model checking computation tree logic (CT...
123
click to vote
STACS
2010
Springer
15 years 10 months ago
2010
Springer
We study the online clustering problem where data items arrive in an online fashion. The algorithm maintains a clustering of data items into similarity classes. Upon arrival of v, ...
STACS
2010
Springer
15 years 10 months ago
2010
Springer
122
click to vote
STACS
2010
Springer
15 years 10 months ago
2010
Springer
Let (V, δ) be a finite metric space, where V is a set of n points and δ is a distance function defined for these points. Assume that (V, δ) has a constant doubling dimension d...
123
click to vote
STACS
2010
Springer
15 years 10 months ago
2010
Springer
We revisit several maximization problems for geometric networks design under the non-crossing constraint, first studied by Alon, Rajagopalan and Suri (ACM Symposium on Computation...
123
click to vote
STACS
2010
Springer
15 years 10 months ago
2010
Springer
The degree of a CSP instance is the maximum number of times that a variable may appear in the scope of constraints. We consider the approximate counting problem for Boolean CSPs wi...