Minimising RDF Graphs under Rules and Constraints Revisited. - Reinhard Pichler; Axel Polleres; Sebastian Skritek; Stefan Woltran (AMW, 2010)

Uncertain Databases in Collaborative Data Management. - Reinhard Pichler; Vadim Savenkov; Sebastian Skritek; Hong Linh Truong 001 (MUD, 2010)

Redundancy Elimination on RDF Graphs in the Presence of Rules, Constraints, and Queries. - Reinhard Pichler; Axel Polleres; Sebastian Skritek; Stefan Woltran (RR, 2010)

The complexity of evaluating tuple generating dependencies. - Reinhard Pichler; Sebastian Skritek (ICDT, 2011)

Foundational aspects of semantic web optimization. - Sebastian Skritek (SIGMOD/PODS PhD Symposium, 2012)

SPAM: A SPARQL Analysis and Manipulation Tool. - Andrés Letelier; Jorge Pérez 001; Reinhard Pichler; Sebastian Skritek (Proc. VLDB Endow., 2012)

Efficient Updates of Uncertain Databases. - Andreas Hubmer; Reinhard Pichler; Vadim Savenkov; Sebastian Skritek (AMW, 2013)

Peer Data Management. - Armin Roth 001; Sebastian Skritek (Data Exchange, Information, and Streams, 2013)

Tractable counting of the answers to conjunctive queries. - Reinhard Pichler; Sebastian Skritek (J. Comput. Syst. Sci., 2013)

Complexity of redundancy detection on RDF graphs in the presence of rules, constraints, and queries. - Reinhard Pichler; Axel Polleres; Sebastian Skritek; Stefan Woltran (Semantic Web, 2013)

Static analysis and optimization of semantic web queries. - Andrés Letelier; Jorge Pérez 001; Reinhard Pichler; Sebastian Skritek (ACM Trans. Database Syst., 2013)

On the Hardness of Counting the Solutions of SPARQL Queries. - Reinhard Pichler; Sebastian Skritek (AMW, 2014)

Benchmarking Database Systems for Graph Pattern Matching. - Nataliia Pobiedina; Stefan Rümmele; Sebastian Skritek; Hannes Werthner (DEXA (1), 2014)

Containment and equivalence of well-designed SPARQL. - Reinhard Pichler; Sebastian Skritek (PODS, 2014)

Towards Reconciling SPARQL and Certain Answers (Extended Abstract). - Shqiponja Ahmetaj; Wolfgang Fischl; Reinhard Pichler; Mantas Simkus; Sebastian Skritek (AMW, 2015)

Efficient Evaluation of Well-designed Pattern Trees (Extended Abstract). - Pablo Barceló; Reinhard Pichler; Sebastian Skritek (AMW, 2015)

DL-Lite and Conjunctive Queries Extended by Optional Matching. - Shqiponja Ahmetaj; Wolfgang Fischl; Reinhard Pichler; Mantas Simkus; Sebastian Skritek (Description Logics, 2015)

Efficient Evaluation and Approximation of Well-designed Pattern Trees. - Pablo Barceló; Reinhard Pichler; Sebastian Skritek (PODS, 2015)

Towards Reconciling SPARQL and Certain Answers. - Shqiponja Ahmetaj; Wolfgang Fischl; Reinhard Pichler; Mantas Simkus; Sebastian Skritek (WWW, 2015)

The Challenge of Optional Matching in SPARQL. - Shqiponja Ahmetaj; Wolfgang Fischl; Markus Kröll; Reinhard Pichler; Mantas Simkus; Sebastian Skritek (FoIKS, 2016)

On the Complexity of Enumerating the Answers to Well-designed Pattern Trees. - Markus Kröll; Reinhard Pichler; Sebastian Skritek (ICDT, 2016)

On the Complexity of Hard Enumeration Problems. - Nadia Creignou; Markus Kröll; Reinhard Pichler; Sebastian Skritek; Heribert Vollmer (LATA, 2017)

On tractable query evaluation for SPARQL. - Stefan Mengel; Sebastian Skritek (CoRR, 2017)

Efficient Evaluation and Static Analysis for Well-Designed Pattern Trees with Projection. - Pablo Barceló; Markus Kröll; Reinhard Pichler; Sebastian Skritek (ACM Trans. Database Syst., 2018)

Towards Reconciling Certain Answers and SPARQL: Bag Semantics to the Rescue? - Sebastian Skritek (AMW, 2019)

A complexity theory for hard enumeration problems. - Nadia Creignou; Markus Kröll; Reinhard Pichler; Sebastian Skritek; Heribert Vollmer (Discret. Appl. Math., 2019)

Characterizing Tractability of Simple Well-Designed Pattern Trees with Projection. - Stefan Mengel; Sebastian Skritek (Theory Comput. Syst., 2021)

Diversity of Answers to Conjunctive Queries (short paper). - Timo Camillo Merkl; Reinhard Pichler; Sebastian Skritek (AMW, 2023)

Diversity of Answers to Conjunctive Queries. - Timo Camillo Merkl; Reinhard Pichler; Sebastian Skritek (Log. Methods Comput. Sci., 2025)