Pavlogiannis, A., Tkadlec, J., Chatterjee, K., &; Nowak , M. (2017). Strong amplifiers of natural selection. Institute of Science and Technology Austria.https://doi.org/10.15479/AT:ISTA:51 
LibreCat: https://research-explorer.ista.ac.at/record/5559
DOI: 10.15479/AT:ISTA:51

Chatterjee, K., Fu, H., &; Goharshady, A. K. (2017). Non-polynomial worst case analysis of recursive programs. In R. Majumdar &; V. Kundak (Eds.) (Vol. 10427, pp. 41–63). Presented at the CAV: Computer Aided Verification, Heidelberg, Germany: Springer.https://doi.org/10.1007/978-3-319-63390-9_3 
LibreCat: https://research-explorer.ista.ac.at/record/639
DOI: 10.1007/978-3-319-63390-9_3
arXiv: 1705.00317

Chatterjee, K., Goharshady, A. K., &; Pavlogiannis, A. (2017). JTDec: A tool for tree decompositions in soot. In D. D’Souza (Ed.) (Vol. 10482, pp. 59–66). Presented at the ATVA: Automated Technology for Verification and Analysis, Pune, India: Springer.https://doi.org/10.1007/978-3-319-68167-2_4 
LibreCat: https://research-explorer.ista.ac.at/record/949
DOI: 10.1007/978-3-319-68167-2_4
WoS: 000723567800004

Chatterjee, K., Dvorák, W., Henzinger, M. H., &; Loitzenbauer, V. (2016). Conditionally optimal algorithms for generalized Büchi Games (Vol. 58). Presented at the MFCS: Mathematical Foundations of Computer Science (SG), Krakow, Poland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.MFCS.2016.25 
LibreCat: https://research-explorer.ista.ac.at/record/1068
DOI: 10.4230/LIPIcs.MFCS.2016.25

Chonev, V. K., Ouaknine, J., &; Worrell, J. (2016). On the skolem problem for continuous linear dynamical systems (Vol. 55). Presented at the ICALP: Automata, Languages and Programming, Rome, Italy: Schloss Dagstuhl- Leibniz-Zentrum fur Informatik.https://doi.org/10.4230/LIPIcs.ICALP.2016.100 
LibreCat: https://research-explorer.ista.ac.at/record/1069
DOI: 10.4230/LIPIcs.ICALP.2016.100

Chatterjee, K., &; Doyen, L. (2016). Computation tree logic for synchronization properties (Vol. 55). Presented at the ICALP: Automata, Languages and Programming, Rome, Italy: Schloss Dagstuhl- Leibniz-Zentrum fur Informatik.https://doi.org/10.4230/LIPIcs.ICALP.2016.98 
LibreCat: https://research-explorer.ista.ac.at/record/1070
DOI: 10.4230/LIPIcs.ICALP.2016.98

Chatterjee, K., Henzinger, T. A., &; Otop, J. (2016). Nested weighted limit-average automata of bounded width (Vol. 58). Presented at the MFCS: Mathematical Foundations of Computer Science (SG), Krakow; Poland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.MFCS.2016.24 
LibreCat: https://research-explorer.ista.ac.at/record/1090
DOI: 10.4230/LIPIcs.MFCS.2016.24

Chatterjee, K., Henzinger, T. A., &; Otop, J. (2016). Quantitative automata under probabilistic semantics. In Proceedings of the 31st Annual ACM/IEEE Symposium (pp. 76–85). New York, NY, USA: IEEE.https://doi.org/10.1145/2933575.2933588 
LibreCat: https://research-explorer.ista.ac.at/record/1138
DOI: 10.1145/2933575.2933588
arXiv: 1604.06764

Chatterjee, K., Dvoák, W., Henzinger, M. H., &; Loitzenbauer, V. (2016). Model and objective separation with conditional lower bounds: disjunction is harder than conjunction. In Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science (pp. 197–206). New York, NY, USA: IEEE.https://doi.org/10.1145/2933575.2935304 
LibreCat: https://research-explorer.ista.ac.at/record/1140
DOI: 10.1145/2933575.2935304
arXiv: 1602.02670

Chatterjee, K., Ibsen-Jensen, R., &; Tkadlec, J. (2016). Robust draws in balanced knockout tournaments (Vol. 2016–January, pp. 172–179). Presented at the IJCAI: International Joint Conference on Artificial Intelligence, New York, NY, USA: AAAI Press.
LibreCat: https://research-explorer.ista.ac.at/record/1182

Hilbe, C., &; Traulsen, A. (2016). Only the combination of mathematics and agent based simulations can leverage the full potential of evolutionary modeling: Comment on “Evolutionary game theory using agent-based methods”https://doi.org/10.1016/j.plrev.2016.10.004__by C. Adami, J. Schossau and A. Hintze. Physics of Life Reviews. Elsevier.https://doi.org/10.1016/j.plrev.2016.10.004 
LibreCat: https://research-explorer.ista.ac.at/record/1200
DOI: 10.1016/j.plrev.2016.10.004

Pandey, V., &; Chatterjee, K. (2016). Game-theoretic models identify useful principles for peer collaboration in online learning platforms. In Proceedings of the ACM Conference on Computer Supported Cooperative Work (Vol. 26, pp. 365–368). San Francisco, CA, USA: ACM.https://doi.org/10.1145/2818052.2869122 
LibreCat: https://research-explorer.ista.ac.at/record/1245
DOI: 10.1145/2818052.2869122

Brázdil, T., Forejt, V., Kudera, A., &; Novotný, P. (2016). Stability in graphs and games (Vol. 59). Presented at the CONCUR: Concurrency Theory, Quebec City, Canada: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.CONCUR.2016.10 
LibreCat: https://research-explorer.ista.ac.at/record/1325
DOI: 10.4230/LIPIcs.CONCUR.2016.10

Chatterjee, K., &; Chmelik, M. (2016). Indefinite-horizon reachability in Goal-DEC-POMDPs. In Proceedings of the Twenty-Sixth International Conference on International Conference on Automated Planning and Scheduling (Vol. 2016–January, pp. 88–96). London, United Kingdom: AAAI Press.
LibreCat: https://research-explorer.ista.ac.at/record/1324

Brázdil, T., Chatterjee, K., Chmelik, M., Gupta, A., &; Novotný, P. (2016). Stochastic shortest path with energy constraints in POMDPs. In Proceedings of the 15th International Conference on Autonomous Agents and Multiagent Systems (pp. 1465–1466). Singapore: ACM.
LibreCat: https://research-explorer.ista.ac.at/record/1327

Brázdil, T., Kudera, A., &; Novotný, P. (2016). Optimizing the expected mean payoff in Energy Markov Decision Processes (Vol. 9938, pp. 32–49). Presented at the ATVA: Automated Technology for Verification and Analysis, Chiba, Japan: Springer.https://doi.org/10.1007/978-3-319-46520-3_3 
LibreCat: https://research-explorer.ista.ac.at/record/1326
DOI: 10.1007/978-3-319-46520-3_3

Milinski, M., Hilbe, C., Semmann, D., Sommerfeld, R., &; Marotzke, J. (2016). Humans choose representatives who enforce cooperation in social dilemmas through extortion. Nature Communications. Nature Publishing Group.https://doi.org/10.1038/ncomms10915 
LibreCat: https://research-explorer.ista.ac.at/record/1333
DOI: 10.1038/ncomms10915

Chatterjee, K., Henzinger, T. A., &; Otop, J. (2016). Quantitative monitor automata (Vol. 9837, pp. 23–38). Presented at the SAS: Static Analysis Symposium, Edinburgh, United Kingdom: Springer.https://doi.org/10.1007/978-3-662-53413-7_2 
LibreCat: https://research-explorer.ista.ac.at/record/1335
DOI: 10.1007/978-3-662-53413-7_2

Hansen, K., Ibsen-Jensen, R., &; Koucký, M. (2016). The big match in small space (Vol. 9928, pp. 64–76). Presented at the SAGT: Symposium on Algorithmic Game Theory, Liverpool, United Kingdom: Springer.https://doi.org/10.1007/978-3-662-53354-3_6 
LibreCat: https://research-explorer.ista.ac.at/record/1340
DOI: 10.1007/978-3-662-53354-3_6

Chonev, V. K., Ouaknine, J., &; Worrell, J. (2016). On the complexity of the orbit problem. Journal of the ACM. ACM.https://doi.org/10.1145/2857050 
LibreCat: https://research-explorer.ista.ac.at/record/1380
DOI: 10.1145/2857050