( en | de | ru )

 

Disambiguation of "Yeo, Anders"

Author of the publication

copydeleteadd this publication to your clipboard
Parameterized Complexity of Satisfying Almost All Linear Equations over $F_2$.

, , , and . Theory Comput. Syst., 52 (4): 719-728 (2013)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Zié Yeo

Inho Yeo

Angela Yeo

Hans-Jürgen Yeomans

Kok Leng Yeo

 

Other publications of authors with the same name

Spanning eulerian subdigraphs in semicomplete digraphs., , and . CoRR, (2019)Semicomplete Multipartite Digraphs.. Classes of Directed Graphs, Springer, (2018)Fixed-Parameter Complexity of Minimum Profile Problems., , and . IWPEC, volume 4169 of Lecture Notes in Computer Science, page 60-71. Springer, (2006)The Linear Arrangement Problem Parameterized Above Guaranteed Value., , , and . CIAC, volume 3998 of Lecture Notes in Computer Science, page 356-367. Springer, (2006)A New Lower Bound on the Maximum Number of Satisfied Clauses in Max-SAT and Its Algorithmic Application., , , and . IPEC, volume 6478 of Lecture Notes in Computer Science, page 84-94. Springer, (2010)Fixed-Parameter Tractability of Satisfying beyond the Number of Variables., , , , , and . SAT, volume 7317 of Lecture Notes in Computer Science, page 355-368. Springer, (2012)Hypercontractive Inequality for Pseudo-Boolean Functions of Bounded Fourier Width, and . CoRR, (2011)Minimum Cost Homomorphisms to Semicomplete Bipartite Digraphs, , and . CoRR, (2006)TSP tour domination and Hamilton cycle decompositions of regular digraphs., and . Oper. Res. Lett., 28 (3): 107-111 (2001)An Algorithm for Finding Input-Output Constrained Convex Sets in an Acyclic Digraph., , , , and . WG, volume 5344 of Lecture Notes in Computer Science, page 206-217. (2008)