Abstract. Settling a ten years open question, we show that the NPcomplete Feedback Vertex Set problem is deterministically solvable in O(ck ·m) time, where m denotes the number of...
Complementing recent progress on classical complexity and polynomial-time approximability of feedback set problems in (bipartite) tournaments, we extend and partially improve fixed...
Published as Technical Report LU-CS-TR:2005-238 on February 13, 2006, ISSN 1650-1276 Report 158, Lund University, Sweden 2006 We discuss and compare four fixed parameter algorithm...
Magdalene G. Borgelt, Christian Borgelt, Christos ...
For a two-variable formula (X, Y ) of Monadic Logic of Order (MLO) the Church Synthesis Problem concerns the existence and construction of an operator Y = F(X) such that (X, F(X)) ...
Abstract. We consider a multicriteria variant for the wellknown partition problem. A formula of the stability radius for an efficient solution was obtained. Mathematics Subject Cl...