Markus Anders

Orcid: 0009-0004-5992-8433

Affiliations:
  • RPTU Kaiserslautern-Landau, Germany


According to our database1, Markus Anders authored at least 19 papers between 2018 and 2026.

Collaborative distances:

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

Online presence:

On csauthors.net:

Bibliography

2026
Orbitopal Fixing in SAT.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2026

Faster Certified Symmetry Breaking Using Orders with Auxiliary Variables.
Proceedings of the Fortieth AAAI Conference on Artificial Intelligence, 2026

2025
[TACAS 2026] Artifact for "Orbitopal Fixing in SAT".
Dataset, December, 2025

[TACAS 2026] Artifact for "Orbitopal Fixing in SAT".
Dataset, December, 2025

2024
Satsuma: Structure-Based Symmetry Breaking in SAT.
Proceedings of the 27th International Conference on Theory and Applications of Satisfiability Testing, 2024

The Complexity of Symmetry Breaking Beyond Lex-Leader.
Proceedings of the 30th International Conference on Principles and Practice of Constraint Programming, 2024

2023
A Systematic Approach to Universal Random Features in Graph Neural Networks.
Trans. Mach. Learn. Res., 2023

Taming Horizontal Instability in Merge Trees: On the Computation of a Comprehensive Deformation-based Edit Distance.
CoRR, 2023

Engineering a Preprocessor for Symmetry Detection.
Proceedings of the 21st International Symposium on Experimental Algorithms, 2023

Algorithms Transcending the SAT-Symmetry Interface.
Proceedings of the 26th International Conference on Theory and Applications of Satisfiability Testing, 2023

2022
SAT Preprocessors and Symmetry.
Proceedings of the 25th International Conference on Theory and Applications of Satisfiability Testing, 2022

2021
Trainability for Universal GNNs Through Surgical Randomness.
CoRR, 2021

A Characterization of Individualization-Refinement Trees.
Proceedings of the 32nd International Symposium on Algorithms and Computation, 2021

Comparative Design-Choice Analysis of Color Refinement Algorithms Beyond the Worst Case.
Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

Search Problems in Trees with Symmetries: Near Optimal Traversal Strategies for Individualization-Refinement Algorithms.
Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

Parallel Computation of Combinatorial Symmetries.
Proceedings of the 29th Annual European Symposium on Algorithms, 2021

Engineering a Fast Probabilistic Isomorphism Test.
Proceedings of the 23rd Symposium on Algorithm Engineering and Experiments, 2021

2019
A Formal Semantics of Exposed Datapath Architectures with Buffered Processing Units.
Proceedings of the 19th International Conference on Application of Concurrency to System Design, 2019

2018
On Memory Optimal Code Generation for Exposed Datapath Architectures with Buffered Processing Units.
Proceedings of the 18th International Conference on Application of Concurrency to System Design, 2018


  Loading...