Published in: LIPIcs, Volume 301, 22nd International Symposium on Experimental Algorithms (SEA 2024)
Takehide Soh, Takumu Watanabe, Jun Kawahara, Akira Suzuki, and Takehiro Ito. Scalable Hard Instances for Independent Set Reconfiguration. In 22nd International Symposium on Experimental Algorithms (SEA 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 301, pp. 26:1-26:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{soh_et_al:LIPIcs.SEA.2024.26, author = {Soh, Takehide and Watanabe, Takumu and Kawahara, Jun and Suzuki, Akira and Ito, Takehiro}, title = {{Scalable Hard Instances for Independent Set Reconfiguration}}, booktitle = {22nd International Symposium on Experimental Algorithms (SEA 2024)}, pages = {26:1--26:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-325-6}, ISSN = {1868-8969}, year = {2024}, volume = {301}, editor = {Liberti, Leo}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2024.26}, URN = {urn:nbn:de:0030-drops-203913}, doi = {10.4230/LIPIcs.SEA.2024.26}, annote = {Keywords: Combinatorial reconfiguration, Benckmark dataset, Graph Algorithm, PSPACE-complete} }
Published in: LIPIcs, Volume 299, 9th International Conference on Formal Structures for Computation and Deduction (FSCD 2024)
René Thiemann and Akihisa Yamada. A Verified Algorithm for Deciding Pattern Completeness. In 9th International Conference on Formal Structures for Computation and Deduction (FSCD 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 299, pp. 27:1-27:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{thiemann_et_al:LIPIcs.FSCD.2024.27, author = {Thiemann, Ren\'{e} and Yamada, Akihisa}, title = {{A Verified Algorithm for Deciding Pattern Completeness}}, booktitle = {9th International Conference on Formal Structures for Computation and Deduction (FSCD 2024)}, pages = {27:1--27:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-323-2}, ISSN = {1868-8969}, year = {2024}, volume = {299}, editor = {Rehof, Jakob}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSCD.2024.27}, URN = {urn:nbn:de:0030-drops-203566}, doi = {10.4230/LIPIcs.FSCD.2024.27}, annote = {Keywords: Isabelle/HOL, pattern matching, term rewriting} }
Published in: LIPIcs, Volume 236, 25th International Conference on Theory and Applications of Satisfiability Testing (SAT 2022)
Jakob Bach, Markus Iser, and Klemens Böhm. A Comprehensive Study of k-Portfolios of Recent SAT Solvers. In 25th International Conference on Theory and Applications of Satisfiability Testing (SAT 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 236, pp. 2:1-2:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{bach_et_al:LIPIcs.SAT.2022.2, author = {Bach, Jakob and Iser, Markus and B\"{o}hm, Klemens}, title = {{A Comprehensive Study of k-Portfolios of Recent SAT Solvers}}, booktitle = {25th International Conference on Theory and Applications of Satisfiability Testing (SAT 2022)}, pages = {2:1--2:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-242-6}, ISSN = {1868-8969}, year = {2022}, volume = {236}, editor = {Meel, Kuldeep S. and Strichman, Ofer}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAT.2022.2}, URN = {urn:nbn:de:0030-drops-166767}, doi = {10.4230/LIPIcs.SAT.2022.2}, annote = {Keywords: Propositional satisfiability, solver portfolios, runtime prediction, machine learning, integer programming} }
Published in: LIPIcs, Volume 210, 27th International Conference on Principles and Practice of Constraint Programming (CP 2021)
Markus Iser and Tomáš Balyo. Unit Propagation with Stable Watches (Short Paper). In 27th International Conference on Principles and Practice of Constraint Programming (CP 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 210, pp. 6:1-6:8, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{iser_et_al:LIPIcs.CP.2021.6, author = {Iser, Markus and Balyo, Tom\'{a}\v{s}}, title = {{Unit Propagation with Stable Watches}}, booktitle = {27th International Conference on Principles and Practice of Constraint Programming (CP 2021)}, pages = {6:1--6:8}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-211-2}, ISSN = {1868-8969}, year = {2021}, volume = {210}, editor = {Michel, Laurent D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2021.6}, URN = {urn:nbn:de:0030-drops-152973}, doi = {10.4230/LIPIcs.CP.2021.6}, annote = {Keywords: Unit Propagation, Two-Watched Literals, Literal Stability} }