| 2024 | EDOC | Process Tree Alignments. | Christopher T. Schwanen, Wied Pakusa, Wil M. P. van der Aalst |
| 2024 | ICPM | A Dynamic Programming Approach for Alignments on Process Trees. | Christopher T. Schwanen, Wied Pakusa, Wil M. P. van der Aalst |
| 2020 | LICS | Temporal Constraint Satisfaction Problems in Fixed-Point Logic. | Manuel Bodirsky, Wied Pakusa, Jakub Rydval |
| 2019 | ICALP | Approximations of Isomorphism and Logics with Linear-Algebraic Operators. | Anuj Dawar, Erich Grdel, Wied Pakusa |
| 2017 | CSL | The Model-Theoretic Expressiveness of Propositional Proof Systems. | Erich Grdel, Benedikt Pago, Wied Pakusa |
| 2017 | LICS | Descriptive complexity of linear equation systems and applications to propositional proof complexity. | Martin Grohe, Wied Pakusa |
| 2017 | LICS | Definability of summation problems for Abelian groups and semigroups. | Faried Abu Zaid, Anuj Dawar, Erich Grdel, Wied Pakusa |
| 2016 | CSL | Definability of Cai-Frer-Immerman Problems in Choiceless Polynomial Time. | Wied Pakusa, Svenja Schalthfer, Erkal Selman |
| 2015 | CSL | Rank Logic is Dead, Long Live Rank Logic!. | Erich Grdel, Wied Pakusa |
| 2015 | LICS | Defining Winning Strategies in Fixed-Point Logic. | Felix Canavoi, Erich Grdel, Simon Leenich, Wied Pakusa |
| 2015 | LICS | Characterising Choiceless Polynomial Time with First-Order Interpretations. | Erich Grdel, Wied Pakusa, Svenja Schalthfer, Lukasz Kaiser |
| 2014 | MFCS | Choiceless Polynomial Time on Structures with Small Abelian Colour Classes. | Faried Abu Zaid, Erich Grdel, Martin Grohe, Wied Pakusa |
| 2012 | CSL | Definability of linear equation systems over groups and rings. | Anuj Dawar, Erich Grdel, Bjarki Holm, Eryk Kopczynski, Wied Pakusa |