Author of the publication

Algorithms for the Maximum Hamming Distance Problem.

, and . CSCLP, volume 3419 of Lecture Notes in Computer Science, page 128-141. Springer, (2004)

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.

 

Other publications of authors with the same name

The Power of Linear Programming for Valued CSPs., and . FOCS, page 669-678. IEEE Computer Society, (2012)Tropical Dominating Sets in Vertex-Coloured Graphs., , , , , , , , , and . WALCOM, volume 9627 of Lecture Notes in Computer Science, page 17-27. Springer, (2016)Algorithms for the Maximum Hamming Distance Problem., and . CSCLP, volume 3419 of Lecture Notes in Computer Science, page 128-141. Springer, (2004)Approximability Distance in the Space of H-Colourability Problems, , and . CoRR, (2008)A Microstructure Based Approach to Constraint Satisfaction Optimisation Problems., and . FLAIRS, page 155-160. AAAI Press, (2005)The limits of SDP relaxations for general-valued CSPs., and . LICS, page 1-12. IEEE Computer Society, (2017)Determining the Number of Solutions to Binary CSP Instances., , , and . CP, volume 2470 of Lecture Notes in Computer Science, page 327-340. Springer, (2002)Affine Consistency and the Complexity of Semilinear Constraints., and . MFCS (2), volume 8635 of Lecture Notes in Computer Science, page 420-431. Springer, (2014)Approximability Distance in the Space of H-Colourability Problems., , and . CSR, volume 5675 of Lecture Notes in Computer Science, page 92-104. Springer, (2009)Min CSP on Four Elements: Moving beyond Submodularity., , and . CP, volume 6876 of Lecture Notes in Computer Science, page 438-453. Springer, (2011)