In this article we study a broad class of integer programming problems in variable dimension. We show that these so-termed n-fold integer programming problems are polynomial time ...
Abstract. A possibility to use the formant features (FF) in the user-dependent isolated word recognition has been investigated. The word recognition was performed using a dynamic t...
In this paper we approach the problem of computing the characteristic polynomial of a matrix from the combinatorial viewpoint. We present several combinatorial characterizations of...
Bidimensionality theory appears to be a powerful framework in the development of meta-algorithmic techniques. It was introduced by Demaine et al. [J. ACM 2005 ] as a tool to obtai...
Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, ...
We study the problem of approximating pseudoBoolean functions by linear pseudo-Boolean functions. Pseudo-Boolean functions generalize ordinary Boolean functions by allowing the fu...
Guoli Ding, Robert F. Lax, Peter P. Chen, Jianhua ...