1. Complexity classes in communication complexity theory
2. Hans L. Bodlaender . A partial k-arboretum of graphs with bounded treewidth. Theor. Comput. Sci., 209(1--2):1--45 , 1998 . Hans L. Bodlaender. A partial k-arboretum of graphs with bounded treewidth. Theor. Comput. Sci., 209(1--2):1--45, 1998.
3. Iovka Boneva and Jean-Marc Talbot . Automata and logics for unranked and unordered trees. In Jürgen Giesl, editor, Term Rewriting and Applications , 16th International Conference, RTA 2005 , volume 3467 , pages 500 -- 515 , 2005 . Iovka Boneva and Jean-Marc Talbot. Automata and logics for unranked and unordered trees. In Jürgen Giesl, editor, Term Rewriting and Applications, 16th International Conference, RTA 2005, volume 3467, pages 500--515, 2005.
4. Nicolas Bousquet , Laurent Feuilloley , and Théo Pierron . Local certification of graph decompositions and applications to minor-free classes . In 25th International Conference on Principles of Distributed Systems, OPODIS 2021 , volume 217 of LIPIcs, pages 22: 1 -- 22 :17, 2021 . Nicolas Bousquet, Laurent Feuilloley, and Théo Pierron. Local certification of graph decompositions and applications to minor-free classes. In 25th International Conference on Principles of Distributed Systems, OPODIS 2021, volume 217 of LIPIcs, pages 22:1--22:17, 2021.
5. J Richard Büchi . Weak second-order arithmetic and finite automata. Mathematical Logic Quarterly, 6(1--6) , 1960 . J Richard Büchi. Weak second-order arithmetic and finite automata. Mathematical Logic Quarterly, 6(1--6), 1960.