ScrewBox: a Randomized Certifying Graph-Non-Isomorphism Algorithm. - Martin Kutz; Pascal Schweitzer (ALENEX, 2007)

Counting Defective Parking Functions. - Peter J. Cameron; Daniel Johannsen; Thomas Prellberg; Pascal Schweitzer (Electron. J. Comb., 2008)

Using the incompressibility method to obtain local lemma results for Ramsey-type problems. - Pascal Schweitzer (Inf. Process. Lett., 2009)

Progress on Certifying Algorithms. - Kurt Mehlhorn; Pascal Schweitzer (FAW, 2010)

Isomorphism for Graphs of Bounded Feedback Vertex Set Number. - Stefan Kratsch; Pascal Schweitzer (SWAT, 2010)

Connecting face hitting sets in planar graphs. - Pascal Schweitzer; Patrick Schweitzer (Inf. Process. Lett., 2010)

Homomorphism-homogeneous graphs. - Momchil Rusinov; Pascal Schweitzer (J. Graph Theory, 2010)

Isomorphism of (mis)Labeled Graphs. - Pascal Schweitzer (ESA, 2011)

Certifying algorithms. - Ross M. McConnell; Kurt Mehlhorn; Stefan Näher; Pascal Schweitzer (Comput. Sci. Rev., 2011)

An Introduction to Certifying Algorithms. - Eyad Alkassar; Sascha Böhme; Kurt Mehlhorn; Christine Rizkallah; Pascal Schweitzer (it Inf. Technol., 2011)

Weisfeiler-Lehman Graph Kernels. - Nino Shervashidze; Pascal Schweitzer; Erik Jan van Leeuwen; Kurt Mehlhorn; Karsten M. Borgwardt (J. Mach. Learn. Res., 2011)

Testing Maximal 1-Planarity of Graphs with a Rotation System in Linear Time - (Extended Abstract). - Peter Eades; Seok-Hee Hong 001; Naoki Katoh; Giuseppe Liotta; Pascal Schweitzer; Yusuke Suzuki (GD, 2012)

Infeasible Code Detection. - Cristiano Bertolini; Martin Schäf; Pascal Schweitzer (VSTTE, 2012)

On Zero Divisors with Small Support in Group Rings of Torsion-Free Groups - Pascal Schweitzer (CoRR, 2012)

Online graph exploration: New results on old and new algorithms. - Nicole Megow; Kurt Mehlhorn; Pascal Schweitzer (Theor. Comput. Sci., 2012)

Isomorphism on Subgraph-Closed Graph Classes: A Complexity Dichotomy and Intermediate Graph Classes. - Yota Otachi; Pascal Schweitzer (ISAAC, 2013)

Iterated open neighborhood graphs and generalizations. - Pascal Schweitzer (Discret. Appl. Math., 2013)

Paging and list update under bijective analysis. - Spyros Angelopoulos 001; Pascal Schweitzer (J. ACM, 2013)

Approximation Algorithms for Capacitated Minimum Forest Problems in Wireless Sensor Networks with a Mobile Sink. - Weifa Liang; Pascal Schweitzer; Zichuan Xu (IEEE Trans. Computers, 2013)

A linear time algorithm for testing maximal 1-planarity of graphs with a rotation system. - Peter Eades; Seok-Hee Hong 001; Naoki Katoh; Giuseppe Liotta; Pascal Schweitzer; Yusuke Suzuki (Theor. Comput. Sci., 2013)

Depth-First Search Using O(n) Bits. - Tetsuo Asano; Taisuke Izumi; Masashi Kiyomi; Matsuo Konagaya; Hirotaka Ono 001; Yota Otachi; Pascal Schweitzer; Jun Tarui; Ryuhei Uehara (ISAAC, 2014)

Reduction Techniques for Graph Isomorphism in the Context of Width Parameters. - Yota Otachi; Pascal Schweitzer (SWAT, 2014)

Switching Reconstruction of Digraphs. - Brendan D. McKay; Pascal Schweitzer (J. Graph Theory, 2014)

Competition Numbers, Quasi-line Graphs, and Holes. - Brendan D. McKay; Pascal Schweitzer; Patrick Schweitzer (SIAM J. Discret. Math., 2014)

Isomorphism Testing for Graphs of Bounded Rank Width. - Martin Grohe; Pascal Schweitzer (FOCS, 2015)

A Linear-Time Algorithm for Testing Outer-1-Planarity. - Seok-Hee Hong 001; Peter Eades; Naoki Katoh; Giuseppe Liotta; Pascal Schweitzer; Yusuke Suzuki (Algorithmica, 2015)

The Graph Isomorphism Problem (Dagstuhl Seminar 15511). - László Babai; Anuj Dawar; Pascal Schweitzer; Jacobo Torán (Dagstuhl Reports, 2015)

Detecting Similar Programs via The Weisfeiler-Leman Graph Kernel. - Wenchao Li 001; Hossein Saidi 002; Huascar Sanchez; Martin Schäf; Pascal Schweitzer (ICSR, 2016)

Computing with Tangles. - Martin Grohe; Pascal Schweitzer (SIAM J. Discret. Math., 2016)

Benchmark Graphs for Practical Graph Isomorphism. - Daniel Neuen; Pascal Schweitzer (ESA, 2017)

A Polynomial-Time Randomized Reduction from Tournament Isomorphism to Tournament Asymmetry. - Pascal Schweitzer (ICALP, 2017)

Graph isomorphism for graph classes characterized by two forbidden induced subgraphs. - Stefan Kratsch; Pascal Schweitzer (Discret. Appl. Math., 2017)

Minimal asymmetric graphs. - Pascal Schweitzer; Patrick Schweitzer (J. Comb. Theory B, 2017)

Towards an Isomorphism Dichotomy for Hereditary Graph Classes. - Pascal Schweitzer (Theory Comput. Syst., 2017)

Canonizing Graphs of Bounded Tree Width in Logspace. - Michael Elberfeld; Pascal Schweitzer (ACM Trans. Comput. Theory, 2017)

An exponential lower bound for individualization-refinement algorithms for graph isomorphism. - Daniel Neuen; Pascal Schweitzer (STOC, 2018)

Induced Minor Free Graphs: Isomorphism and Clique-Width. - Rémy Belmonte; Yota Otachi; Pascal Schweitzer (Algorithmica, 2018)

Towards faster isomorphism tests for bounded-degree graphs. - Martin Grohe; Daniel Neuen; Pascal Schweitzer (CoRR, 2018)

Walk refinement, walk logic, and the iteration number of the Weisfeiler-Leman algorithm. - Moritz Lichter; Ilia Ponomarenko; Pascal Schweitzer (LICS, 2019)

A unifying method for the design of algorithms canonizing combinatorial objects. - Pascal Schweitzer; Daniel Wiebking (STOC, 2019)

The Weisfeiler-Leman Dimension of Planar Graphs Is at Most 3. - Sandra Kiefer; Ilia Ponomarenko; Pascal Schweitzer (J. ACM, 2019)

Upper Bounds on the Quantifier Depth for Graph Differentiation in First-Order Logic. - Sandra Kiefer; Pascal Schweitzer (Log. Methods Comput. Sci., 2019)

On the Weisfeiler-Leman Dimension of Finite Groups. - Jendrik Brachter; Pascal Schweitzer (LICS, 2020)

Stochastic Dominance and the Bijective Ratio of Online Algorithms. - Spyros Angelopoulos 001; Marc P. Renault; Pascal Schweitzer (Algorithmica, 2020)

The graph isomorphism problem. - Martin Grohe; Pascal Schweitzer (Commun. ACM, 2020)

Automorphism groups of graphs of bounded Hadwiger number. - Martin Grohe; Pascal Schweitzer; Daniel Wiebking (CoRR, 2020)

Space-Efficient Algorithms for Longest Increasing Subsequence. - Masashi Kiyomi; Hirotaka Ono 001; Yota Otachi; Pascal Schweitzer; Jun Tarui (Theory Comput. Syst., 2020)

An Improved Isomorphism Test for Bounded-tree-width Graphs. - Martin Grohe; Daniel Neuen; Pascal Schweitzer; Daniel Wiebking (ACM Trans. Algorithms, 2020)

Engineering a Fast Probabilistic Isomorphism Test. - Markus Anders; Pascal Schweitzer (ALENEX, 2021)

Canonization for Bounded and Dihedral Color Classes in Choiceless Polynomial Time. - Moritz Lichter; Pascal Schweitzer (CSL, 2021)

Parallel Computation of Combinatorial Symmetries. - Markus Anders; Pascal Schweitzer (ESA, 2021)

Search Problems in Trees with Symmetries: Near Optimal Traversal Strategies for Individualization-Refinement Algorithms. - Markus Anders; Pascal Schweitzer (ICALP, 2021)

Comparative Design-Choice Analysis of Color Refinement Algorithms Beyond the Worst Case. - Markus Anders; Pascal Schweitzer; Florian Wetzels (ICALP, 2021)

A Characterization of Individualization-Refinement Trees. - Markus Anders; Jendrik Brachter; Pascal Schweitzer (ISAAC, 2021)

Deep Weisfeiler Leman. - Martin Grohe; Pascal Schweitzer; Daniel Wiebking (SODA, 2021)

Resolution with Symmetry Rule Applied to Linear Equations. - Pascal Schweitzer; Constantin Seebach (STACS, 2021)

Technical perspective: A logical step toward the graph isomorphism problem. - Pascal Schweitzer (Commun. ACM, 2021)

Trainability for Universal GNNs Through Surgical Randomness. - Billy Joe Franks; Markus Anders; Marius Kloft; Pascal Schweitzer (CoRR, 2021)

A Systematic Study of Isomorphism Invariants of Finite Groups via the Weisfeiler-Leman Dimension. - Jendrik Brachter; Pascal Schweitzer (ESA, 2022)

Graphs Identified by Logics with Counting. - Sandra Kiefer; Pascal Schweitzer; Erkal Selman (ACM Trans. Comput. Log., 2022)

Exploration of Graphs with Excluded Minors. - Júlia Baligács; Yann Disser; Irene Heinrich; Pascal Schweitzer (ESA, 2023)

Algorithms Transcending the SAT-Symmetry Interface. - Markus Anders; Pascal Schweitzer; Mate Soos (SAT, 2023)

Engineering a Preprocessor for Symmetry Detection. - Markus Anders; Pascal Schweitzer; Julian Stieß (SEA, 2023)

A Systematic Approach to Universal Random Features in Graph Neural Networks. - Billy Joe Franks; Markus Anders; Marius Kloft; Pascal Schweitzer (Trans. Mach. Learn. Res., 2023)

A Faster Isomorphism Test for Graphs of Small Degree. - Martin Grohe; Daniel Neuen; Pascal Schweitzer (SIAM J. Comput., 2023)

Finite Vertex-Colored Ultrahomogeneous Oriented Graphs. - Irene Heinrich; Eda Kaja; Pascal Schweitzer (WG, 2024)

Choiceless Polynomial Time with Witnessed Symmetric Choice. - Moritz Lichter; Pascal Schweitzer (J. ACM, 2024)

Computational Complexity of the Weisfeiler-Leman Dimension. - Moritz Lichter; Simon Raßmann; Pascal Schweitzer (CSL, 2025)

Finite Variable Counting Logics with Restricted Requantification. - Simon Raßmann; Georg Schindling; Pascal Schweitzer (CSL, 2025)

An Upper Bound on the Weisfeiler-Leman Dimension. - Thomas Schneider; Pascal Schweitzer (ICALP, 2025)

Classification of Finite Highly Regular Vertex-Colored Graphs. - Irene Heinrich; Thomas Schneider; Pascal Schweitzer (SIAM J. Discret. Math., 2025)

Interval Graphs are Reconstructible. - Irene Heinrich; Masashi Kiyomi; Yota Otachi; Pascal Schweitzer (CoRR, 2025)

Compressing CFI Graphs and Lower Bounds for the Weisfeiler-Leman Refinements. - Martin Grohe; Moritz Lichter; Daniel Neuen; Pascal Schweitzer (J. ACM, 2025)