| No. |
Title |
Author |
Year |
| 1 |
Front Matter, Table of Contents, Preface, Conference Organization |
Berenbrink, Petra et al. |
2023 |
| 2 |
LIPIcs, Volume 254, STACS 2023, Complete Volume |
Berenbrink, Petra et al. |
2023 |
| 3 |
Monadic NIP in Monotone Classes of Relational Structures |
Braunfeld, Samuel et al. |
2023 |
| 4 |
Front Matter, Table of Contents, Preface, Conference Organization |
Dawar, Anuj et al. |
2022 |
| 5 |
LIPIcs, Volume 250, FSTTCS 2022, Complete Volume |
Dawar, Anuj et al. |
2022 |
| 6 |
Lower Bounds for Symmetric Circuits for the Determinant |
Dawar, Anuj et al. |
2022 |
| 7 |
MSO Undecidability for Hereditary Classes of Unbounded Clique Width |
Dawar, Anuj et al. |
2022 |
| 8 |
Extension Preservation in the Finite and Prefix Classes of First Order Logic |
Dawar, Anuj et al. |
2021 |
| 9 |
Game Comonads & Generalised Quantifiers |
Conghaile, Adam Ó et al. |
2021 |
| 10 |
On the Relative Power of Linear Algebraic Approximations of Graph Isomorphism |
Dawar, Anuj et al. |
2021 |
| 11 |
Front Matter, Table of Contents, Preface, Conference Organization |
Czumaj, Artur et al. |
2020 |
| 12 |
LIPIcs, Volume 168, ICALP 2020, Complete Volume |
Czumaj, Artur et al. |
2020 |
| 13 |
Symmetric Arithmetic Circuits |
Dawar, Anuj et al. |
2020 |
| 14 |
Symmetric Computation (Invited Talk) |
Dawar, Anuj |
2020 |
| 15 |
Approximations of Isomorphism and Logics with Linear-Algebraic Operators |
Dawar, Anuj et al. |
2019 |
| 16 |
Definable Inapproximability: New Challenges for Duplicator |
Atserias, Albert et al. |
2018 |
| 17 |
Finite and Algorithmic Model Theory (Dagstuhl Seminar 17361) |
Dawar, Anuj et al. |
2018 |
| 18 |
Symmetric Circuits for Rank Logic |
Dawar, Anuj et al. |
2018 |
| 19 |
The Ackermann Award 2017 |
Dawar, Anuj et al. |
2017 |
| 20 |
The Ackermann Award 2016 |
Coquand, Thierry et al. |
2016 |
| 21 |
The Graph Isomorphism Problem (Dagstuhl Seminar 15511) |
Babai, László et al. |
2016 |
| 22 |
A Definability Dichotomy for Finite Valued CSPs |
Dawar, Anuj et al. |
2015 |
| 23 |
Fixed-parameter Tractable Distances to Sparse Graph Classes |
Bulian, Jannis et al. |
2015 |
| 24 |
The Ackermann Award 2015 |
Dawar, Anuj et al. |
2015 |
| 25 |
On Symmetric Circuits and Fixed-Point Logics |
Anderson, Matthew et al. |
2014 |
| 26 |
The Ackermann Award 2013 |
Dawar, Anuj et al. |
2013 |
| 27 |
Definability of linear equation systems over groups and rings |
Dawar, Anuj et al. |
2012 |
| 28 |
The Ackermann Award 2012 |
Coquand, Thierry et al. |
2012 |
| 29 |
Domination Problems in Nowhere-Dense Classes |
Dawar, Anuj et al. |
2009 |
| 30 |
Structure and Specification as Sources of Complexity |
Dawar, Anuj |
2009 |
