Next generation algorithms for grabbing and exploiting symmetry

Project Information

ENGAGES

Grant agreement ID: 820148

DOI

10.3030/820148

Project closed

EC signature date 18 December 2018

Start date 1 March 2019

End date 28 February 2025

Funded under

• EXCELLENT SCIENCE - European Research Council (ERC)

Total cost

€ 1 999 094,00

EU contribution

€ 1 999 094,00

Coordinated by

TECHNISCHE UNIVERSITAT DARMSTADT
Germany

CORDIS provides links to public deliverables and publications of HORIZON projects.

Links to deliverables and publications from FP7 projects, as well as links to some specific result types such as dataset and software, are dynamically retrieved from OpenAIRE .

Publications

Peer reviewed articles (10)

Classification of Finite Highly Regular Vertex-Colored Graphs

Author(s): Irene Heinrich, Thomas Schneider, Pascal Schweitzer
Published in: SIAM Journal on Discrete Mathematics, Issue 39, 2025, Page(s) 413-448, ISSN 0895-4801
Publisher: Society for Industrial and Applied Mathematics
DOI: 10.1137/23m1565309

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

Author(s): Oliver Bachtler, Irene Heinrich
Published in: Journal of Graph Theory, Issue 104, 2023, Page(s) 289-319, ISSN 0364-9024
Publisher: John Wiley & Sons Inc.
DOI: 10.1002/jgt.22964

On groups with chordal power graph, including a classification in the case of finite simple groups

Author(s): Jendrik Brachter; Eda Kaja
Published in: Journal of Algebraic Combinatorics, Issue 17, 2023, ISSN 0925-9899
Publisher: Kluwer Academic Publishers
DOI: 10.1007/s10801-023-01262-2

Limitations of the Invertible-Map Equivalences

Author(s): Anuj Dawar, Erich Grädel, Moritz Lichter,
Published in: Journal of Logic and Computation, Issue 0955792X, 2022, ISSN 0955-792X
Publisher: Oxford University Press
DOI: 10.1093/logcom/exac058

On the modular isomorphism problem for groups with center of index at most $$p^3$$

Author(s): Brenner, Sofia; García-Lucas, Diego
Published in: Archiv der Mathematik, Issue 13, 2024, ISSN 0003-889X
Publisher: Birkhauser Verlag
DOI: 10.1007/s00013-024-01977-z

Classification of countable 2-colored ultrahomogeneous graphs where each color class forms a disjoint union of cliques

Author(s): Sofia Brenner, Irene Heinrich
Published in: European Journal of Combinatorics, Issue 125, 2025, Page(s) 104093, ISSN 0195-6698
Publisher: Academic Press
DOI: 10.1016/j.ejc.2024.104093

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

Author(s): Sofia Brenner; Irene Heinrich
Published in: European Conference on Combinatorics, Graph Theory and Applications (EUROCOMB'23), Issue 8, 2023, ISSN 2788-3116
Publisher: EUROCOMB’23
DOI: 10.5817/cz.muni.eurocomb23-031

Classification of non-solvable groups whose power graph is a cograph

Author(s): Jendrik Brachter; Eda Kaja
Published in: Journal of Group Theory, Issue 6, 2023, ISSN 1433-5883
Publisher: Walter de Gruyter GmbH & Co. KG
DOI: 10.1515/jgth-2022-0081

A systematic approach to random data augmentation on graph neural networks

Author(s): Franks, Billy Joe; Anders, Markus; Kloft, Marius; Schweitzer, Pascal
Published in: Transactions on Machine Learning Research, Issue 12, 2023, ISSN 2835-8856
Publisher: Journal of Machine Learning Research Inc.
DOI: 10.48550/arxiv.2112.04314

Tuple regularity and -ultrahomogeneity for finite groups

Author(s): Brenner, Sofia
Published in: Journal of Group Theory, Issue 6, 2024, ISSN 1433-5883
Publisher: Walter de Gruyter GmbH & Co. KG
DOI: 10.1515/jgth-2023-0106

Conference proceedings (26)

Engineering a Preprocessor for Symmetry Detection

Author(s): Anders, Markus; Schweitzer, Pascal; Stieß, Julian
Published in: 21st International Symposium on Experimental Algorithms (SEA 2023), Issue 8, 2023, ISSN 1868-8969
Publisher: Dagstuhl Publishing
DOI: 10.48550/arxiv.2302.06351

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

Author(s): Anders, Markus; Schweitzer, Pascal; Wetzels, Florian
Published in: 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021), Issue 1, 2021
Publisher: Schloss Dagstuhl -- Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.icalp.2021.15

The Iteration Number of the Weisfeiler-Leman Algorithm

Author(s): Martin Grohe, Moritz Lichter, Daniel Neuen
Published in: 2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2024, Page(s) 1-13
Publisher: IEEE
DOI: 10.1109/lics56636.2023.10175741

Choiceless Polynomial Time with Witnessed Symmetric Choice

Author(s): Lichter, Moritz; Schweitzer, Pascal
Published in: LICS '22: Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer ScienceAugust 2022, 2022
Publisher: ACM
DOI: 10.1145/3531130.3533348

The Complexity of Symmetry Breaking Beyond Lex-Leader

Author(s): Markus Anders, Sofia Brenner, Gaurav Rattan
Published in: 2024
Publisher: Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Dagstuhl Publishing, Germany
DOI: 10.4230/lipics.cp.2024.3

A Characterization of Individualization-Refinement Trees

Author(s): Anders, Brachter, Schweitzer
Published in: 32nd International Symposium on Algorithms and Computation (ISAAC 2021), Issue 212, 2021, Page(s) 24:1--24:14, ISBN 978-3-95977-214-3
Publisher: "Schloss Dagstuhl -- Leibniz-Zentrum f{\""u}r Informatik"
DOI: 10.4230/lipics.isaac.2021.24

Computational Complexity of the Weisfeiler-Leman Dimension

Author(s): Lichter, Moritz; Raßmann, Simon; Schweitzer, Pascal
Published in: 33rd EACSL Annual Conference on Computer Science Logic : CSL 2025, February 10-14, 2025, Amsterdam, Netherlands / edited by Jörg Endrullis, Sylvain Schmitz<br/>33. EACSL Annual Conference on Computer Science Logic, CSL 2025, Amsterdam, Netherlands, 2025-02-10 - 2025-02-14, Issue 22, 2025
Publisher: Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Dagstuhl Publishing, Germany
DOI: 10.4230/lipics.csl.2025.13

Algorithms Transcending the SAT-Symmetry Interface

Author(s): Anders, Markus; Schweitzer, Pascal; Soos, Mate
Published in: 26th International Conference on Theory and Applications of Satisfiability Testing (SAT 2023), Issue 20, 2023, ISSN 1868-8969
Publisher: Dagstuhl Publishing
DOI: 10.48550/arxiv.2306.00613

Algorithms Transcending the SAT-Symmetry Interface

Author(s): Markus Anders, Pascal Schweitzer, Mate Soos
Published in: 2023
Publisher: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.sat.2023.1

Parallel Computation of Combinatorial Symmetries

Author(s): Anders, Schweitzer
Published in: ESA 2021, Issue 6, 2021
Publisher: "Schloss Dagstuhl -- Leibniz-Zentrum f{\""u}r Informatik"
DOI: 10.4230/lipics.esa.2021.6

Resolution with Symmetry Rule Applied to Linear Equations

Author(s): Schweitzer, Pascal; Seebach, Constantin
Published in: Symposium on Theoretical Aspects of Computer Science (STACS), Issue 3, 2021
Publisher: Schloss Dagstuhl -- Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.stacs.2021.58

Finite Variable Counting Logics with Restricted Requantification

Author(s): Simon Raßmann, Georg Schindling, Pascal Schweitzer
Published in: 33rd EACSL Annual Conference on Computer Science Logic (CSL 2025), 2025
Publisher: Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Dagstuhl Publishing, Germany
DOI: 10.4230/lipics.csl.2025.14

SAT Preprocessors and Symmetry.

Author(s): Markus Anders
Published in: 25th International Conference on Theory and Applications of Satisfiability Testing (SAT 2022), 2022
Publisher: "Schloss Dagstuhl -- Leibniz-Zentrum f{\""u}r Informatik"
DOI: 10.4230/lipics.sat.2022.1

Separating Rank Logic from Polynomial Time

Author(s): Moritz Lichter
Published in: 2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2021, Page(s) 1-13, ISBN 978-1-6654-4895-6
Publisher: IEEE
DOI: 10.1109/lics52264.2021.9470598

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

Author(s): Moritz Lichter, Ilia Ponomarenko, Pascal Schweitzer
Published in: 2019 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2019, Page(s) 1-13, ISBN 978-1-7281-3608-0
Publisher: IEEE
DOI: 10.1109/lics.2019.8785694

On the Weisfeiler-Leman Dimension of Finite Groups

Author(s): Jendrik Brachter, Pascal Schweitzer
Published in: Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science, 2020, Page(s) 287-300, ISBN 9781450371049
Publisher: ACM
DOI: 10.1145/3373718.3394786

A unifying method for the design of algorithms canonizing combinatorial objects

Author(s): Pascal Schweitzer, Daniel Wiebking
Published in: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing - STOC 2019, 2019, Page(s) 1247-1258, ISBN 9781450367059
Publisher: ACM Press
DOI: 10.1145/3313276.3316338

Satsuma: Structure-Based Symmetry Breaking in SAT

Author(s): Markus Anders, Sofia Brenner, Gaurav Rattan
Published in: 27th International Conference on Theory and Applications of Satisfiability Testing (SAT 2024), 2024
Publisher: Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Dagstuhl Publishing, Germany
DOI: 10.4230/lipics.sat.2024.4

Reductions for the 3-Decomposition Conjecture

Author(s): Bachtler, Oliver; Heinrich, Irene
Published in: Proceedings of the {XII} Latin-American Algorithms, Graphs and Optimization Symposium, {LAGOS} 2023, Issue 12, 2023, ISBN 9781713889816
Publisher: Elsevier
DOI: 10.1016/j.procs.2023.08.218

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

Author(s): Anders, Markus; Schweitzer, Pascal
Published in: 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021), Issue 4, 2021
Publisher: Schloss Dagstuhl -- Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.icalp.2021.16

Canonization for Bounded and Dihedral Color Classes in Choiceless Polynomial Time

Author(s): Lichter, Moritz; Schweitzer, Pascal
Published in: CSL 2021, Issue 3, 2021
Publisher: Schloss Dagstuhl -- Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.csl.2021.31

Taming Horizontal Instability in Merge Trees: On the Computation of a Comprehensive Deformation-Based Edit Distance

Author(s): Wetzels, Florian; Anders, Markus; Garth, Christoph
Published in: Topological Data Analysis and Visualization (TopoInVis), Issue 18, 2023, ISBN 979-8-3503-2964-3
Publisher: IEEE
DOI: 10.1109/topoinvis60193.2023.00015

Twin-width of graphs with tree-structured decompositions

Author(s): Heinrich, Irene; Raßmann, Simon
Published in: 18th International Symposium on Parameterized and Exact Computation (IPEC 2023), Issue 9, 2023, ISSN 1868-8969
Publisher: Dagstuhl Publishing
DOI: 10.48550/arxiv.2308.14677

Using Light Spanning Graphs for Passenger Assignment in Public Transport

Author(s): Heinrich, Irene; Herrala, Olli; Schiewe, Philine; Terho; Topias
Published in: Issue 16, 2023
Publisher: Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Dagstuhl Publishing, Germany

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

Author(s): Grohe, Martin; Lichter, Moritz; Neuen, Daniel; Schweitzer, Pascal
Published in: Crossref, Issue 24, 2023, ISBN 979-8-3503-1894-4
Publisher: IEEE Computer Society
DOI: 10.1109/focs57990.2023.00052

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

Author(s): Heinrich, Irene; Schiewe, Philine; Seebach; Constantin
Published in: Issue 17, 2023
Publisher: Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Dagstuhl Publishing, Germany

Book chapters (3)

Engineering a Fast Probabilistic Isomorphism Test

Author(s): Markus Anders, Pascal Schweitzer
Published in: 2021 Proceedings of the Workshop on Algorithm Engineering and Experiments (ALENEX), 2021, Page(s) 73-84, ISBN 978-1-61197-647-2
Publisher: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611976472.6

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

Author(s): Irene Heinrich, Till Heller, Eva Schmidt, Manuel Streicher
Published in: Graph-Theoretic Concepts in Computer Science - 46th International Workshop, WG 2020, Leeds, UK, June 24–26, 2020, Revised Selected Papers, Issue 12301, 2020, Page(s) 352-363, ISBN 978-3-030-60439-4
Publisher: Springer International Publishing
DOI: 10.1007/978-3-030-60440-0_28

Finite Vertex-Colored Ultrahomogeneous Oriented Graphs

Author(s): Irene Heinrich, Eda Kaja, Pascal Schweitzer
Published in: Lecture Notes in Computer Science, Graph-Theoretic Concepts in Computer Science, 2025, Page(s) 251-265
Publisher: Springer Nature Switzerland
DOI: 10.1007/978-3-031-75409-8_18