@InProceedings{zhang_et_al:LIPIcs.CP.2023.39,
author = {Zhang, Tianwei and Szeider, Stefan},
title = {{Searching for Smallest Universal Graphs and Tournaments with SAT}},
booktitle = {29th International Conference on Principles and Practice of Constraint Programming (CP 2023)},
pages = {39:1--39:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-300-3},
ISSN = {1868-8969},
year = {2023},
volume = {280},
editor = {Yap, Roland H. C.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2023.39},
URN = {urn:nbn:de:0030-drops-190760},
doi = {10.4230/LIPIcs.CP.2023.39},
annote = {Keywords: Constrained-based combinatorics, synthesis problems, symmetry breaking, SAT solving, subgraph isomorphism, tournament, directed graphs}
}