| 2026 | WG | Weisfeiler-Leman on Graphs of Small Twin-Width. | Irene Heinrich, Moritz Lichter, Klara Pakhomenko, Simon Ramann |
| 2025 | CSL | Computational Complexity of the Weisfeiler-Leman Dimension. | Moritz Lichter, Simon Ramann, Pascal Schweitzer |
| 2025 | ICALP | Limitations of Affine Integer Relaxations for Solving Constraint Satisfaction Problems. | Moritz Lichter, Benedikt Pago |
| 2025 | MFCS | Supercritical Size-Width Tree-Like Resolution Trade-Offs for Graph Isomorphism. | Christoph Berkholz, Moritz Lichter, Harry Vinall-Smeeth |
| 2024 | CSL | Limitations of Game Comonads for Invertible-Map Equivalence via Homomorphism Indistinguishability. | Moritz Lichter, Benedikt Pago, Tim Seppelt |
| 2023 | FOCS | Compressing CFI Graphs and Lower Bounds for the Weisfeiler-Leman Refinements. | Martin Grohe, Moritz Lichter, Daniel Neuen, Pascal Schweitzer |
| 2023 | ICALP | Witnessed Symmetric Choice and Interpretations in Fixed-Point Logic with Counting. | Moritz Lichter |
| 2023 | LICS | The Iteration Number of the Weisfeiler-Leman Algorithm. | Martin Grohe, Moritz Lichter, Daniel Neuen |
| 2022 | LICS | Choiceless Polynomial Time with Witnessed Symmetric Choice. | Moritz Lichter, Pascal Schweitzer |
| 2021 | CSL | Canonization for Bounded and Dihedral Color Classes in Choiceless Polynomial Time. | Moritz Lichter, Pascal Schweitzer |
| 2021 | LICS | Separating Rank Logic from Polynomial Time. | Moritz Lichter |
| 2019 | LICS | Walk refinement, walk logic, and the iteration number of the Weisfeiler-Leman algorithm. | Moritz Lichter, Ilia Ponomarenko, Pascal Schweitzer |
| 2015 | OOPSLA | A sound and optimal incremental build system with dynamic dependencies. | Sebastian Erdweg, Moritz Lichter, Manuel Weiel |