259 search results - page 9 / 52 » Some New Directions and Questions in Parameterized Complexit... |
FSTTCS
2010
Springer
13 years 5 months ago
2010
Springer
In the Connected Dominating Set problem we are given as input a graph G and a positive integer k, and are asked if there is a set S of at most k vertices of G such that S is a dom...
ORDER
2010
13 years 5 months ago
2010
Embedding a partially ordered set into a product of chains is a classical way to encode it. Such encodings have been used in various fields such as object oriented programming or ...
SIGACT
2010
13 years 5 months ago
2010
A fundamental question in complexity theory is whether every randomized polynomial time algorithm can be simulated by a deterministic polynomial time algorithm (that is, whether B...
NIME
2005
Springer
14 years 29 days ago
2005
Springer
When learning a classical instrument, people often either take lessons in which an existing body of “technique” is delivered, evolved over generations of performers, or in som...
CSE
2009
IEEE
13 years 11 months ago
2009
IEEE
An important aspect in social computing is the structure of social networks, which build the underlying substrate for the exchange of information. With the growing importance of mi...