Next generation algorithms for grabbing and exploiting symmetry

Información del proyecto

ENGAGES

Identificador del acuerdo de subvención: 820148

DOI

10.3030/820148

Proyecto cerrado

Fecha de la firma de la CE 18 Diciembre 2018

Fecha de inicio 1 Marzo 2019

Fecha de finalización 28 Febrero 2025

Financiado con arreglo a

• EXCELLENT SCIENCE - European Research Council (ERC)

Coste total

€ 1 999 094,00

Aportación de la UE

€ 1 999 094,00

Coordinado por

TECHNISCHE UNIVERSITAT DARMSTADT
Germany

CORDIS proporciona enlaces a los documentos públicos y las publicaciones de los proyectos de los programas marco HORIZONTE.

Los enlaces a los documentos y las publicaciones de los proyectos del Séptimo Programa Marco, así como los enlaces a algunos tipos de resultados específicos, como conjuntos de datos y «software», se obtienen dinámicamente de OpenAIRE .

Publicaciones

Peer reviewed articles (10)

Classification of Finite Highly Regular Vertex-Colored Graphs

Autores: Irene Heinrich, Thomas Schneider, Pascal Schweitzer
Publicado en: SIAM Journal on Discrete Mathematics, Edición 39, 2025, Página(s) 413-448, ISSN 0895-4801
Editor: 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

Autores: Oliver Bachtler, Irene Heinrich
Publicado en: Journal of Graph Theory, Edición 104, 2023, Página(s) 289-319, ISSN 0364-9024
Editor: 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

Autores: Jendrik Brachter; Eda Kaja
Publicado en: Journal of Algebraic Combinatorics, Edición 17, 2023, ISSN 0925-9899
Editor: Kluwer Academic Publishers
DOI: 10.1007/s10801-023-01262-2

Limitations of the Invertible-Map Equivalences

Autores: Anuj Dawar, Erich Grädel, Moritz Lichter,
Publicado en: Journal of Logic and Computation, Edición 0955792X, 2022, ISSN 0955-792X
Editor: Oxford University Press
DOI: 10.1093/logcom/exac058

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

Autores: Brenner, Sofia; García-Lucas, Diego
Publicado en: Archiv der Mathematik, Edición 13, 2024, ISSN 0003-889X
Editor: 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

Autores: Sofia Brenner, Irene Heinrich
Publicado en: European Journal of Combinatorics, Edición 125, 2025, Página(s) 104093, ISSN 0195-6698
Editor: Academic Press
DOI: 10.1016/j.ejc.2024.104093

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

Autores: Sofia Brenner; Irene Heinrich
Publicado en: European Conference on Combinatorics, Graph Theory and Applications (EUROCOMB'23), Edición 8, 2023, ISSN 2788-3116
Editor: EUROCOMB’23
DOI: 10.5817/cz.muni.eurocomb23-031

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

Autores: Jendrik Brachter; Eda Kaja
Publicado en: Journal of Group Theory, Edición 6, 2023, ISSN 1433-5883
Editor: Walter de Gruyter GmbH & Co. KG
DOI: 10.1515/jgth-2022-0081

A systematic approach to random data augmentation on graph neural networks

Autores: Franks, Billy Joe; Anders, Markus; Kloft, Marius; Schweitzer, Pascal
Publicado en: Transactions on Machine Learning Research, Edición 12, 2023, ISSN 2835-8856
Editor: Journal of Machine Learning Research Inc.
DOI: 10.48550/arxiv.2112.04314

Tuple regularity and -ultrahomogeneity for finite groups

Autores: Brenner, Sofia
Publicado en: Journal of Group Theory, Edición 6, 2024, ISSN 1433-5883
Editor: Walter de Gruyter GmbH & Co. KG
DOI: 10.1515/jgth-2023-0106

Conference proceedings (26)

Engineering a Preprocessor for Symmetry Detection

Autores: Anders, Markus; Schweitzer, Pascal; Stieß, Julian
Publicado en: 21st International Symposium on Experimental Algorithms (SEA 2023), Edición 8, 2023, ISSN 1868-8969
Editor: Dagstuhl Publishing
DOI: 10.48550/arxiv.2302.06351

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

Autores: Anders, Markus; Schweitzer, Pascal; Wetzels, Florian
Publicado en: 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021), Edición 1, 2021
Editor: Schloss Dagstuhl -- Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.icalp.2021.15

The Iteration Number of the Weisfeiler-Leman Algorithm

Autores: Martin Grohe, Moritz Lichter, Daniel Neuen
Publicado en: 2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2024, Página(s) 1-13
Editor: IEEE
DOI: 10.1109/lics56636.2023.10175741

Choiceless Polynomial Time with Witnessed Symmetric Choice

Autores: Lichter, Moritz; Schweitzer, Pascal
Publicado en: LICS '22: Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer ScienceAugust 2022, 2022
Editor: ACM
DOI: 10.1145/3531130.3533348

The Complexity of Symmetry Breaking Beyond Lex-Leader

Autores: Markus Anders, Sofia Brenner, Gaurav Rattan
Publicado en: 2024
Editor: Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Dagstuhl Publishing, Germany
DOI: 10.4230/lipics.cp.2024.3

A Characterization of Individualization-Refinement Trees

Autores: Anders, Brachter, Schweitzer
Publicado en: 32nd International Symposium on Algorithms and Computation (ISAAC 2021), Edición 212, 2021, Página(s) 24:1--24:14, ISBN 978-3-95977-214-3
Editor: "Schloss Dagstuhl -- Leibniz-Zentrum f{\""u}r Informatik"
DOI: 10.4230/lipics.isaac.2021.24

Computational Complexity of the Weisfeiler-Leman Dimension

Autores: Lichter, Moritz; Raßmann, Simon; Schweitzer, Pascal
Publicado en: 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, Edición 22, 2025
Editor: Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Dagstuhl Publishing, Germany
DOI: 10.4230/lipics.csl.2025.13

Algorithms Transcending the SAT-Symmetry Interface

Autores: Anders, Markus; Schweitzer, Pascal; Soos, Mate
Publicado en: 26th International Conference on Theory and Applications of Satisfiability Testing (SAT 2023), Edición 20, 2023, ISSN 1868-8969
Editor: Dagstuhl Publishing
DOI: 10.48550/arxiv.2306.00613

Algorithms Transcending the SAT-Symmetry Interface

Autores: Markus Anders, Pascal Schweitzer, Mate Soos
Publicado en: 2023
Editor: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.sat.2023.1

Parallel Computation of Combinatorial Symmetries

Autores: Anders, Schweitzer
Publicado en: ESA 2021, Edición 6, 2021
Editor: "Schloss Dagstuhl -- Leibniz-Zentrum f{\""u}r Informatik"
DOI: 10.4230/lipics.esa.2021.6

Resolution with Symmetry Rule Applied to Linear Equations

Autores: Schweitzer, Pascal; Seebach, Constantin
Publicado en: Symposium on Theoretical Aspects of Computer Science (STACS), Edición 3, 2021
Editor: Schloss Dagstuhl -- Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.stacs.2021.58

Finite Variable Counting Logics with Restricted Requantification

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

SAT Preprocessors and Symmetry.

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

Separating Rank Logic from Polynomial Time

Autores: Moritz Lichter
Publicado en: 2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2021, Página(s) 1-13, ISBN 978-1-6654-4895-6
Editor: IEEE
DOI: 10.1109/lics52264.2021.9470598

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

Autores: Moritz Lichter, Ilia Ponomarenko, Pascal Schweitzer
Publicado en: 2019 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2019, Página(s) 1-13, ISBN 978-1-7281-3608-0
Editor: IEEE
DOI: 10.1109/lics.2019.8785694

On the Weisfeiler-Leman Dimension of Finite Groups

Autores: Jendrik Brachter, Pascal Schweitzer
Publicado en: Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science, 2020, Página(s) 287-300, ISBN 9781450371049
Editor: ACM
DOI: 10.1145/3373718.3394786

A unifying method for the design of algorithms canonizing combinatorial objects

Autores: Pascal Schweitzer, Daniel Wiebking
Publicado en: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing - STOC 2019, 2019, Página(s) 1247-1258, ISBN 9781450367059
Editor: ACM Press
DOI: 10.1145/3313276.3316338

Satsuma: Structure-Based Symmetry Breaking in SAT

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

Reductions for the 3-Decomposition Conjecture

Autores: Bachtler, Oliver; Heinrich, Irene
Publicado en: Proceedings of the {XII} Latin-American Algorithms, Graphs and Optimization Symposium, {LAGOS} 2023, Edición 12, 2023, ISBN 9781713889816
Editor: Elsevier
DOI: 10.1016/j.procs.2023.08.218

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

Autores: Anders, Markus; Schweitzer, Pascal
Publicado en: 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021), Edición 4, 2021
Editor: 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

Autores: Lichter, Moritz; Schweitzer, Pascal
Publicado en: CSL 2021, Edición 3, 2021
Editor: 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

Autores: Wetzels, Florian; Anders, Markus; Garth, Christoph
Publicado en: Topological Data Analysis and Visualization (TopoInVis), Edición 18, 2023, ISBN 979-8-3503-2964-3
Editor: IEEE
DOI: 10.1109/topoinvis60193.2023.00015

Twin-width of graphs with tree-structured decompositions

Autores: Heinrich, Irene; Raßmann, Simon
Publicado en: 18th International Symposium on Parameterized and Exact Computation (IPEC 2023), Edición 9, 2023, ISSN 1868-8969
Editor: Dagstuhl Publishing
DOI: 10.48550/arxiv.2308.14677

Using Light Spanning Graphs for Passenger Assignment in Public Transport

Autores: Heinrich, Irene; Herrala, Olli; Schiewe, Philine; Terho; Topias
Publicado en: Edición 16, 2023
Editor: Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Dagstuhl Publishing, Germany

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

Autores: Grohe, Martin; Lichter, Moritz; Neuen, Daniel; Schweitzer, Pascal
Publicado en: Crossref, Edición 24, 2023, ISBN 979-8-3503-1894-4
Editor: IEEE Computer Society
DOI: 10.1109/focs57990.2023.00052

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

Autores: Heinrich, Irene; Schiewe, Philine; Seebach; Constantin
Publicado en: Edición 17, 2023
Editor: Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Dagstuhl Publishing, Germany

Book chapters (3)

Engineering a Fast Probabilistic Isomorphism Test

Autores: Markus Anders, Pascal Schweitzer
Publicado en: 2021 Proceedings of the Workshop on Algorithm Engineering and Experiments (ALENEX), 2021, Página(s) 73-84, ISBN 978-1-61197-647-2
Editor: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611976472.6

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

Autores: Irene Heinrich, Till Heller, Eva Schmidt, Manuel Streicher
Publicado en: Graph-Theoretic Concepts in Computer Science - 46th International Workshop, WG 2020, Leeds, UK, June 24–26, 2020, Revised Selected Papers, Edición 12301, 2020, Página(s) 352-363, ISBN 978-3-030-60439-4
Editor: Springer International Publishing
DOI: 10.1007/978-3-030-60440-0_28

Finite Vertex-Colored Ultrahomogeneous Oriented Graphs

Autores: Irene Heinrich, Eda Kaja, Pascal Schweitzer
Publicado en: Lecture Notes in Computer Science, Graph-Theoretic Concepts in Computer Science, 2025, Página(s) 251-265
Editor: Springer Nature Switzerland
DOI: 10.1007/978-3-031-75409-8_18