Please note that IST Research Explorer no longer supports Internet Explorer versions 8 or 9 (or earlier).

We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.

363 Publications


2021 | Journal Article | IST-REx-ID: 8793 | OA
Zeiner, M., Schmid, U., & Chatterjee, K. (2021). Optimal strategies for selecting coordinators. Discrete Applied Mathematics. Elsevier. https://doi.org/10.1016/j.dam.2020.10.022
View | Files available | DOI
 

2021 | Conference Paper | IST-REx-ID: 9296 | OA
Aichholzer, O., Arroyo Guevara, A. M., Masárová, Z., Parada, I., Perz, D., Pilz, A., … Vogtenhuber, B. (2021). On compatible matchings. In 15th International Conference on Algorithms and Computation (Vol. 12635, pp. 221–233). Virtual: Springer Nature. https://doi.org/10.1007/978-3-030-68211-8_18
View | DOI | Download Preprint (ext.) | arXiv
 

2021 | Journal Article | IST-REx-ID: 9293
Chatterjee, K., Dvořák, W., Henzinger, M., & Svozil, A. (2021). Algorithms and conditional lower bounds for planning problems. Artificial Intelligence. Elsevier. https://doi.org/10.1016/j.artint.2021.103499
View | Files available | DOI | arXiv
 

2021 | Journal Article | IST-REx-ID: 9311 | OA
Chatterjee, K., Saona Urmeneta, R. J., & Ziliotto, B. (2021). Finite-memory strategies in POMDPs with long-run average objectives. Mathematics of Operations Research. Institute for Operations Research and the Management Sciences. https://doi.org/10.1287/moor.2020.1116
View | DOI | Download Preprint (ext.) | arXiv
 

2021 | Journal Article | IST-REx-ID: 9393
Chatterjee, K., Ibsen-Jensen, R., & Pavlogiannis, A. (2021). Faster algorithms for quantitative verification in bounded treewidth graphs. Formal Methods in System Design. Springer. https://doi.org/10.1007/s10703-021-00373-5
View | DOI
 

Filters and Search Terms

department=KrCh

Search

Filter Publications