3415 search results - page 271 / 683 » Lower bounds on kernelization |
152
click to vote
SPIRE
2001
Springer
15 years 11 months ago
2001
Springer
We constructively prove the exact distribution of deletion sizes for unavoidable strings, under the reductive decidability method of Zimin and Bean et al. Bounds such as these on ...
184
click to vote
ICALP
1999
Springer
15 years 11 months ago
1999
Springer
We introduce new techniques for studying the structure of partial k-trees. In particular, we show that the complements of partial k-trees provide an intuitively-appealing character...
153
click to vote
STACS
1999
Springer
15 years 11 months ago
1999
Springer
Abstract. In this we paper we consider the version of the classical Towers of Hanoi games where the game-board contains more than three pegs. For k pegs we give a 2Ckn1/(k−2) low...
182
click to vote
ESA
2004
Springer
15 years 10 months ago
2004
Springer
The main contribution of this paper is an optimal bounded space online algorithm for variable-sized multidimensional packing. In this problem, hyperboxes must be packed in ddimens...
189
click to vote
AUTOMATICA
2008
15 years 6 months ago
2008
This paper proposes an algorithm for the characterization of reachable sets of states for continuous-time piecewise affine systems. Given a model of the system and a bounded set o...