Between Tree Patterns and Conjunctive Queries: Is There Tractability beyond Acyclicity? - Filip Murlak; Michal Oginski; Marcin Przybylko (MFCS, 2012)

Tree games with regular objectives. - Marcin Przybylko (GandALF, 2014)

The (Almost) Complete Guide to Tree Pattern Containment. - Wojciech Czerwinski; Wim Martens; Pawel Parys; Marcin Przybylko (PODS, 2015)

On the Complexity of Branching Games with Regular Conditions. - Marcin Przybylko; Michal Skrzypczak (MFCS, 2016)

On Computing the Measures of First-Order Definable Sets of Trees. - Marcin Przybylko (GandALF, 2018)

The Complexity of Answer Counting for Ontology-Mediated Queries Based on Guarded TGDs (Extended Abstract). - Cristina Feier; Carsten Lutz; Marcin Przybylko (Description Logics, 2020)

Computing Measures of Weak-MSO Definable Sets of Trees. - Damian Niwinski; Marcin Przybylko; Michal Skrzypczak (ICALP, 2020)

Enumerating Answers to Ontology-Mediated Queries: Partial Answers and Efficiency (Extended Abstract). - Carsten Lutz; Marcin Przybylko (Description Logics, 2021)

The uniform measure of simple regular sets of infinite trees. - Marcin Przybylko; Michal Skrzypczak (Inf. Comput., 2021)

Efficiently Enumerating Answers to Ontology-Mediated Queries. - Carsten Lutz; Marcin Przybylko (PODS, 2022)

Efficient Answer Enumeration in Description Logics with Functional Roles - Extended Version. - Carsten Lutz; Marcin Przybylko (CoRR, 2022)

Efficient Answer Enumeration in Description Logics with Functional Roles. - Carsten Lutz; Marcin Przybylko (AAAI, 2023)

Answer Counting under Guarded TGDs. - Cristina Feier; Carsten Lutz; Marcin Przybylko (Log. Methods Comput. Sci., 2023)

Spectra of Cardinality Queries over Description Logic Knowledge Bases (Extended Abstract). - Quentin Manière; Marcin Przybylko (Description Logics, 2024)

Spectra of Cardinality Queries over Description Logic Knowledge Bases. - Quentin Manière; Marcin Przybylko (AAAI, 2025)