Definable operations on weakly recognizable
sets of trees, with Jacques Duparc, Alessandro Facchini, FSTTCS
2011: 363-374
Solutions in XML data exchange, with Mikołaj Bojańczyk and
Leszek A. Kołodziejczyk, ICDT 2011: 102-113
Relational and XML Data Exchange, with Marcelo Arenas, Pablo Barceló, and Leonid Libkin, Morgan & Claypool Publishers 2010
Certain answers for XML queries, with Claire David and Leonid Libkin, PODS 2010: 191-202
On the Tradeoff between Mapping and Querying Power in XML Data Exchange, with Shunichi Amano, Claire David and Leonid Libkin, ICDT 2010
The Wadge Hierarchy of Max-Regular Languages, with Jeremie Cabessa, Jacques Duparc, Alessandro Facchini, FSTTCS 2009: 121-132
Linear Game Automata: Decidable Hierarchy Problems for Stripped-Down Alternating Tree Automata,
with Jacques Duparc and Alessandro Facchini, CSL 2009: 225-239
XML Schema Mappings, with Shunichi Amano and Leonid Libkin, PODS 2009: 33-42
The Wadge Hierarchy of Deterministic Tree Languages,
Logical Methods in Computer Science 4(4): 1-44 (2008)
Effective topological hierarchies of recognizable tree languages, PhD thesis, University of Warsaw, 2008
Weak index vs. Borel rank, STACS 2008: 573-584
On the topological complexity of tree languages, with Andre Arnold, Jacques Duparc, and Damian Niwiński, in:
Erich Graedel, Joerg Flum, Thomas Wilke (eds.),
Logic and Automata: History and Perspectives, Amsterdam University Press 2007, 9-29
On the topological complexity of weakly recognizable tree languages, with Jacques Duparc, FCT 2007: 261-273
The Wadge Hierarchy of Deterministic Tree Languages (extended abstract), ICALP (2) 2006: 408-419
On deciding topological classes of deterministic tree languages,
CSL 2005: 428-442
