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

Authors Lucia Moura, Anamari Nakic, Patric Östergård, Alfred Wassermann, Charlene Weiß and all authors of the abstracts in this report



PDF
Thumbnail PDF

File

DagRep.13.4.40.pdf
  • Filesize: 2.08 MB
  • 18 pages

Document Identifiers

Author Details

Lucia Moura
  • University of Ottawa, CA
Anamari Nakic
  • University of Zagreb, HR
Patric Östergård
  • Aalto University, FI
Alfred Wassermann
  • Universität Bayreuth, DE
Charlene Weiß
  • Universität Paderborn, DE
and all authors of the abstracts in this report

Cite AsGet BibTex

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)
https://doi.org/10.4230/DagRep.13.4.40

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.

Subject Classification

ACM Subject Classification
  • Mathematics of computing → Discrete mathematics
  • Mathematics of computing → Mathematical software
Keywords
  • automorphism groups
  • combinatorial algorithms
  • finite geometries
  • subspace designs

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail