Tianwei Zhang
Univ.Ass.in / MSc
Role
-
PreDoc Researcher
Algorithms and Complexity, E192-01
Publications
- The 3-Decomposition Conjecture: A SAT-Based Approach with Specialized Propagators / Zhang, T., & Szeider, S. (2025). The 3-Decomposition Conjecture: A SAT-Based Approach with Specialized Propagators. In M. Garcia de la Banda (Ed.), 31st International Conference on Principles and Practice of Constraint Programming (CP 2025) (pp. 1–19). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CP.2025.39
-
Small Unsatisfiable k-CNFs with Bounded Literal Occurrence
/
Zhang, T., Peitl, T., & Szeider, S. (2024). Small Unsatisfiable k-CNFs with Bounded Literal Occurrence. In 27th International Conference on Theory and Applications of Satisfiability Testing (SAT 2024) (No. 31; pp. 31:1-31:22). Schloss Dagstuhl – Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SAT.2024.31
Download: Small Unsatisfiable k-CNFs with Bounded Literal Occurrence (922 KB) -
Compilation and Fast Model Counting beyond CNF
/
de Colnet, A., Szeider, S., & Zhang, T. (2024). Compilation and Fast Model Counting beyond CNF. In K. Larson (Ed.), Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence (pp. 3315–3323). International Joint Conferences on Artificial Intelligence. https://doi.org/10.24963/ijcai.2024/367
Project: Overcoming Intractability in the Knowledge Compilation Map (2022–2025) -
Searching for Smallest Universal Graphs and Tournaments with SAT
/
Zhang, T., & Szeider, S. (2023). Searching for Smallest Universal Graphs and Tournaments with SAT. In R. Yap (Ed.), 29th International Conference on Principles and Practice of Constraint Programming. https://doi.org/10.4230/LIPIcs.CP.2023.39
Download: PDF (722 KB)
Project: REVEAL-AI (2020–2024)