License: Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/DagRep.13.4.40
URN: urn:nbn:de:0030-drops-192384
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2023/19238/
Go back to Dagstuhl Reports

Moura, Lucia ; Nakic, Anamari ; Östergård, Patric ; Wassermann, Alfred ; Weiß, Charlene
Weitere Beteiligte (Hrsg. etc.): Lucia Moura and Anamari Nakic and Patric Östergård and Alfred Wassermann and Charlene Weiß

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

pdf-format:
dagrep_v013_i004_p040_23161.pdf (2 MB)

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.

BibTeX - Entry

@Article{moura_et_al:DagRep.13.4.40,
  author =	{Moura, Lucia and Nakic, Anamari and \"{O}sterg\r{a}rd, Patric and Wassermann, Alfred and Wei{\ss}, Charlene},
  title =	{{Pushing the Limits of Computational Combinatorial Constructions (Dagstuhl Seminar 23161)}},
  pages =	{40--57},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2023},
  volume =	{13},
  number =	{4},
  editor =	{Moura, Lucia and Nakic, Anamari and \"{O}sterg\r{a}rd, Patric and Wassermann, Alfred and Wei{\ss}, Charlene},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/opus/volltexte/2023/19238},
  URN =		{urn:nbn:de:0030-drops-192384},
  doi =		{10.4230/DagRep.13.4.40},
  annote =	{Keywords: automorphism groups, combinatorial algorithms, finite geometries, subspace designs}
}

Keywords: automorphism groups, combinatorial algorithms, finite geometries, subspace designs
Collection: DagRep, Volume 13, Issue 4
Issue Date: 2023
Date of publication: 02.11.2023

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI