N

• NAASP New Approaches to Approximability of Satisfiable Problems

O

• Optimisation for Game Theory and Machine Learning

P

• Proof complexity and circuit complexity: a unified approach

A

• ALGAME Algorithms, Games, Mechanisms, and the Price of Anarchy

C

• Complexity of Valued Constraints The Complexity of Valued Constraints
• Computational Counting
• Constraint Network Tractability Constraint Network Tractability: Beyond Structure and Language
• Counting of separable functions

D

• Discrete Domains

E

• EAMDWMT Efficient Algorithms for Mechanism Design Without Monetary Transfer
• Edge CSPs Edge Constraint Satisfaction Problems

M

• MCC Mapping the Complexity of Counting

O

• Optimisation of Separable Functions

P

• PowAlgDO Power of Algorithms in Discrete Optimisation