Authors: Dreier, Jan, Ordyniak, Sebastian^{Aff2, IDs10601023093623_cor2}, Szeider, Stefan

Superior Title: Constraints: An International Journal. 28(3):450-471

Authors: Dreier, Jan, Ordyniak, Sebastian, Szeider, Stefan

Superior Title: In Journal of Computer and System Sciences June 2024 142

Authors: Ordyniak, Sebastian, Schidler, Andre, Szeider, Stefan

Superior Title: In Journal of Computer and System Sciences May 2024

Authors: Chew, Leroy, de Colnet, Alexis, Slivovsky, Friedrich, Szeider, Stefan

Subject Terms: Computational Complexity cs.CC, FOS Computer and information sciences

Availability: https://doi.org/10.48550/arxiv.2402.00542
https://arxiv.org/abs/2402.00542

Authors: Heule, Marijn J. H., Lynce, Inês, Szeider, Stefan, Schidler, Andre

Subject Terms: constraint propagation, lower and upper bounds, problem formulation, propositional satisfiability, symmetry breaking, Theory of computation → Constraint and logic programming, Theory of computation → Discrete optimization

File Description: application/pdf

Relation: https://dx.doi.org/10.4230/DagRep.13.6.0

Availability: https://doi.org/10.4230/dagrep.13.6.10610.4230/DagRep.13.6.0

Authors: Peitl, Tomáš, Szeider, Stefan

Superior Title: In Discrete Applied Mathematics 15 October 2023 337:173-184

Authors: Fazekas, Katalin, Niemetz, Aina, Preiner, Mathias, Kirchweger, Markus, Szeider, Stefan, Biere, Armin

Subject Terms: SAT, CDCL, Satisfiability Modulo Theories, Satisfiability Modulo Symmetries, Theory of computation → Automated reasoning

File Description: application/pdf

Relation: https://github.com/markirch/sat-modulo-symmetries/; https://github.com/cvc5/cvc5; https://github.com/arminbiere/cadical; https://ieeexplore.ieee.org/document/6679385/; {http://smt-lib.org}; http://www.usenix.org/events/osdi08/tech/full_papers/cadar/cadar.pdf; https://dx.doi.org/10.5281/zenodo.8003683; https://dx.doi.org/10.4230/LIPIcs.SAT.2023; https://dx.doi.org/10.1007/978-3-642-25870-1_4; https://dx.doi.org/10.3233/FAIA201008; https://dx.doi.org/10.1007/978-3-030-53288-8_9; https://dx.doi.org/10.1016/j.artint.2016.08.007; https://dx.doi.org/10.1007/978-3-030-99524-9_24; https://dx.doi.org/10.1007/3-540-45657-0_18; https://dx.doi.org/10.3233/FAIA201017; https://dx.doi.org/10.1007/978-3-031-24950-1_5; https://dx.doi.org/10.1007/978-3-642-36742-7_7; https://dx.doi.org/10.1007/978-3-540-78800-3_24

Availability: https://doi.org/10.4230/lipics.sat.2023.810.5281/zenodo.800368310.4230/LIPIcs.SAT.202310.1007/978-3-642-25870-1_410.3233/FAIA20100810.1007/978-3-030-53288-8_910.1016/j.artint.2016.08.00710.1007/978-3-030-99524-9_2410.1007/3-540-45657-0_1810.3233/FAIA20101710.1007/978-3-031-24950-1_510.1007/978-3-642-36742-7_710.1007/978-3-540-78800-3_24

Authors: Kirchweger, Markus, Scheucher, Manfred, Szeider, Stefan

Subject Terms: SAT modulo Symmetry SMS, dynamic symmetry breaking, planarity test, universal point set, order dimension, Schnyder’s theorem, Kuratowski’s theorem, Turán’s theorem, Earth-Moon problem, Mathematics of computing → Solvers, Mathematics of computing → Graph enumeration, Theory of computation → Automated reasoning, Hardware → Theorem proving and SAT solving

File Description: application/pdf

Relation: https://github.com/markirch/sat-modulo-symmetries/; https://sat-modulo-symmetries.readthedocs.io/; http://www.boost.org/; https://dx.doi.org/10.4230/LIPIcs.SAT.2023; https://dx.doi.org/10.1007/978-3-662-57265-8; https://dx.doi.org/10.1038/scientificamerican1077-108; https://dx.doi.org/10.7155/jgaa.00318; https://dx.doi.org/10.7155/jgaa.00091; https://dx.doi.org/10.1007/978-3-642-45281-9_3; https://dx.doi.org/10.1145/3320344; https://dx.doi.org/10.1016/S0022-0000(73)80029-7; https://dx.doi.org/10.37236/10774; https://dx.doi.org/10.1145/62212.62254; https://dx.doi.org/10.1002/jgt.21991; https://dx.doi.org/10.1007/s41980-021-00644-1; https://dx.doi.org/10.1016/j.disc.2021.112794; https://dx.doi.org/10.1007/978-3-322-80303-0; https://dx.doi.org/http://doi.org/10.48550/arxiv.2303.00109

Availability: https://doi.org/10.4230/lipics.sat.2023.1410.4230/LIPIcs.SAT.202310.1007/978-3-662-57265-810.1038/scientificamerican1077-10810.7155/jgaa.0031810.7155/jgaa.0009110.1007/978-3-642-45281-9_310.1145/332034410.1016/S0022-0000(73)80029-710.37236/1077410.1145/62212.6225410.1002/jgt.2199110.1007/s41980-021-00644-110.1016/j.disc.2021.11279410.1007/978-3-322-80303-0http://doi.org/10.48550/arxiv.2303.00109

Authors: Kirchweger, Markus, Peitl, Tomáš, Szeider, Stefan

Subject Terms: hypergraphs, graph coloring, SAT modulo symmetries, Theory of computation → Automated reasoning, Mathematics of computing → Hypergraphs, Mathematics of computing → Graph coloring, Mathematics of computing → Graph enumeration, Mathematics of computing → Matchings and factors

File Description: application/pdf

Relation: https://github.com/markirch/sat-modulo-symmetries/; https://sat-modulo-symmetries.readthedocs.io/; https://dx.doi.org/10.4230/LIPIcs.SAT.2023; https://dx.doi.org/10.1007/s10601-018-9294-5; https://dx.doi.org/10.4230/LIPIcs.SAT.2023.8; https://dx.doi.org/10.1145/3560469; https://dx.doi.org/10.1016/0304-3975(85)90144-6; https://dx.doi.org/10.4153/CJM-1981-046-9; https://dx.doi.org/10.48550/arXiv.2101.04698; https://dx.doi.org/10.4230/LIPIcs.SAT.2022.4; https://dx.doi.org/10.4230/LIPIcs.CP.2021.34; https://dx.doi.org/10.1016/j.jsc.2013.09.003; https://dx.doi.org/10.1142/S1793830914500396; https://dx.doi.org/10.1007/11564751_73; https://dx.doi.org/10.1007/978-3-319-09284-3_31

Availability: https://doi.org/10.4230/lipics.sat.2023.1310.4230/LIPIcs.SAT.202310.1007/s10601-018-9294-510.4230/LIPIcs.SAT.2023.810.1145/356046910.1016/0304-3975(85)90144-610.4153/CJM-1981-046-910.48550/arXiv.2101.0469810.4230/LIPIcs.SAT.2022.410.4230/LIPIcs.CP.2021.3410.1016/j.jsc.2013.09.00310.1142/S179383091450039610.1007/11564751_7310.1007/978-3-319-09284-3_31

Authors: Eiben, Eduard, Ganian, Robert, Kanj, Iyad, Ordyniak, Sebastian, Szeider, Stefan

Subject Terms: Independent Set, Powers of Hypercubes, Diversity, Parameterized Complexity, Incomplete Data, Theory of computation → Parameterized complexity and exact algorithms

File Description: application/pdf

Relation: https://dx.doi.org/10.4230/LIPIcs.IPEC.2023; https://dx.doi.org/10.1007/978-1-4471-5559-1; https://dx.doi.org/10.1609/aaai.v35i8.16896

Availability: https://doi.org/10.4230/lipics.ipec.2023.1610.4230/LIPIcs.IPEC.202310.1007/978-1-4471-5559-110.1609/aaai.v35i8.16896

Authors: Peruvemba Ramaswamy, Vaidyanathan, Szeider, Stefan

Subject Terms: combinatorial design, SAT encodings, certified optimality, arithmetic constraints, spatially balanced Latin rectangles, Hardware → Theorem proving and SAT solving, Theory of computation → Constraint and logic programming, Mathematics of computing → Combinatoric problems, Software and its engineering → Constraints, Theory of computation → Integer programming, Mathematics of computing → Combinatorial optimization, Mathematics of computing → Enumeration, Mathematics of computing → Solvers, Computing methodologies → Theorem proving algorithms, Applied computing → Agriculture

File Description: application/pdf

Relation: https://tuhat.helsinki.fi/ws/files/142452772/sc2020_proceedings.pdf; https://dx.doi.org/10.5281/zenodo.8151905; https://dx.doi.org/10.4230/LIPIcs.CP.2023; https://dx.doi.org/10.1007/11527695_1; https://dx.doi.org/10.1007/978-3-319-59776-8_6; https://dx.doi.org/10.1145/3560469; https://dx.doi.org/10.1007/978-3-319-66107-0_18; https://dx.doi.org/10.24963/ijcai.2017/683; https://dx.doi.org/10.1007/978-3-319-94144-8_26; https://dx.doi.org/10.2134/agronj14.0232; https://dx.doi.org/10.1609/aaai.v26i1.8147; https://dx.doi.org/10.1007/978-3-540-74970-7_38; https://dx.doi.org/10.1007/978-3-319-94144-8_18; https://dx.doi.org/10.1007/978-3-319-09284-3_31

Availability: https://doi.org/10.4230/lipics.cp.2023.4810.5281/zenodo.815190510.4230/LIPIcs.CP.202310.1007/11527695_110.1007/978-3-319-59776-8_610.1145/356046910.1007/978-3-319-66107-0_1810.24963/ijcai.2017/68310.1007/978-3-319-94144-8_2610.2134/agronj14.023210.1609/aaai.v26i1.814710.1007/978-3-540-74970-7_3810.1007/978-3-319-94144-8_1810.1007/978-3-319-09284-3_31

Authors: Zhang, Tianwei, Szeider, Stefan

Subject Terms: Constrained-based combinatorics, synthesis problems, symmetry breaking, SAT solving, subgraph isomorphism, tournament, directed graphs, Mathematics of computing → Extremal graph theory, Software and its engineering → Constraint and logic languages, Hardware → Theorem proving and SAT solving, Mathematics of computing → Graph enumeration

File Description: application/pdf

Relation: https://tuhat.helsinki.fi/ws/files/142452772/sc2020_proceedings.pdf; http://reports-archive.adm.cs.cmu.edu/anon/2022/CMU-CS-22-106.pdf; https://hdl.handle.net/20.500.12380/304104; https://dx.doi.org/10.5281/zenodo.8147732; https://dx.doi.org/10.4230/LIPIcs.CP.2023; https://dx.doi.org/10.1007/s00039-017-0396-9; https://dx.doi.org/10.1145/2746539.2746545; https://dx.doi.org/10.1038/scientificamerican1077-108; https://dx.doi.org/10.1007/s10817-018-9490-4; https://dx.doi.org/10.1145/3560469; https://dx.doi.org/10.24963/ijcai.2020/158; https://dx.doi.org/10.1007/978-3-319-66107-0_18; https://dx.doi.org/10.1145/3107239; https://dx.doi.org/10.1007/978-3-319-94144-8_26; https://dx.doi.org/10.4230/LIPIcs.SAT.2022.4; https://dx.doi.org/10.4230/LIPIcs.CP.2021.34; https://dx.doi.org/10.34727/2022/isbn.978-3-85448-053-2_24; https://dx.doi.org/10.1007/978-3-030-51372-6_19

Availability: https://doi.org/10.4230/lipics.cp.2023.3910.5281/zenodo.814773210.4230/LIPIcs.CP.202310.1007/s00039-017-0396-910.1145/2746539.274654510.1038/scientificamerican1077-10810.1007/s10817-018-9490-410.1145/356046910.24963/ijcai.2020/15810.1007/978-3-319-66107-0_1810.1145/310723910.1007/978-3-319-94144-8_2610.4230/LIPIcs.SAT.2022.410.4230/LIPIcs.CP.2021.3410.34727/2022/isbn.978-3-85448-053-2_2410.1007/978-3-030-51372-6_19

Authors: Schidler, André, Szeider, Stefan

Superior Title: In Artificial Intelligence September 2023

Authors: Xia, Hai, Szeider, Stefan

Relation: https://dx.doi.org/10.5281/zenodo.10407175

Availability: https://doi.org/10.5281/zenodo.1040717410.5281/zenodo.10407175

Authors: Schidler, Andre, Szeider, Stefan

Relation: https://dx.doi.org/10.5281/zenodo.10362710

Availability: https://doi.org/10.5281/zenodo.1036270910.5281/zenodo.10362710

Authors: Gaspers, Serge, Koivisto, Mikko, Liedloff, Mathieu, Ordyniak, Sebastian, Szeider, Stefan

Contributors: Department of Computer Science

Subject Terms: 111 Mathematics

File Description: application/pdf

Relation: https://doi.org/10.1609/aaai.v26i1.8217; Proceedings of the AAAI Conference on Artificial Intelligence; Gaspers , S , Koivisto , M , Liedloff , M , Ordyniak , S & Szeider , S 2021 , ' On Finding Optimal Polytrees ' , Proceedings of the AAAI Conference on Artificial Intelligence , vol. 26 , no. 1 , pp. 750-756 . https://doi.org/10.1609/aaai.v26i1.8217; PURE: 257136784; PURE UUID: 8c270bcc-40e2-4876-9ab8-f65c832b3853; Bibtex: Gaspers_Koivisto_Liedloff_Ordyniak_Szeider_2021; ORCID: /0000-0001-9662-3605/work/130145013; http://hdl.handle.net/10138/355317; https://ojs.aaai.org/index.php/AAAI/article/view/8217

Availability: https://doi.org/10.1609/aaai.v26i1.8217
http://hdl.handle.net/10138/355317
https://ojs.aaai.org/index.php/AAAI/article/view/8217

Authors: Kirchweger, Markus, Peitl, Tomáš, Szeider, Stefan

Subject Terms: Quantum Physics, Computer Science - Artificial Intelligence, Computer Science - Discrete Mathematics, Computer Science - Logic in Computer Science

Relation: http://arxiv.org/abs/2306.10427

Availability: http://arxiv.org/abs/2306.10427

Authors: Reichl, Franz-Xaver^Aff10, Slivovsky, Friedrich^Aff10, Szeider, Stefan^Aff10

Contributors: Goos, Gerhard, Founding Editor^Aff1, Hartmanis, Juris, Founding Editor^Aff2, Bertino, Elisa, Editorial Board Member^Aff3, Gao, Wen, Editorial Board Member^Aff4, Steffen, Bernhard, Editorial Board Member^Aff5, Woeginger, Gerhard, Editorial Board Member^Aff6, Yung, Moti, Editorial Board Member^Aff7, Li, Chu-Min, editor^Aff8, Manyà, Felip, editor^Aff9

Superior Title: Theory and Applications of Satisfiability Testing – SAT 2021 : 24th International Conference, Barcelona, Spain, July 5-9, 2021, Proceedings. 12831:499-517

Authors: Kirchweger, Markus, Scheucher, Manfred, Szeider, Stefan

Subject Terms: SAT modulo Symmetry SMS, dynamic symmetry breaking, Rota’s basis conjecture, matroid, Mathematics of computing → Matroids and greedoids, Mathematics of computing → Solvers, Hardware → Theorem proving and SAT solving

File Description: application/pdf

Relation: http://researchportal.helsinki.fi/en/publications/proceedings-of-sat-race-2019-solver-and-benchmark-descriptions; http://educ.jmu.edu/~duceyje/undergrad/2012/mike.pdf; https://www.mat.univie.ac.at/~slc/wpapers/s51dukes.html; https://dx.doi.org/10.5281/zenodo.6616343; https://dx.doi.org/10.5281/zenodo.6616373; https://dx.doi.org/10.4230/LIPIcs.SAT.2022; https://dx.doi.org/10.1007/BF01204715; https://dx.doi.org/10.1016/j.ejc.2017.06.010; https://dx.doi.org/10.1093/imrn/rnaa004; https://dx.doi.org/10.1016/0012-365X(94)00071-3; https://dx.doi.org/10.1007/s10601-018-9294-5; https://dx.doi.org/10.37236/8531; https://dx.doi.org/10.1007/978-3-319-66263-3_6; https://dx.doi.org/10.1007/978-3-319-40970-2_8; https://dx.doi.org/10.37236/1794; https://dx.doi.org/10.1006/aima.1997.1623

Availability: https://doi.org/10.4230/lipics.sat.2022.410.5281/zenodo.661634310.5281/zenodo.661637310.4230/LIPIcs.SAT.202210.1007/BF0120471510.1016/j.ejc.2017.06.01010.1093/imrn/rnaa00410.1016/0012-365X(94)00071-310.1007/s10601-018-9294-510.37236/853110.1007/978-3-319-66263-3_610.1007/978-3-319-40970-2_810.37236/179410.1006/aima.1997.1623

Authors: Ganian, Robert, Pokrývka, Filip, Schidler, André, Simonov, Kirill, Szeider, Stefan

Subject Terms: Weighted model counting, twin-width, parameterized complexity, SAT, Theory of computation → Parameterized complexity and exact algorithms

File Description: application/pdf

Relation: https://www.ac.tuwien.ac.at/files/tr/ac-tr-21-004.pdf; https://dx.doi.org/10.5281/zenodo.6610819; https://dx.doi.org/10.4230/LIPIcs.SAT.2022; https://dx.doi.org/10.4230/LIPIcs.ICALP.2021.35; https://dx.doi.org/10.1007/978-3-319-21275-3; https://dx.doi.org/10.1007/978-3-319-66263-3_2; https://dx.doi.org/10.1145/2736696; https://dx.doi.org/10.1007/978-3-319-09284-3_3; https://dx.doi.org/10.1137/1.9781611977042.6

Availability: https://doi.org/10.4230/lipics.sat.2022.1510.5281/zenodo.661081910.4230/LIPIcs.SAT.202210.4230/LIPIcs.ICALP.2021.3510.1007/978-3-319-21275-310.1007/978-3-319-66263-3_210.1145/273669610.1007/978-3-319-09284-3_310.1137/1.9781611977042.6