Complexity of Typechecking XML Views of Relational Databases. - Piotr Wieczorek (ICDT, 2007)

Modulo Constraints and the Complexity of Typechecking XML Views. - Jerzy Marcinkowski; Piotr Wieczorek (Theory Comput. Syst., 2009)

Learning XML Twig Queries - Slawomir Staworko; Piotr Wieczorek (CoRR, 2011)

Learning twig and path queries. - Slawek Staworko; Piotr Wieczorek (ICDT, 2012)

On Injective Embeddings of Tree Patterns - Jakub Michaliszyn; Anca Muscholl; Slawek Staworko; Piotr Wieczorek; Zhilin Wu (CoRR, 2012)

Query Processing in Data Integration. - Paolo Guagliardo; Piotr Wieczorek (Data Exchange, Information, and Streams, 2013)

Characterizing XML Twig Queries with Examples. - Slawek Staworko; Piotr Wieczorek (ICDT, 2015)

Querying Data Graphs with Arithmetical Regular Expressions. - Maciej Grabon; Jakub Michaliszyn; Jan Otop; Piotr Wieczorek (IJCAI, 2016)

Querying Best Paths in Graph Databases. - Jakub Michaliszyn; Jan Otop; Piotr Wieczorek (FSTTCS, 2017)

Containment of Shape Expression Schemas for RDF. - Slawek Staworko; Piotr Wieczorek (PODS, 2019)

Inference of Shape Expression Schemas Typed RDF Graphs. - Benoît Groz; Aurélien Lemay; Slawek Staworko; Piotr Wieczorek (CoRR, 2021)

Modular Path Queries with Arithmetic. - Jakub Michaliszyn; Jan Otop; Piotr Wieczorek (Log. Methods Comput. Sci., 2021)

Inference of Shape Graphs for Graph Databases. - Benoît Groz; Aurélien Lemay; Slawek Staworko; Piotr Wieczorek (ICDT, 2022)

Reachability and Bounded Emptiness Problems of Constraint Automata with Prefix, Suffix and Infix. - Jakub Michaliszyn; Jan Otop; Piotr Wieczorek (CONCUR, 2023)