Sciweavers

5647 search results - page 339 / 1130
» A word from the editor
Sort
View
DAM
2008
67views more  DAM 2008»
15 years 6 months ago
Extended resolution simulates binary decision diagrams
We prove that binary decision diagrams [1] can be polynomially simulated by the extended resolution rule of [2]. More precisely, for any unsatisfiable formula , there exists an ex...
Nicolas Peltier
DAM
2008
68views more  DAM 2008»
15 years 6 months ago
Parameterized algorithmics for linear arrangement problems
We discuss different variants of linear arrangement problems from a parameterized perspective. More specifically, we concentrate on developing simple search tree algorithms for th...
Henning Fernau
ENTCS
2006
127views more  ENTCS 2006»
15 years 6 months ago
Component Identification Through Program Slicing
This paper reports on the development of specific slicing techniques for functional programs and their use for the identification of possible coherent components from monolithic c...
Nuno F. Rodrigues, Luís Soares Barbosa
157
Voted
CAGD
2007
75views more  CAGD 2007»
15 years 6 months ago
Geometric interpolation by planar cubic polynomial curves
The purpose of this paper is to provide sufficient geometric conditions that imply the existence of a cubic parametric polynomial curve which interpolates six points in the plane....
Jernej Kozak, Marjeta Krajnc
COMBINATORICS
2007
121views more  COMBINATORICS 2007»
15 years 6 months ago
A Bound for Size Ramsey Numbers of Multi-partite Graphs
It is shown that the (diagonal) size Ramsey numbers of complete m-partite graphs Km(n) can be bounded from below by cn22(m−1)n, where c is a positive constant. Key words: Size R...
Yuqin Sun, Yusheng Li