Piotr Wieczorek

Publication Activity (10 Years)

Years Active: 2007-2023
Publications (10 Years): 10

Top Topics

Graph Databases

Regular Expressions

Maximal Frequent Subgraphs

Top Venues

Publications

Jakub Michaliszyn, Jan Otop, Piotr Wieczorek
Reachability and Bounded Emptiness Problems of Constraint Automata with Prefix, Suffix and Infix. CONCUR (2023)
Benoît Groz, Aurélien Lemay, Slawek Staworko, Piotr Wieczorek
Inference of Shape Graphs for Graph Databases. ICDT (2022)
Benoît Groz, Aurélien Lemay, Slawek Staworko, Piotr Wieczorek
Inference of Shape Expression Schemas Typed RDF Graphs. CoRR (2021)
Jakub Michaliszyn, Jan Otop, Piotr Wieczorek
Modular Path Queries with Arithmetic. Log. Methods Comput. Sci. 17 (3) (2021)
Jakub Michaliszyn, Jan Otop, Piotr Wieczorek
Modular Path Queries with Arithmetic. CoRR (2020)
Slawek Staworko, Piotr Wieczorek
Containment of Shape Expression Schemas for RDF. PODS (2019)
Slawek Staworko, Piotr Wieczorek
Containment of Shape Expression Schemas for RDF. CoRR (2018)
Jakub Michaliszyn, Jan Otop, Piotr Wieczorek
Querying Best Paths in Graph Databases. FSTTCS (2017)
Jakub Michaliszyn, Jan Otop, Piotr Wieczorek
Querying Best Paths in Graph Databases. CoRR (2017)
Maciej Grabon, Jakub Michaliszyn, Jan Otop, Piotr Wieczorek
Querying Data Graphs with Arithmetical Regular Expressions. IJCAI (2016)
Slawek Staworko, Piotr Wieczorek
Characterizing XML Twig Queries with Examples. ICDT (2015)
Jakub Michaliszyn, Anca Muscholl, Slawek Staworko, Piotr Wieczorek, Zhilin Wu
On Injective Embeddings of Tree Patterns CoRR (2012)
Slawek Staworko, Piotr Wieczorek
Learning twig and path queries. ICDT (2012)
Slawomir Staworko, Piotr Wieczorek
Learning XML Twig Queries CoRR (2011)
Jerzy Marcinkowski, Piotr Wieczorek
Modulo Constraints and the Complexity of Typechecking XML Views. Theory Comput. Syst. 44 (4) (2009)
Piotr Wieczorek
Complexity of Typechecking XML Views of Relational Databases. ICDT (2007)