| 2026 | KR | Verifying Quantized GNNs With Readout Is Decidable But Highly Intractable. | Artem Chernobrovkin, Marco Slzer, Franois Schwarzentruber, Nicolas Troquard |
| 2026 | KR | The Polynomial Counting Capabilities of Message Passing Neural Networks. | Marco Slzer, Pascal Bergstrer, Anthony W. Lin |
| 2025 | ICLR | Transformer Encoder Satisfiability: Complexity and Impact on Formal Reasoning. | Marco Slzer, Eric Alsmann, Martin Lange |
| 2025 | IJCAI | Verifying Quantized Graph Neural Networks is PSPACE-complete. | Marco Slzer, Franois Schwarzentruber, Nicolas Troquard |
| 2024 | DLT | Verifying and Interpreting Neural Networks Using Finite Automata. | Marco Slzer, Eric Alsmann, Florian Bruse, Martin Lange |
| 2024 | IJCAI | A Logic for Reasoning about Aggregate-Combine Graph Neural Networks. | Pierre Nunn, Marco Slzer, Franois Schwarzentruber, Nicolas Troquard |
| 2023 | ICLR | Fundamental Limits in Formal Verification of Message-Passing Neural Networks. | Marco Slzer, Martin Lange |
| 2023 | TIME | Time-Aware Robustness of Temporal Graph Neural Networks for Link Prediction (Extended Abstract). | Marco Slzer, Silvia Beddar-Wiesing |
| 2021 | MFCS | Finite Convergence of μ-Calculus Fixpoints on Genuinely Infinite Structures. | Florian Bruse, Marco Slzer, Martin Lange |