Result 1 to 20 of 250 total
A new lower bound on the maximum number of satisfied clauses in Max-SAT and its algorithmic applications. (English)
Algorithmica 64, No. 1, 56-68 (2012).
1
Parameterized complexity results for general factors in bipartite graphs with an application to constraint programming. (English)
Algorithmica 64, No. 1, 112-125 (2012).
2
Hypercontractive inequality for pseudo-Boolean functions of bounded Fourier width. (English)
Discrete Appl. Math. 160, No. 15, 2323-2328 (2012).
3
Parameterized study of the test cover problem. (English)
Rovan, Branislav (ed.) et al., Mathematical foundations of computer science 2012. 37th international symposium, MFCS 2012, Bratislava, Slovakia, August 27‒31, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-32588-5/pbk). Lecture Notes in Computer Science 7464, 283-295 (2012).
4
An algorithm for finding input-output constrained convex sets in an acyclic digraph. (English)
J. Discrete Algorithms 13, 47-58 (2012).
5
Constraint satisfaction problems parameterized above or below tight bounds: a survey. (English)
Bodlaender, Hans L. (ed.) et al., The multivariate algorithmic revolution and beyond. Essays dedicated to Michael R. Fellows on the occasion of his 60th birthday. Berlin: Springer (ISBN 978-3-642-30890-1/pbk). Lecture Notes in Computer Science 7370, 257-286 (2012).
6
Efficient local search algorithms for known and new neighborhoods for the generalized traveling salesman problem. (English)
Eur. J. Oper. Res. 219, No. 2, 234-251 (2012).
7
Parameterized Eulerian strong component arc deletion problem on tournaments. (English)
Inf. Process. Lett. 112, No. 6, 249-251 (2012).
8
Parameterized complexity of maxsat above average. (English)
Fernández-Baca, David (ed.), LATIN 2012: Theoretical informatics. 10th Latin American symposium, Arequipa, Peru, April 16‒20, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-29343-6/pbk). Lecture Notes in Computer Science 7256, 184-194 (2012).
9
Every ternary permutation constraint satisfaction problem parameterized above average has a kernel with a quadratic number of variables. (English)
J. Comput. Syst. Sci. 78, No. 1, 151-163 (2012).
10
Simultaneously satisfying linear equations over $\mathbb {F}_2$: MaxLin2 and Max-$r$-Lin2 parameterized above average. (English)
Chakraborthy, Supraik (ed.) et al., IARCS annual conference on foundations of software technology and theoretical computer science (FSTTCS 2011), Mumbai, India, December 12‒14, 2011. Wadern: Schloss Dagstuhl ‒ Leibniz Zentrum für Informatik (ISBN 978-3-939897-34-7). LIPICS ‒ Leibniz International Proceedings in Informatics 13, 229-240, electronic only (2011).
11
Solving MAX-$r$-SAT above a tight lower bound. (English)
Algorithmica 61, No. 3, 638-655 (2011).
12
Kernels for below-upper-bound parameterizations of the hitting set and directed dominating set problems. (English)
Theor. Comput. Sci. 412, No. 41, 5744-5751 (2011).
13
A new bound for 3-satisfiable MaxSat and its algorithmic application. (English)
Owe, Olaf (ed.) et al., Fundamentals of computation theory. 18th international symposium, FCT 2011, Oslo, Norway, August 22‒25, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-22952-7/pbk). Lecture Notes in Computer Science 6914, 138-147 (2011).
14
Parameterized Eulerian strong component arc deletion problem on tournaments. (English)
Comput. Res. Repos. 2011, Article No. 1106.4454 (2011).
15
Parameterized complexity results for general factors in bipartite graphs with an application to constraint programming. (English)
Comput. Res. Repos. 2011, Article No. 1106.3527 (2011).
16
Hypercontractive inequality for pseudo-Boolean functions of bounded Fourier width. (English)
Comput. Res. Repos. 2011, Article No. 1106.1049 (2011).
17
A new bound for 3-satisfiable maxsat and its algorithmic application. (English)
Comput. Res. Repos. 2011, Article No. 1104.2818 (2011).
18
Lower bound for Max-$r$-lin2 and its applications in algorithmics and graph theory. (English)
Comput. Res. Repos. 2011, Article No. 1104.1135 (2011).
19
Local search heuristics for the multidimensional assignment problem. (English)
J. Heuristics 17, No. 3, 201-249 (2011).
20
Result 1 to 20 of 250 total