On Memory Optimal Code Generation for Exposed Datapath Architectures with Buffered Processing Units. - Markus Anders; Anoop Bhagyanath; Klaus Schneider 001 (ACSD, 2018)

A Formal Semantics of Exposed Datapath Architectures with Buffered Processing Units. - Markus Anders; Klaus Schneider 001 (ACSD, 2019)

Engineering a Fast Probabilistic Isomorphism Test. - Markus Anders; Pascal Schweitzer (ALENEX, 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)

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

SAT Preprocessors and Symmetry. - Markus Anders (SAT, 2022)

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)

Taming Horizontal Instability in Merge Trees: On the Computation of a Comprehensive Deformation-based Edit Distance. - Florian Wetzels; Markus Anders; Christoph Garth (CoRR, 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)

The Complexity of Symmetry Breaking Beyond Lex-Leader. - Markus Anders; Sofia Brenner; Gaurav Rattan (CP, 2024)

Satsuma: Structure-Based Symmetry Breaking in SAT. - Markus Anders; Sofia Brenner; Gaurav Rattan (SAT, 2024)