6 citations · 8 across the 5 of their papers we have counts for
10 papers
Taming Horizontal Instability in Merge Trees: On the Computation of a Comprehensive Deformation-based Edit Distance
Florian Wetzels, Markus Anders, Christoph Garth
Comparative analysis of scalar fields in scientific visualization often involves distance functions on topological abstractions. This paper focuses on the merge tree abstraction (r…
Algorithms Transcending the SAT-Symmetry Interface
Markus Anders, Pascal Schweitzer, Mate Soos
Dedicated treatment of symmetries in satisfiability problems (SAT) is indispensable for solving various classes of instances arising in practice. However, the exploitation of symme…
Engineering a Preprocessor for Symmetry Detection
Markus Anders, Pascal Schweitzer, Julian Stieß
State-of-the-art solvers for symmetry detection in combinatorial objects are becoming increasingly sophisticated software libraries. Most of the solvers were initially designed wit…
SAT Preprocessors and Symmetry
Markus Anders
Exploitation of symmetries is an indispensable approach to solve certain classes of difficult SAT instances. Numerous techniques for the use of symmetry in SAT have evolved over th…
A systematic approach to random data augmentation on graph neural networks
Billy Joe Franks, Markus Anders, Marius Kloft +1
Random data augmentations (RDAs) are state of the art regarding practical graph neural networks that are provably universal. There is great diversity regarding terminology, methodo…
A Characterization of Individualization-Refinement Trees
Markus Anders, Jendrik Brachter, Pascal Schweitzer
Individualization-Refinement (IR) algorithms form the standard method and currently the only practical method for symmetry computations of graphs and combinatorial objects in gener…
Parallel Computation of Combinatorial Symmetries
Markus Anders, Pascal Schweitzer
In practice symmetries of combinatorial structures are computed by transforming the structure into an annotated graph whose automorphisms correspond exactly to the desired symmetri…
Comparative Design-Choice Analysis of Color Refinement Algorithms Beyond the Worst Case
Markus Anders, Pascal Schweitzer, Florian Wetzels
Color refinement is a crucial subroutine in symmetry detection in theory as well as practice. It has further applications in machine learning and in computational problems from lin…
Engineering a Fast Probabilistic Isomorphism Test
Markus Anders, Pascal Schweitzer
We engineer a new probabilistic Monte-Carlo algorithm for isomorphism testing. Most notably, as opposed to all other solvers, it implicitly exploits the presence of symmetries with…
Search Problems in Trees with Symmetries: near optimal traversal strategies for individualization-refinement algorithms
Markus Anders, Pascal Schweitzer
We define a search problem on trees that closely captures the backtracking behavior of all current practical graph isomorphism algorithms. Given two trees with colored leaves, the…