No. |
Title |
Author |
Year |
---|

1 |
Definable Inapproximability: New Challenges for Duplicator |
Atserias, Albert et al. |
2018 |

2 |
Finite and Algorithmic Model Theory (Dagstuhl Seminar 17361) |
Dawar, Anuj et al. |
2018 |

3 |
Symmetric Circuits for Rank Logic |
Dawar, Anuj et al. |
2018 |

4 |
The Ackermann Award 2017 |
Dawar, Anuj et al. |
2017 |

5 |
The Ackermann Award 2016 |
Coquand, Thierry et al. |
2016 |

6 |
The Graph Isomorphism Problem (Dagstuhl Seminar 15511) |
Babai, László et al. |
2016 |

7 |
A Definability Dichotomy for Finite Valued CSPs |
Dawar, Anuj et al. |
2015 |

8 |
Fixed-parameter Tractable Distances to Sparse Graph Classes |
Bulian, Jannis et al. |
2015 |

9 |
The Ackermann Award 2015 |
Dawar, Anuj et al. |
2015 |

10 |
On Symmetric Circuits and Fixed-Point Logics |
Anderson, Matthew et al. |
2014 |