Editorial Board
Deleting edges to restrict the size of an epidemic in temporal networks
When are emptiness and containment decidable for probabilistic automata?
Regularizing conjunctive features for classification
Bisection of bounded treewidth graphs by convolutions
Descriptive complexity of deterministic polylogarithmic time and space
A Turing kernelization dichotomy for structural parameterizations of F-Minor-Free Deletion
Optimal channel utilization with limited feedback
Nominal syntax with atom substitutions
Bidding mechanisms in graph games
The complexity of reachability in parametric Markov decision processes
On relevant equilibria in reachability games
On temporal graph exploration
Editorial – Special issue on Concurrency Theory (CONCUR 2018)