Finding small simple cycle separators for 2-connected planar graphs
Efficient symbolic analysis of programs
A simple undecidable problem: Existential agreement of inverses of two morphisms on a regular language
Conditional rewrite rules: Confluence and termination
Uniform normal form for general time-bounded complexity classes
Effective choice functions and index sets
Domino-tiling games
First-order logic and star-free sets
“Global” graph problems tend to be intractable
Author index for volume 32