@InProceedings{toran_et_al:LIPIcs.SAT.2023.26,
author = {Tor\'{a}n, Jacobo and W\"{o}rz, Florian},
title = {{Cutting Planes Width and the Complexity of Graph Isomorphism Refutations}},
booktitle = {26th International Conference on Theory and Applications of Satisfiability Testing (SAT 2023)},
pages = {26:1--26:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-286-0},
ISSN = {1868-8969},
year = {2023},
volume = {271},
editor = {Mahajan, Meena and Slivovsky, Friedrich},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAT.2023.26},
URN = {urn:nbn:de:0030-drops-184884},
doi = {10.4230/LIPIcs.SAT.2023.26},
annote = {Keywords: Cutting Planes, Proof Complexity, Linear Programming, Combinatorial Optimization, Weisfeiler-Leman Algorithm, Graph Isomorphism}
}