Prof. Dr. Wied Pakusa
FB Mathematik, Informatik, Technik, Hochschule Koblenz
- 02642/932-379
Schwanen, Christopher T.; Pakusa, Wied; van der Aalst, Wil M. P.
Computational Complexity of AlignmentsarXiv (CoRR abs/2603.05331). arXiv
Schwanen, Christopher T.; Pakusa, Wied; van der Aalst, Wil M. P.
Coming Home for Blocking Transitions FastApplication and Theory of Petri Nets and Concurrency - 47th International Conference, PETRI NETS 2026. Springer 2026 S. 289 - 311 (Lecture Notes in Computer Science)
Dellen, Babette; Köhler-Bußmeier, Michael; Pakusa, Wied et al.
LAMAS: An organisation-centred architecture for agentic AIKöhler-Bußmeier, Michael; Moldt, Daniel; Rölke, Heiko; Capra, Lorenzo; Bergenthum, Robin; Leemans, Sander J. J.; Rivkin, Andrey; Fahrenberg, Uli; Hélouët, Loïc; Schlehuber-Caissier, Philipp; Ziemianski, Krzysztof (Hrsg). Joint Workshop Proceedings of PNSE'26, PNAS'26, ATAED'26 and PHOCON'26, co-located with the 47th International Conference on Application and Theory of Petri Nets and Concurrency (PETRI NETS 2026). Hamburg: CEUR-WS.org 2026 (CEUR Workshop Proceedings, Bd. 4236)
Schwanen, Christopher T.; Pakusa, Wied
On Free Choice and Wil(l): From Petri Net Theory to Process MiningMining a Scientist's Process. Springer 2026 S. 298 - 311
Schwanen, Christopher T.; Pakusa, Wied; van der Aalst, Wil M.P.
Alignments meet Linear AlgebraAlgorithms & Theories for the Analysis of Event Data 2025. Joint Workshop Proceedings of PNSE, ATAED, and PeNGE at PETRI NETS. 2025
Schwanen, Christopher T.; Pakusa, Wied; van der Aalst, Wil M.P.
Complexity of Alignments on Sound Free-Choice Workflow NetsApplication and Theory of Petri Nets and Concurrency. Springer 2025 S. 388 - 410
Pakusa, Wied; Schwanen, Christopher T.; van der Aalst, Wil M. P.
A Dynamic Programming Approach for Alignments on Process TreesDelgado, Andrea; Slaats, Tijs (Hrsg). Process Mining Workshops. Lyngby: Springer 2024 S. 84 - 97 (ICPM 2024 International Workshops)
Pakusa, Wied; Schwanen, Christopher T.; van der Aalst, Wil M. P.
Process Tree AlignmentsBorbinha, Jose; Sales, Tiago Prince; Da Silva, Miguel Mira; (Hrsg). Enterprise Design, Operations, and Computing- 28th International Conference. Vienna, Austria: Springer 2024 S. 300 - 317 (Revised Selected Papers)
Pakusa, Wied; Bodirsky, Manuel; Rydval, Jakub
Temporal Constraint Satisfaction Problems in Fixed-Point LogicLICS ’20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science (Hrsg). Saarbrücken. 2020
Pakusa, Wied; Grädel, Erich; Grohe, Martin et al.
A Finite-Model-Theoretic View on Propositional Proof ComplexityLogical Methods in Computer Science. Bd. 15. H. 1. 2019
