| No. |
Title |
Author |
Year |
| 1 |
Algorithms Transcending the SAT-Symmetry Interface |
Anders, Markus et al. |
2023 |
| 2 |
Engineering a Preprocessor for Symmetry Detection |
Anders, Markus et al. |
2023 |
| 3 |
Exploration of Graphs with Excluded Minors |
Baligács, Júlia et al. |
2023 |
| 4 |
A Systematic Study of Isomorphism Invariants of Finite Groups via the Weisfeiler-Leman Dimension |
Brachter, Jendrik et al. |
2022 |
| 5 |
A Characterization of Individualization-Refinement Trees |
Anders, Markus et al. |
2021 |
| 6 |
Canonization for Bounded and Dihedral Color Classes in Choiceless Polynomial Time |
Lichter, Moritz et al. |
2021 |
| 7 |
Comparative Design-Choice Analysis of Color Refinement Algorithms Beyond the Worst Case |
Anders, Markus et al. |
2021 |
| 8 |
Parallel Computation of Combinatorial Symmetries |
Anders, Markus et al. |
2021 |
| 9 |
Resolution with Symmetry Rule Applied to Linear Equations |
Schweitzer, Pascal et al. |
2021 |
| 10 |
Search Problems in Trees with Symmetries: Near Optimal Traversal Strategies for Individualization-Refinement Algorithms |
Anders, Markus et al. |
2021 |
| 11 |
An Improved Isomorphism Test for Bounded-Tree-Width Graphs |
Grohe, Martin et al. |
2018 |
| 12 |
Space-Efficient Algorithms for Longest Increasing Subsequence |
Kiyomi, Masashi et al. |
2018 |
| 13 |
A Polynomial-Time Randomized Reduction from Tournament Isomorphism to Tournament Asymmetry |
Schweitzer, Pascal |
2017 |
| 14 |
Benchmark Graphs for Practical Graph Isomorphism |
Neuen, Daniel et al. |
2017 |
| 15 |
Canonizing Graphs of Bounded Tree Width in Logspace |
Elberfeld, Michael et al. |
2016 |
| 16 |
The Graph Isomorphism Problem (Dagstuhl Seminar 15511) |
Babai, László et al. |
2016 |
| 17 |
Towards an Isomorphism Dichotomy for Hereditary Graph Classes |
Schweitzer, Pascal |
2015 |
