1199 search results - page 9 / 240 » Parameterized Proof Complexity |
ACID
2006
13 years 10 months ago
2006
The r-Regular Induced Subgraph problem asks, given a graph G and a nonnegative integer k, whether G contains an r-regular induced subgraph of size at least k, that is, an induced ...
TJS
2002
13 years 8 months ago
2002
FLAME, the Flexible API for Module-based Environments, is a proposed standard interface for the integration of parameterized hardware generators into high-level design tools. This ...
COLT
1993
Springer
14 years 21 days ago
1993
Springer
We describe three applications in computational learning theory of techniques and ideas recently introduced in the study of parameterized computational complexity. (1) Using param...
MST
2007
13 years 8 months ago
2007
Important variants of the Vertex Cover problem (among others, Connected Vertex Cover, Capacitated Vertex Cover, and Maximum Partial Vertex Cover) have been intensively studied in ...
ALGORITHMICA
2010
13 years 8 months ago
2010
Abstract. We consider the variant of the classical Stable Marriage problem where preference lists can be incomplete and may contain ties. In such a setting, finding a stable matchi...