1. Easy problems for tree-decomposable graphs
2. Mikołaj Bojańczyk. Transducers with Origin Information. In Javier Esparza Pierre Fraigniaud Thore Husfeldt and Elias Koutsoupias editors Automata Languages and Programming - 41st International Colloquium ICALP 2014 Copenhagen Denmark July 8-11 2014 Proceedings Part II volume 8573 of Lecture Notes in Computer Science pages 26--37. Springer 2014.
3. Mikołaj Bojańczyk. Languages recognized by finite semigroups and their generalizations to objects such as trees and graphs with an emphasis on definability in monadic second-order logic. https://www.mimuw.edu.pl/~bojan/papers/algebra-26-aug-2020.pdf 2020.
4. Mikołaj Bojańczyk. The category of MSO transductions. CoRR, abs/2305.18039, 2023.
5. Mikołaj Bojańczyk, Martin Grohe, and Michał Pilipczuk. Definable decompositions for graphs of bounded linear cliquewidth. Logical Methods in Computer Science, Volume 17, Issue 1, January 2021.