Editorial Board
Complete simulation of automata networks
Deciding semantic finiteness of pushdown processes and first-order grammars w.r.t. bisimulation equivalence
Faster Graph bipartization
Hitting minors on bounded treewidth graphs. III. Lower bounds
Learning the truth vector in high dimensions
Boolean approximate counting CSPs with weak conservativity, and implications for ferromagnetic two-spin
Subexponential algorithms for variants of the homomorphism problem in string graphs