David Seka
Projektass.(FWF) Dipl.-Ing. / BSc
Role
-
PreDoc Researcher
Algorithms and Complexity, E192-01
Publications
- Graph Choosability via SAT: Beyond the Nullstellensatz / Kirchweger, M., Peitl, T., Seka, D., & Szeider, S. (2026). Graph Choosability via SAT: Beyond the Nullstellensatz. In S. Koenig, C. Jenkins, & M. E. Taylor (Eds.), Proceedings of the 40th Annual AAAI Conference on Artificial Intelligence (pp. 14269–14277). AAAI Press. https://doi.org/10.1609/aaai.v40i17.38441
-
Enumerating graphs with respect to their choosability
/
Seka, D. (2026). Enumerating graphs with respect to their choosability [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2026.142822
Download: PDF (747 KB)