Andrius Vaicenavičius

Andrius Vaicenavičius

Student, St Anne's College

Themes:

• Algorithms and Complexity Theory

Interests

I am interested in discrete optimisation problems and, in particular, the framework of Valued Constraint Satisfaction Problems (VCSP). My research involves the study of weighted clones, which are closely related to the complexity of VCSP.

Biography

I have obtained BA and MMath degrees in Mathematics at the University of Oxford. My master thesis "A Study of Weighted Clones" was awarded a Gibbs prize as one of the two best Mathematics master thesis at Oxford.

Selected Publications

View AllManage publications

• Minimal Weighted Clones with Boolean Support

  Details about Minimal Weighted Clones with Boolean Support | BibTeX data for Minimal Weighted Clones with Boolean Support | DOI (10.1109/ISMVL.2016.10)

Activities

• Constraint Satisfaction Problems

Supervisors

Peter Jeavons

Thomas Lukasiewicz

Photo not availableColin McDiarmid

Standa Živný