Publications and bibtex files

SAT Modulo Symmetries for Graph Generation

The paper is available here

@article{KirchwegerS24,
  author    = {Markus Kirchweger and
               Stefan Szeider},
  title = {SAT Modulo Symmetries for Graph Generation and Enumeration},
  year = {2024},
  journal   = {{ACM} Trans. Comput. Log.},
  publisher = {Association for Computing Machinery},
  volume = {25},
  number = {3},
  issn = {1529-3785},
  doi = {10.1145/3670405},
}

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},
    doi = {10.24963/IJCAI.2023/216},
}

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},
    doi          = {10.4230/LIPICS.SAT.2023.14},
}

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},
    doi          = {10.4230/LIPICS.SAT.2023.13},
}

Computing small Rainbow Cycle Numbers with SAT modulo Symmetries

@InProceedings{KirchwegerSzeider24,
    author       = {Markus Kirchweger and Stefan Szeider},
    title        = {Computing small Rainbow Cycle Numbers with SAT modulo Symmetries},
    booktitle    = {30th International Conference on Principles and Practice of Constraint
                  Programming, {CP} 2024, September 2-6, 2024, Girona, Spain},            
    series       = {LIPIcs},
    volume       = {307},
    pages        = {37:1--37:11},
    publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
    year         = {2024},
    doi      = {10.4230/LIPICS.CP.2024.37},
}

Searching for Smallest Universal Graphs and Tournaments with SAT

@inproceedings{ZhangS23,
  author       = {Tianwei Zhang and
                  Stefan Szeider},
  title        = {Searching for Smallest Universal Graphs and Tournaments with {SAT}},
  booktitle    = {29th International Conference on Principles and Practice of Constraint
                  Programming, {CP} 2023, August 27-31, 2023, Toronto, Canada},
  series       = {LIPIcs},
  volume       = {280},
  pages        = {39:1--39:20},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2023},
  doi          = {10.4230/LIPICS.CP.2023.39},
}

Small Unsatisfiable k-CNFs with Bounded Literal Occurrence

@inproceedings{ZhangPS24,
  author       = {Tianwei Zhang and
                  Tom{\'{a}}s Peitl and
                  Stefan Szeider},
  title        = {Small Unsatisfiable k-CNFs with Bounded Literal Occurrence},
  booktitle    = {27th International Conference on Theory and Applications of Satisfiability
                  Testing, {SAT} 2024, August 21-24, 2024, Pune, India},
  series       = {LIPIcs},
  volume       = {305},
  pages        = {31:1--31:22},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2024},
  doi          = {10.4230/LIPICS.SAT.2024.31},
}