| 2026 | ICALP | Transducers on Compressed Strings. | Mikolaj Bojanczyk, Markus Lohrey |
| 2026 | LICS | Automata for MSO over Infinite Trees with Quantification over Borel Sets of Branches. | Mikolaj Bojanczyk, Antonio Casares, Sven Manthe, Pawel Parys |
| 2026 | LICS | Low Rank MSO. | Mikolaj Bojanczyk, Michal Pilipczuk, Wojciech Przybyszewski, Marek Sokolowski, Giannos Stamoulis |
| 2026 | LICS | The Finite Length Property of the Rado Graph and Friends. | Jingjie Yang, Mikolaj Bojanczyk, Bartek Klin |
| 2025 | LICS | Graphs of unbounded linear cliquewidth must transduce all trees. | Mikolaj Bojanczyk, Pierre Ohlmann |
| 2024 | ICALP | Function Spaces for Orbit-Finite Sets. | Mikolaj Bojanczyk, L Thnh Dung Nguyn, Rafal Stefanski |
| 2024 | LICS | Rank-decreasing transductions. | Mikolaj Bojanczyk, Pierre Ohlmann |
| 2023 | ICALP | Algebraic Recognition of Regular Functions. | Mikolaj Bojanczyk, L Thnh Dung Nguyn |
| 2023 | LICS | Folding interpretations. | Mikolaj Bojanczyk |
| 2023 | LICS | On the Growth Rates of Polyregular Functions. | Mikolaj Bojanczyk |
| 2022 | LICS | Transducers of polynomial growth. | Mikolaj Bojanczyk |
| 2021 | LICS | Orbit-Finite-Dimensional Vector Spaces and Weighted Register Automata. | Mikolaj Bojanczyk, Bartek Klin, Joshua Moerman |
| 2020 | ICALP | Single-Use Automata and Transducers for Infinite Alphabets. | Mikolaj Bojanczyk, Rafal Stefanski |
| 2020 | LICS | First-order tree-to-tree functions. | Mikolaj Bojanczyk, Amina Doumane |
| 2020 | LICS | Extensions of ω-Regular Languages. | Mikolaj Bojanczyk, Edon Kelmendi, Rafal Stefanski, Georg Zetzsche |
| 2020 | MFCS | Some Remarks on Deciding Equivalence for Graph-To-Graph Transducers. | Mikolaj Bojanczyk, Janusz Schmude |
| 2019 | ICALP | String-to-String Interpretations With Polynomial-Size Output. | Mikolaj Bojanczyk, Sandra Kiefer, Nathan Lhote |
| 2019 | LICS | MSO+∇ is undecidable. | Mikolaj Bojanczyk, Edon Kelmendi, Michal Skrzypczak |
| 2018 | LICS | Regular and First-Order List Functions. | Mikolaj Bojanczyk, Laure Daviaud, Shankara Narayanan Krishna |
| 2018 | LICS | Definable decompositions for graphs of bounded linear cliquewidth. | Mikolaj Bojanczyk, Martin Grohe, Michal Pilipczuk |
| 2018 | LICS | On computability and tractability for infinite sets. | Mikolaj Bojanczyk, Szymon Torunczyk |
| 2017 | ICALP | Orbit-Finite Sets and Their Algorithms (Invited Talk). | Mikolaj Bojanczyk |
| 2017 | ICALP | Which Classes of Origin Graphs Are Generated by Transducers. | Mikolaj Bojanczyk, Laure Daviaud, Bruno Guillon, Vincent Penelle |
| 2017 | ICALP | Emptiness of Zero Automata Is Decidable. | Mikolaj Bojanczyk, Hugo Gimbert, Edon Kelmendi |
| 2017 | STACS | Optimizing Tree Decompositions in MSO. | Mikolaj Bojanczyk, Michal Pilipczuk |
| 2016 | ICALP | Thin MSO with a Probabilistic Path Quantifier. | Mikolaj Bojanczyk |
| 2016 | LICS | Definability equals recognizability for graphs of bounded treewidth. | Mikolaj Bojanczyk, Michal Pilipczuk |
| 2016 | MFCS | Decidable Extensions of MSO. | Mikolaj Bojanczyk |
| 2016 | STACS | The MSO+U Theory of (N, <) Is Undecidable. | Mikolaj Bojanczyk, Pawel Parys, Szymon Torunczyk |
| 2015 | DLT | Recognisable Languages over Monads. | Mikolaj Bojanczyk |
| 2015 | ICALP | Containment of Monadic Datalog Programs via Bounded Clique-Width. | Mikolaj Bojanczyk, Filip Murlak, Adam Witkowski |
| 2015 | LICS | Star Height via Games. | Mikolaj Bojanczyk |
| 2014 | CSL | Decomposition theorems and model-checking for the modal | Mikolaj Bojanczyk, Christoph Dittmann, Stephan Kreutzer |
| 2014 | ICALP | Transducers with Origin Information. | Mikolaj Bojanczyk |
| 2014 | ICALP | Weak MSO+U with Path Quantifiers over Infinite Trees. | Mikolaj Bojanczyk |
| 2014 | ICALP | On the Decidability of MSO+U on Infinite Trees. | Mikolaj Bojanczyk, Tomasz Gogacz, Henryk Michalewski, Michal Skrzypczak |
| 2013 | CALCO | Automata and Algebras for Infinite Words and Trees. | Mikolaj Bojanczyk |
| 2013 | LICS | Turing Machines with Atoms. | Mikolaj Bojanczyk, Bartek Klin, Slawomir Lasota, Szymon Torunczyk |
| 2013 | PODS | Verification of database-driven systems via amalgamation. | Mikolaj Bojanczyk, Luc Segoufin, Szymon Torunczyk |
| 2013 | STACS | Regular languages of thin trees. | Mikolaj Bojanczyk, Tomasz Idziaszek, Michal Skrzypczak |
| 2013 | WoLLIC | Modelling Infinite Structures with Atoms. | Mikolaj Bojanczyk |
| 2012 | ICALP | A Machine-Independent Characterization of Timed Languages. | Mikolaj Bojanczyk, Slawomir Lasota |
| 2012 | ICALP | Regular Languages of Infinite Trees That Are Boolean Combinations of Open Sets. | Mikolaj Bojanczyk, Thomas Place |
| 2012 | ICALP | Toward Model Theory with Data Values. | Mikolaj Bojanczyk, Thomas Place |
| 2012 | POPL | Towards nominal computation. | Mikolaj Bojanczyk, Laurent Braud, Bartek Klin, Slawomir Lasota |
| 2012 | STACS | Weak MSO+U over infinite trees. | Mikolaj Bojanczyk, Szymon Torunczyk |
| 2011 | ICDT | Solutions in XML data exchange. | Mikolaj Bojanczyk, Leszek Aleksander Kolodziejczyk, Filip Murlak |
| 2011 | LICS | Automata with Group Actions. | Mikolaj Bojanczyk, Bartek Klin, Slawomir Lasota |
| 2011 | PODS | Efficient evaluation for a temporal logic on changing XML documents. | Mikolaj Bojanczyk, Diego Figueira |
| 2011 | STACS | Data Monoids. | Mikolaj Bojanczyk |
| 2010 | ICALP | Efficient Evaluation of Nondeterministic Automata Using Factorization Forests. | Mikolaj Bojanczyk, Pawel Parys |
| 2010 | LICS | An Extension of Data Automata that Captures XPath. | Mikolaj Bojanczyk, Slawomir Lasota |
| 2010 | STACS | Beyond omega-Regular Languages. | Mikolaj Bojanczyk |
| 2009 | CONCUR | Algebra for Infinite Forests with an Application to the Temporal Logic EF. | Mikolaj Bojanczyk, Tomasz Idziaszek |
| 2009 | CSL | Algebra for Tree Languages. | Mikolaj Bojanczyk |
| 2009 | DLT | Factorization Forests. | Mikolaj Bojanczyk |
| 2009 | LICS | Wreath Products of Forest Algebras, with Applications to Tree Logics. | Mikolaj Bojanczyk, Howard Straubing, Igor Walukiewicz |
| 2009 | STACS | Weak MSO with the Unbounding Quantifier. | Mikolaj Bojanczyk |
| 2008 | FOSSACS | The Common Fragment of ACTL and LTL. | Mikolaj Bojanczyk |
| 2008 | ICALP | Tree Languages Defined in First-Order Logic with One Quantifier Alternation. | Mikolaj Bojanczyk, Luc Segoufin |
| 2008 | LATA | Tree-Walking Automata. | Mikolaj Bojanczyk |
| 2008 | LICS | Piecewise Testable Tree Languages. | Mikolaj Bojanczyk, Luc Segoufin, Howard Straubing |
| 2008 | PODS | XPath evaluation in linear time. | Mikolaj Bojanczyk, Pawel Parys |
| 2008 | PODS | Effective characterizations of tree logics. | Mikolaj Bojanczyk |
| 2007 | CSL | Forest Expressions. | Mikolaj Bojanczyk |
| 2007 | ICALP | Bounded Depth Data Trees. | Henrik Bjrklund, Mikolaj Bojanczyk |
| 2007 | LICS | Two-way unary temporal logic over trees. | Mikolaj Bojanczyk |
| 2007 | MFCS | Shuffle Expressions and Words with Nested Data. | Henrik Bjrklund, Mikolaj Bojanczyk |
| 2007 | STACS | Reachability in Unions of Commutative Rewriting Systems Is Decidable. | Mikolaj Bojanczyk, Piotr Hoffman |
| 2006 | ICALP | Expressive Power of Pebble Automata. | Mikolaj Bojanczyk, Mathias Samuelides, Thomas Schwentick, Luc Segoufin |
| 2006 | LICS | Bounds in w-Regularity. | Mikolaj Bojanczyk, Thomas Colcombet |
| 2006 | LICS | Two-Variable Logic on Words with Data. | Mikolaj Bojanczyk, Anca Muscholl, Thomas Schwentick, Luc Segoufin, Claire David |
| 2006 | PODS | Two-variable logic on data trees and XML reasoning. | Mikolaj Bojanczyk, Claire David, Anca Muscholl, Thomas Schwentick, Luc Segoufin |
| 2005 | STOC | Tree-walking automata do not recognize all regular languages. | Mikolaj Bojanczyk, Thomas Colcombet |
| 2004 | CONCUR | Characterizing EF and EX Tree Logics. | Mikolaj Bojanczyk, Igor Walukiewicz |
| 2004 | CSL | A Bounding Quantifier. | Mikolaj Bojanczyk |
| 2004 | ICALP | Tree-Walking Automata Cannot Be Determinized. | Mikolaj Bojanczyk, Thomas Colcombet |
| 2002 | ICALP | Two-Way Alternating Automata and Finite Models. | Mikolaj Bojanczyk |
| 2001 | FOSSACS | The Finite Graph Problem for Two-Way Alternating Automata. | Mikolaj Bojanczyk |