Publications and bibtex files
SAT Modulo Symmetries for Graph Generation
The paper is available here.
@inproceedings{KirchwegerS21,
author = {Markus Kirchweger and
Stefan Szeider},
title = {{SAT} Modulo Symmetries for Graph Generation},
booktitle = {27th International Conference on Principles and Practice of Constraint
Programming, {CP} 2021, Montpellier, France (Virtual Conference),
October 25-29, 2021},
series = {LIPIcs},
volume = {210},
pages = {34:1--34:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
doi = {10.4230/LIPIcs.CP.2021.34}
}
Co-Certificate Learning with SAT Modulo Symmetries
@inproceedings{KirchwegerPeitlSzeider23,
title = {Co-Certificate Learning with {SAT} Modulo Symmetries},
author= {Kirchweger, Markus and Peitl, Tom\'{a}\v{s} and Szeider, Stefan},
year = {2023},
booktitle = {Proceedings of the 34th International Joint Conference on Artificial Intelligence, IJCAI 2023},
publisher = {AAAI Press/IJCAI},
note = {To appear}
}
SAT-Based Generation of Planar Graphs
@InProceedings{KirchwegerScheucherSzeider23,
author = {Markus Kirchweger and Manfred Scheucher and Stefan Szeider},
title = {{SAT}-Based Generation of Planar Graphs},
booktitle = {The 26th International Conference on Theory and
Applications of Satisfiability Testing (SAT 2023),
July 04-08, 2023, Alghero, Italy},
year = {2023},
editor = {Meena Mahajan and Friedrich Slivovsky},
series = {LIPIcs},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
note = {to appear}
}
A SAT Solver's Opinion on the Erdős-Faber-Lovász Conjecture
@InProceedings{KirchwegerPeitlSzeider23b,
author = {Markus Kirchweger and Tomáš Peitl and Stefan Szeider},
title = {A {SAT} Solver's Opinion on the {Erdős}-{Faber}-{Lovász} Conjecture},
booktitle = {The 26th International Conference on Theory and
Applications of Satisfiability Testing (SAT 2023),
July 04-08, 2023, Alghero, Italy},
year = {2023},
editor = {Meena Mahajan and Friedrich Slivovsky},
series = {LIPIcs},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
note = {to appear}
}