Next generation algorithms for grabbing and exploiting symmetry

Informazioni relative al progetto

ENGAGES

ID dell’accordo di sovvenzione: 820148

DOI

10.3030/820148

Progetto chiuso

Data della firma CE 18 Dicembre 2018

Data di avvio 1 Marzo 2019

Data di completamento 28 Febbraio 2025

Finanziato da

• EXCELLENT SCIENCE - European Research Council (ERC)

Costo totale

€ 1 999 094,00

Contributo UE

€ 1 999 094,00

Coordinato da

TECHNISCHE UNIVERSITAT DARMSTADT
Germany

CORDIS fornisce collegamenti ai risultati finali pubblici e alle pubblicazioni dei progetti ORIZZONTE.

I link ai risultati e alle pubblicazioni dei progetti del 7° PQ, così come i link ad alcuni tipi di risultati specifici come dataset e software, sono recuperati dinamicamente da .OpenAIRE .

Pubblicazioni

Peer reviewed articles (10)

Classification of Finite Highly Regular Vertex-Colored Graphs

Autori: Irene Heinrich, Thomas Schneider, Pascal Schweitzer
Pubblicato in: SIAM Journal on Discrete Mathematics, Numero 39, 2025, Pagina/e 413-448, ISSN 0895-4801
Editore: 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

Autori: Oliver Bachtler, Irene Heinrich
Pubblicato in: Journal of Graph Theory, Numero 104, 2023, Pagina/e 289-319, ISSN 0364-9024
Editore: 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

Autori: Jendrik Brachter; Eda Kaja
Pubblicato in: Journal of Algebraic Combinatorics, Numero 17, 2023, ISSN 0925-9899
Editore: Kluwer Academic Publishers
DOI: 10.1007/s10801-023-01262-2

Limitations of the Invertible-Map Equivalences

Autori: Anuj Dawar, Erich Grädel, Moritz Lichter,
Pubblicato in: Journal of Logic and Computation, Numero 0955792X, 2022, ISSN 0955-792X
Editore: Oxford University Press
DOI: 10.1093/logcom/exac058

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

Autori: Brenner, Sofia; García-Lucas, Diego
Pubblicato in: Archiv der Mathematik, Numero 13, 2024, ISSN 0003-889X
Editore: 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

Autori: Sofia Brenner, Irene Heinrich
Pubblicato in: European Journal of Combinatorics, Numero 125, 2025, Pagina/e 104093, ISSN 0195-6698
Editore: Academic Press
DOI: 10.1016/j.ejc.2024.104093

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

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

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

Autori: Jendrik Brachter; Eda Kaja
Pubblicato in: Journal of Group Theory, Numero 6, 2023, ISSN 1433-5883
Editore: Walter de Gruyter GmbH & Co. KG
DOI: 10.1515/jgth-2022-0081

A systematic approach to random data augmentation on graph neural networks

Autori: Franks, Billy Joe; Anders, Markus; Kloft, Marius; Schweitzer, Pascal
Pubblicato in: Transactions on Machine Learning Research, Numero 12, 2023, ISSN 2835-8856
Editore: Journal of Machine Learning Research Inc.
DOI: 10.48550/arxiv.2112.04314

Tuple regularity and -ultrahomogeneity for finite groups

Autori: Brenner, Sofia
Pubblicato in: Journal of Group Theory, Numero 6, 2024, ISSN 1433-5883
Editore: Walter de Gruyter GmbH & Co. KG
DOI: 10.1515/jgth-2023-0106

Conference proceedings (26)

Engineering a Preprocessor for Symmetry Detection

Autori: Anders, Markus; Schweitzer, Pascal; Stieß, Julian
Pubblicato in: 21st International Symposium on Experimental Algorithms (SEA 2023), Numero 8, 2023, ISSN 1868-8969
Editore: Dagstuhl Publishing
DOI: 10.48550/arxiv.2302.06351

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

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

The Iteration Number of the Weisfeiler-Leman Algorithm

Autori: Martin Grohe, Moritz Lichter, Daniel Neuen
Pubblicato in: 2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2024, Pagina/e 1-13
Editore: IEEE
DOI: 10.1109/lics56636.2023.10175741

Choiceless Polynomial Time with Witnessed Symmetric Choice

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

The Complexity of Symmetry Breaking Beyond Lex-Leader

Autori: Markus Anders, Sofia Brenner, Gaurav Rattan
Pubblicato in: 2024
Editore: Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Dagstuhl Publishing, Germany
DOI: 10.4230/lipics.cp.2024.3

A Characterization of Individualization-Refinement Trees

Autori: Anders, Brachter, Schweitzer
Pubblicato in: 32nd International Symposium on Algorithms and Computation (ISAAC 2021), Numero 212, 2021, Pagina/e 24:1--24:14, ISBN 978-3-95977-214-3
Editore: "Schloss Dagstuhl -- Leibniz-Zentrum f{\""u}r Informatik"
DOI: 10.4230/lipics.isaac.2021.24

Computational Complexity of the Weisfeiler-Leman Dimension

Autori: Lichter, Moritz; Raßmann, Simon; Schweitzer, Pascal
Pubblicato 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, Numero 22, 2025
Editore: Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Dagstuhl Publishing, Germany
DOI: 10.4230/lipics.csl.2025.13

Algorithms Transcending the SAT-Symmetry Interface

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

Algorithms Transcending the SAT-Symmetry Interface

Autori: Markus Anders, Pascal Schweitzer, Mate Soos
Pubblicato in: 2023
Editore: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.sat.2023.1

Parallel Computation of Combinatorial Symmetries

Autori: Anders, Schweitzer
Pubblicato in: ESA 2021, Numero 6, 2021
Editore: "Schloss Dagstuhl -- Leibniz-Zentrum f{\""u}r Informatik"
DOI: 10.4230/lipics.esa.2021.6

Resolution with Symmetry Rule Applied to Linear Equations

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

Finite Variable Counting Logics with Restricted Requantification

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

SAT Preprocessors and Symmetry.

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

Separating Rank Logic from Polynomial Time

Autori: Moritz Lichter
Pubblicato in: 2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2021, Pagina/e 1-13, ISBN 978-1-6654-4895-6
Editore: IEEE
DOI: 10.1109/lics52264.2021.9470598

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

Autori: Moritz Lichter, Ilia Ponomarenko, Pascal Schweitzer
Pubblicato in: 2019 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2019, Pagina/e 1-13, ISBN 978-1-7281-3608-0
Editore: IEEE
DOI: 10.1109/lics.2019.8785694

On the Weisfeiler-Leman Dimension of Finite Groups

Autori: Jendrik Brachter, Pascal Schweitzer
Pubblicato in: Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science, 2020, Pagina/e 287-300, ISBN 9781450371049
Editore: ACM
DOI: 10.1145/3373718.3394786

A unifying method for the design of algorithms canonizing combinatorial objects

Autori: Pascal Schweitzer, Daniel Wiebking
Pubblicato in: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing - STOC 2019, 2019, Pagina/e 1247-1258, ISBN 9781450367059
Editore: ACM Press
DOI: 10.1145/3313276.3316338

Satsuma: Structure-Based Symmetry Breaking in SAT

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

Reductions for the 3-Decomposition Conjecture

Autori: Bachtler, Oliver; Heinrich, Irene
Pubblicato in: Proceedings of the {XII} Latin-American Algorithms, Graphs and Optimization Symposium, {LAGOS} 2023, Numero 12, 2023, ISBN 9781713889816
Editore: Elsevier
DOI: 10.1016/j.procs.2023.08.218

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

Autori: Anders, Markus; Schweitzer, Pascal
Pubblicato in: 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021), Numero 4, 2021
Editore: 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

Autori: Lichter, Moritz; Schweitzer, Pascal
Pubblicato in: CSL 2021, Numero 3, 2021
Editore: 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

Autori: Wetzels, Florian; Anders, Markus; Garth, Christoph
Pubblicato in: Topological Data Analysis and Visualization (TopoInVis), Numero 18, 2023, ISBN 979-8-3503-2964-3
Editore: IEEE
DOI: 10.1109/topoinvis60193.2023.00015

Twin-width of graphs with tree-structured decompositions

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

Using Light Spanning Graphs for Passenger Assignment in Public Transport

Autori: Heinrich, Irene; Herrala, Olli; Schiewe, Philine; Terho; Topias
Pubblicato in: Numero 16, 2023
Editore: Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Dagstuhl Publishing, Germany

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

Autori: Grohe, Martin; Lichter, Moritz; Neuen, Daniel; Schweitzer, Pascal
Pubblicato in: Crossref, Numero 24, 2023, ISBN 979-8-3503-1894-4
Editore: IEEE Computer Society
DOI: 10.1109/focs57990.2023.00052

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

Autori: Heinrich, Irene; Schiewe, Philine; Seebach; Constantin
Pubblicato in: Numero 17, 2023
Editore: Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Dagstuhl Publishing, Germany

Book chapters (3)

Engineering a Fast Probabilistic Isomorphism Test

Autori: Markus Anders, Pascal Schweitzer
Pubblicato in: 2021 Proceedings of the Workshop on Algorithm Engineering and Experiments (ALENEX), 2021, Pagina/e 73-84, ISBN 978-1-61197-647-2
Editore: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611976472.6

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

Autori: Irene Heinrich, Till Heller, Eva Schmidt, Manuel Streicher
Pubblicato in: Graph-Theoretic Concepts in Computer Science - 46th International Workshop, WG 2020, Leeds, UK, June 24–26, 2020, Revised Selected Papers, Numero 12301, 2020, Pagina/e 352-363, ISBN 978-3-030-60439-4
Editore: Springer International Publishing
DOI: 10.1007/978-3-030-60440-0_28

Finite Vertex-Colored Ultrahomogeneous Oriented Graphs

Autori: Irene Heinrich, Eda Kaja, Pascal Schweitzer
Pubblicato in: Lecture Notes in Computer Science, Graph-Theoretic Concepts in Computer Science, 2025, Pagina/e 251-265
Editore: Springer Nature Switzerland
DOI: 10.1007/978-3-031-75409-8_18