---
_id: '52127'
abstract:
- lang: eng
  text: 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.
author:
- first_name: Lucia
  full_name: Moura, Lucia
  last_name: Moura
- first_name: Anamari
  full_name: Nakic, Anamari
  last_name: Nakic
- first_name: Patric
  full_name: Östergård, Patric
  last_name: Östergård
- first_name: Alfred
  full_name: Wassermann, Alfred
  last_name: Wassermann
- first_name: Charlene
  full_name: Weiß, Charlene
  id: '70420'
  last_name: Weiß
citation:
  ama: Moura L, Nakic A, Östergård P, Wassermann A, Weiß C. <i>Pushing the Limits
    of Computational Combinatorial Constructions (Dagstuhl Seminar 23161)</i>. Vol
    13, Issue 4. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2023:40-57. doi:<a
    href="https://doi.org/10.4230/DagRep.13.4.40">10.4230/DagRep.13.4.40</a>
  apa: Moura, L., Nakic, A., Östergård, P., Wassermann, A., &#38; Weiß, C. (2023).
    <i>Pushing the Limits of Computational Combinatorial Constructions (Dagstuhl Seminar
    23161)</i> (Vols. 13, Issue 4, pp. 40–57). Schloss Dagstuhl - Leibniz-Zentrum
    für Informatik. <a href="https://doi.org/10.4230/DagRep.13.4.40">https://doi.org/10.4230/DagRep.13.4.40</a>
  bibtex: '@book{Moura_Nakic_Östergård_Wassermann_Weiß_2023, series={Dagstuhl Reports},
    title={Pushing the Limits of Computational Combinatorial Constructions (Dagstuhl
    Seminar 23161)}, volume={13, Issue 4}, DOI={<a href="https://doi.org/10.4230/DagRep.13.4.40">10.4230/DagRep.13.4.40</a>},
    publisher={Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, author={Moura,
    Lucia and Nakic, Anamari and Östergård, Patric and Wassermann, Alfred and Weiß,
    Charlene}, year={2023}, pages={40–57}, collection={Dagstuhl Reports} }'
  chicago: Moura, Lucia, Anamari Nakic, Patric Östergård, Alfred Wassermann, and Charlene
    Weiß. <i>Pushing the Limits of Computational Combinatorial Constructions (Dagstuhl
    Seminar 23161)</i>. Vol. 13, Issue 4. Dagstuhl Reports. Schloss Dagstuhl - Leibniz-Zentrum
    für Informatik, 2023. <a href="https://doi.org/10.4230/DagRep.13.4.40">https://doi.org/10.4230/DagRep.13.4.40</a>.
  ieee: L. Moura, A. Nakic, P. Östergård, A. Wassermann, and C. Weiß, <i>Pushing the
    Limits of Computational Combinatorial Constructions (Dagstuhl Seminar 23161)</i>,
    vol. 13, Issue 4. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023, pp.
    40–57.
  mla: Moura, Lucia, et al. <i>Pushing the Limits of Computational Combinatorial Constructions
    (Dagstuhl Seminar 23161)</i>. Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
    2023, pp. 40–57, doi:<a href="https://doi.org/10.4230/DagRep.13.4.40">10.4230/DagRep.13.4.40</a>.
  short: L. Moura, A. Nakic, P. Östergård, A. Wassermann, C. Weiß, Pushing the Limits
    of Computational Combinatorial Constructions (Dagstuhl Seminar 23161), Schloss
    Dagstuhl - Leibniz-Zentrum für Informatik, 2023.
date_created: 2024-02-27T15:44:41Z
date_updated: 2024-02-27T15:48:12Z
doi: 10.4230/DagRep.13.4.40
keyword:
- automorphism groups
- combinatorial algorithms
- finite geometries
- subspace designs
language:
- iso: eng
page: 40-57
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
series_title: Dagstuhl Reports
status: public
title: Pushing the Limits of Computational Combinatorial Constructions (Dagstuhl Seminar
  23161)
type: report
user_id: '70420'
volume: 13, Issue 4
year: '2023'
...