Pushing the Limits of Computational Combinatorial Constructions (Dagstuhl Seminar 23161)

Lucia Moura (Editor), Anamari Nakic (Editor), Patric Östergård, Alfred Wassermann (Editor), Charlene Weiß (Editor)

Research output: Book/ReportAnthologyScientific

Abstract

This report documents the program and the outcomes of Dagstuhl Seminar 23161 “Pushing the Limits of Computational Combinatorial Constructions”.
In this Dagstuhl Seminar, we focused on computational methods for challenging problems in combinatorial construction. This includes algorithms for construction of combinatorial objects with prescribed symmetry, for isomorph-free exhaustive generation, and for combinatorial search. Examples of specific algorithmic techniques are tactical decomposition, the Kramer-Mesner method, algebraic methods, graph isomorphism software, isomorph-free generation, clique-finding methods, heuristic search, SAT solvers, and combinatorial optimization. There was an emphasis on problems involving graphs, designs and codes, also including topics in related fields such as finite geometry, graph decomposition, Hadamard matrices, Latin squares, and q-analogs of designs and codes.
Original languageEnglish
PublisherSchloss Dagstuhl - Leibniz-Zentrum für Informatik
Number of pages57
Volume13
Edition4
DOIs
Publication statusPublished - 2023
MoE publication typeD6 Edited professional books
EventDagstuhl Seminar 23161: Pushing the Limits of Computational Combinatorial Constructions - Wadern, Germany
Duration: 16 Apr 202321 Apr 2023

Publication series

NameDagstuhl Reports
PublisherSchloss Dagstuhl - Leibniz-Zentrum für Informatik
ISSN (Print)2192-5283

Fingerprint

Dive into the research topics of 'Pushing the Limits of Computational Combinatorial Constructions (Dagstuhl Seminar 23161)'. Together they form a unique fingerprint.

Cite this