| 2026 | ESA | Symmetry-Preserving Graph Compression. | Markus Anders, Manuel Penschuck, Pascal Schweitzer |
| 2025 | CSL | Computational Complexity of the Weisfeiler-Leman Dimension. | Moritz Lichter, Simon Ramann, Pascal Schweitzer |
| 2025 | CSL | Finite Variable Counting Logics with Restricted Requantification. | Simon Ramann, Georg Schindling, Pascal Schweitzer |
| 2025 | ICALP | An Upper Bound on the Weisfeiler-Leman Dimension. | Thomas Schneider, Pascal Schweitzer |
| 2024 | WG | Finite Vertex-Colored Ultrahomogeneous Oriented Graphs. | Irene Heinrich, Eda Kaja, Pascal Schweitzer |
| 2023 | ESA | Exploration of Graphs with Excluded Minors. | Jlia Baligcs, Yann Disser, Irene Heinrich, Pascal Schweitzer |
| 2023 | FOCS | Compressing CFI Graphs and Lower Bounds for the Weisfeiler-Leman Refinements. | Martin Grohe, Moritz Lichter, Daniel Neuen, Pascal Schweitzer |
| 2023 | SAT | Algorithms Transcending the SAT-Symmetry Interface. | Markus Anders, Pascal Schweitzer, Mate Soos |
| 2022 | ESA | A Systematic Study of Isomorphism Invariants of Finite Groups via the Weisfeiler-Leman Dimension. | Jendrik Brachter, Pascal Schweitzer |
| 2022 | LICS | Choiceless Polynomial Time with Witnessed Symmetric Choice. | Moritz Lichter, Pascal Schweitzer |
| 2021 | ALENEX | Engineering a Fast Probabilistic Isomorphism Test. | Markus Anders, Pascal Schweitzer |
| 2021 | CSL | Canonization for Bounded and Dihedral Color Classes in Choiceless Polynomial Time. | Moritz Lichter, Pascal Schweitzer |
| 2021 | ESA | Parallel Computation of Combinatorial Symmetries. | Markus Anders, Pascal Schweitzer |
| 2021 | ICALP | Search Problems in Trees with Symmetries: Near Optimal Traversal Strategies for Individualization-Refinement Algorithms. | Markus Anders, Pascal Schweitzer |
| 2021 | ICALP | Comparative Design-Choice Analysis of Color Refinement Algorithms Beyond the Worst Case. | Markus Anders, Pascal Schweitzer, Florian Wetzels |
| 2021 | ISAAC | A Characterization of Individualization-Refinement Trees. | Markus Anders, Jendrik Brachter, Pascal Schweitzer |
| 2021 | SODA | Deep Weisfeiler Leman. | Martin Grohe, Pascal Schweitzer, Daniel Wiebking |
| 2021 | STACS | Resolution with Symmetry Rule Applied to Linear Equations. | Pascal Schweitzer, Constantin Seebach |
| 2020 | LICS | On the Weisfeiler-Leman Dimension of Finite Groups. | Jendrik Brachter, Pascal Schweitzer |
| 2019 | LICS | Walk refinement, walk logic, and the iteration number of the Weisfeiler-Leman algorithm. | Moritz Lichter, Ilia Ponomarenko, Pascal Schweitzer |
| 2019 | STOC | A unifying method for the design of algorithms canonizing combinatorial objects. | Pascal Schweitzer, Daniel Wiebking |
| 2018 | FOCS | A Faster Isomorphism Test for Graphs of Small Degree. | Martin Grohe, Daniel Neuen, Pascal Schweitzer |
| 2018 | ICALP | An Improved Isomorphism Test for Bounded-Tree-Width Graphs. | Martin Grohe, Daniel Neuen, Pascal Schweitzer, Daniel Wiebking |
| 2018 | STOC | An exponential lower bound for individualization-refinement algorithms for graph isomorphism. | Daniel Neuen, Pascal Schweitzer |
| 2018 | STACS | Space-Efficient Algorithms for Longest Increasing Subsequence. | Masashi Kiyomi, Hirotaka Ono, Yota Otachi, Pascal Schweitzer, Jun Tarui |
| 2017 | ESA | Benchmark Graphs for Practical Graph Isomorphism. | Daniel Neuen, Pascal Schweitzer |
| 2017 | ICALP | A Polynomial-Time Randomized Reduction from Tournament Isomorphism to Tournament Asymmetry. | Pascal Schweitzer |
| 2017 | LICS | The Weisfeiler-Leman dimension of planar graphs is at most 3. | Sandra Kiefer, Ilia Ponomarenko, Pascal Schweitzer |
| 2016 | ICSR | Detecting Similar Programs via The Weisfeiler-Leman Graph Kernel. | Wenchao Li, Hossein Saidi, Huascar Sanchez, Martin Schf, Pascal Schweitzer |
| 2016 | LICS | Upper Bounds on the Quantifier Depth for Graph Differentiation in First Order Logic. | Sandra Kiefer, Pascal Schweitzer |
| 2016 | STACS | Canonizing Graphs of Bounded Tree Width in Logspace. | Michael Elberfeld, Pascal Schweitzer |
| 2015 | FOCS | Isomorphism Testing for Graphs of Bounded Rank Width. | Martin Grohe, Pascal Schweitzer |
| 2015 | MFCS | Graphs Identified by Logics with Counting. | Sandra Kiefer, Pascal Schweitzer, Erkal Selman |
| 2015 | STOC | Computing with Tangles. | Martin Grohe, Pascal Schweitzer |
| 2015 | STACS | Towards an Isomorphism Dichotomy for Hereditary Graph Classes. | Pascal Schweitzer |
| 2015 | WG | Induced Minor Free Graphs: Isomorphism and Clique-width. | Rmy Belmonte, Yota Otachi, Pascal Schweitzer |
| 2014 | ISAAC | Depth-First Search Using O(n) Bits. | Tetsuo Asano, Taisuke Izumi, Masashi Kiyomi, Matsuo Konagaya, Hirotaka Ono, Yota Otachi, Pascal Schweitzer, Jun Tarui, Ryuhei Uehara |
| 2013 | GD | A Linear-Time Algorithm for Testing Outer-1-Planarity. | Seok-Hee Hong, Peter Eades, Naoki Katoh, Giuseppe Liotta, Pascal Schweitzer, Yusuke Suzuki |
| 2013 | ISAAC | Isomorphism on Subgraph-Closed Graph Classes: A Complexity Dichotomy and Intermediate Graph Classes. | Yota Otachi, Pascal Schweitzer |
| 2012 | GD | Testing Maximal 1-Planarity of Graphs with a Rotation System in Linear Time - (Extended Abstract). | Peter Eades, Seok-Hee Hong, Naoki Katoh, Giuseppe Liotta, Pascal Schweitzer, Yusuke Suzuki |
| 2012 | WG | Graph Isomorphism for Graph Classes Characterized by Two Forbidden Induced Subgraphs. | Stefan Kratsch, Pascal Schweitzer |
| 2011 | ESA | Isomorphism of (mis)Labeled Graphs. | Pascal Schweitzer |
| 2011 | ICALP | Online Graph Exploration: New Results on Old and New Algorithms. | Nicole Megow, Kurt Mehlhorn, Pascal Schweitzer |
| 2010 | FAW | Progress on Certifying Algorithms. | Kurt Mehlhorn, Pascal Schweitzer |
| 2009 | SODA | Paging and list update under bijective analysis. | Spyros Angelopoulos, Pascal Schweitzer |
| 2007 | ALENEX | ScrewBox: a Randomized Certifying Graph-Non-Isomorphism Algorithm. | Martin Kutz, Pascal Schweitzer |