DROPS

Document

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

Authors: Lucia Moura, Anamari Nakic, Patric Östergård, Alfred Wassermann, and Charlene Weiß

Published in: Dagstuhl Reports, Volume 13, Issue 4 (2023)

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.

Cite as

Lucia Moura, Anamari Nakic, Patric Östergård, Alfred Wassermann, and Charlene Weiß. Pushing the Limits of Computational Combinatorial Constructions (Dagstuhl Seminar 23161). In Dagstuhl Reports, Volume 13, Issue 4, pp. 40-57, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)

Copy BibTex To Clipboard

@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/entities/document/10.4230/DagRep.13.4.40},
  URN =		{urn:nbn:de:0030-drops-192384},
  doi =		{10.4230/DagRep.13.4.40},
  annote =	{Keywords: automorphism groups, combinatorial algorithms, finite geometries, subspace designs}
}

Search Results

Documents authored by Östergård, Patric

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

Abstract

Cite as

Thanks for your feedback!

Could not send message