Structure theory and algorithms for highly regular colored graphs.

Thomas Schneider.
PhD Thesis 2025. DOI

Classification of Finite Highly Regular Vertex-Colored Graphs.

Irene Heinrich, Thomas Schneider, and Pascal Schweitzer.
SIDMA 2025. DOI

Finite Variable Counting Logics with Restricted Requantification.

Simon Raßmann, Georg Schindling, and Pascal Schweitzer.
CSL 2025. DOI

Computational Complexity of the Weisfeiler-Leman Dimension.

Moritz Lichter, Simon Raßmann, and Pascal Schweitzer.
CSL 2025. DOI

The Complexity of Symmetry Breaking Beyond Lex-Leader.

Markus Anders, Sofia Brenner, and Gaurav Rattan.
CP 2024. DOI

Computing edge colored ultrahomogeneous graphs.

Irene Heinrich, Eda Kaja, and Pascal Schweitzer.
DMD 2024. Paper (wird in neuem Tab geöffnet) DOI

The flexibility among 3-decompositions.

Irene Heinrich, and Lena Volk.
DMD 2024. Paper (wird in neuem Tab geöffnet) DOI

Finite Vertex-colored Ultrahomogeneous Oriented Graphs.

Irene Heinrich, Eda Kaja, and Pascal Schweitzer.
WG 2024. ArXiv

On the modular isomorphism problem for groups with center of index at most p3.

Sofia Brenner, and Diego Garcı́a-Lucas.
Archiv der Mathematik, 2024. DOI

Tuple regularity and k-ultrahomogeneity for finite groups.

Sofia Brenner.
Journal of Group Theory, 2024. DOI

Satsuma: Structure-Based Symmetry Breaking in SAT.

Markus Anders, Sofia Brenner, and Gaurav Rattan.
SAT 2024. DOI

Non-Pool-Based Line Planning on Graphs of Bounded Treewidth.

Irene Heinrich, Philine Schiewe, and Constantin Seebach.
ATMOS 2023. DOI

Using Light Spanning Graphs for Passenger Assignment in Public Transport.

Irene Heinrich, Olli Herrala, Philine Schiewe, and Topias Terho.
ATMOS 2023. DOI

Reductions for the 3-Decomposition Conjecture.

Oliver Bachtler, and Irene Heinrich.
LAGOS 2023. DOI

Exploration of Graphs with Excluded Minors.

Júlia Baligács, Yann Disser, Irene Heinrich, and Pascal Schweitzer.
ESA 2023. DOI

Countable ultrahomogeneous 2-colored graphs consisting of disjoint unions of cliques.

Sofia Brenner, and Irene Heinrich.
EUROCOMB 2023. DOI

Twin-width of graphs with tree-structured decompositions.

Irene Heinrich, Simon Raßmann.
IPEC 2023. ArXiv DOI

Compressing CFI Graphs and Lower Bounds for the Weisfeiler-Leman Refinements.

Martin Grohe, Moritz Lichter, Daniel Neuen, Pascal Schweitzer.
FOCS 2023. ArXiv

Witnessed Symmetric Choice and Interpretations in Fixed-Point Logic with Counting.

Moritz Lichter.
ICALP 2023. ArXiv DOI

Continuing the Quest for a Logic Capturing Polynomial Time – Potential, Limitations, and Interplay of Current Approaches.

Moritz Lichter.
PhD Thesis 2023.DOI More Information

Engineering a Preprocessor for Symmetry Detection.

Markus Anders, Pascal Schweitzer, Julian Stieß.
SEA 2023. ArXiv DOI

Algorithms Transcending the SAT-Symmetry Interface.

Markus Anders, Pascal Schweitzer, Mate Soos.
SAT 2023. ArXiv DOI

The Iteration Number of the Weisfeiler-Leman Algorithm.

Martin Grohe, Moritz Lichter, Daniel Neuen.
LICS 2023. ArXiv DOI

Automated testing and interactive construction of unavoidable sets for graph classes of small path-width.

Oliver Bachtler, Irene Heinrich.
Journal of Graph Theory, 2023. ArXiv DOI

Limitations of the invertible-map equivalences.

Anuj Dawar, Erich Grädel, Moritz Lichter.
Journal of Logic and Computation, 2023. ArXiv DOI

A Systematic Study of Isomorphism Invariants of Finite Groups via the Weisfeiler-Leman Dimension.

Jendrik Brachter, Pascal Schweitzer.
ESA 2022. ArXiv

SAT Preprocessors and Symmetry.

Markus Anders.
SAT 2022. ArXiv DOI
Award for Best Student Paper

Choiceless Polynomial Time with Witnessed Symmetric Choice.

Moritz Lichter, Pascal Schweitzer.
LICS 2022. ArXiv DOI

A Characterization of Individualization-Refinement Trees.

Markus Anders, Jendrik Brachter, Pascal Schweitzer.
ISAAC 2021. ArXiv DOI

Parallel Computation of Combinatorial Symmetries.

Markus Anders, Pascal Schweitzer.
ESA 2021. ArXiv DOI

Comparative Design-Choice Analysis of Color Refinement Algorithms Beyond the Worst Case.

Markus Anders, Pascal Schweitzer, Florian Wetzels.
ICALP 2021. ArXiv DOI

Search Problems in Trees with Symmetries: near optimal traversal strategies for individualization-refinement algorithms.

Markus Anders, Pascal Schweitzer.
ICALP 2021. ArXiv DOI

Separating Rank Logic from Polynomial Time.

Moritz Lichter.
Journal of the ACM, LICS 2021. ArXiv DOI (JACM)DOI (LICS)
Kleene Award for Best Student Paper

Resolution with Symmetry Rule applied to Linear Equations.

Pascal Schweitzer, Constantin Seebach.
STACS2021. ArXiv DOI

Canonization for Bounded and Dihedral Color Classes in Choiceless Polynomial Time.

Moritz Lichter, Pascal Schweitzer.
CSL 2021. ArXiv DOI

Engineering a Fast Probabilistic Isomorphism Test.

Markus Anders, Pascal Schweitzer.
ALENEX 2021. ArXiv DOI

Deep Weisfeiler Leman.

Martin Grohe, Pascal Schweitzer, Daniel Wiebking.
SODA 2021. ArXiv DOI

2.5-Connectivity: Unique Components, Critical Graphs, and Applications.

Irene Heinrich, Till Heller, Eva Schmidt, Manuel Streicher.
WG 2020. ArXiv DOI

On the Weisfeiler-Leman Dimension of Finite Groups.

Jendrik Brachter, Pascal Schweitzer.
LICS 2020. ArXiv DOI

Walk refinement, walk logic, and the iteration number of the Weisfeiler-Leman algorithm.

Moritz Lichter, Ilia Ponomarenko, Pascal Schweitzer.
LICS 2019. ArXiv DOI

A unifying method for the design of algorithms canonizing combinatorial objects.

Pascal Schweitzer, Daniel Wiebking.
STOC 2019. ArXiv DOI