Definability of linear equation systems over groups and rings - Anuj Dawar; Erich Grädel; Bjarki Holm; Eryk Kopczynski; Wied Pakusa (Log. Methods Comput. Sci., 2013)

Choiceless Polynomial Time on Structures with Small Abelian Colour Classes. - Faried Abu Zaid; Erich Grädel; Martin Grohe; Wied Pakusa (MFCS (1), 2014)

Model-Theoretic Properties of ω-Automatic Structures. - Faried Abu Zaid; Erich Grädel; Lukasz Kaiser; Wied Pakusa (Theory Comput. Syst., 2014)

Defining Winning Strategies in Fixed-Point Logic. - Felix Canavoi; Erich Grädel; Simon Leßenich; Wied Pakusa (LICS, 2015)

Characterising Choiceless Polynomial Time with First-Order Interpretations. - Erich Grädel; Wied Pakusa; Svenja Schalthöfer; Lukasz Kaiser (LICS, 2015)

The Model-Theoretic Expressiveness of Propositional Proof Systems. - Erich Grädel; Benedikt Pago; Wied Pakusa (CSL, 2017)

Descriptive complexity of linear equation systems and applications to propositional proof complexity. - Martin Grohe; Wied Pakusa (LICS, 2017)

Definability of summation problems for Abelian groups and semigroups. - Faried Abu Zaid; Anuj Dawar; Erich Grädel; Wied Pakusa (LICS, 2017)

Definability of Cai-Fürer-Immerman Problems in Choiceless Polynomial Time. - Wied Pakusa; Svenja Schalthöfer; Erkal Selman (ACM Trans. Comput. Log., 2018)

Approximations of Isomorphism and Logics with Linear-Algebraic Operators. - Anuj Dawar; Erich Grädel; Wied Pakusa (ICALP, 2019)

Rank Logic is dead, Long Live Rank Logic! - Erich Grädel; Wied Pakusa (J. Symb. Log., 2019)

A Finite-Model-Theoretic View on Propositional Proof Complexity. - Erich Grädel; Martin Grohe; Benedikt Pago; Wied Pakusa (Log. Methods Comput. Sci., 2019)

Temporal Constraint Satisfaction Problems in Fixed-Point Logic. - Manuel Bodirsky; Wied Pakusa; Jakub Rydval (LICS, 2020)

Process Tree Alignments. - Christopher T. Schwanen; Wied Pakusa; Wil M. P. van der Aalst (EDOC, 2024)

A Dynamic Programming Approach for Alignments on Process Trees. - Christopher T. Schwanen; Wied Pakusa; Wil M. P. van der Aalst (ICPM Workshops, 2024)

Complexity of Alignments on Sound Free-Choice Workflow Nets. - Christopher T. Schwanen; Wied Pakusa; Wil M. P. van der Aalst (Petri Nets, 2025)