Bosanský, B., Brânzei, S.
, Hansen, K. A., Lund, T. B.
& Miltersen, P. B. (2017).
Computation of Stackelberg Equilibria of Finite Sequential Games.
A C M Transactions on Economics and Computation,
5(4), 23:1-23:24. Article 23.
https://doi.org/10.1145/3133242
Damgård, I., Damgård, K., Nielsen, K., Nordholt, P. S. & Toft, T. (2017).
Confidential benchmarking based on multiparty computation. In J. Grossklags & B. Preneel (Eds.),
Financial Cryptography and Data Security - 20th International Conference, FC 2016, Revised Selected Papers (Vol. 9603 LNCS, pp. 169-187). Springer VS.
https://doi.org/10.1007/978-3-662-54970-4_10
Afshani, P., Bender, M. A., Farach-Colton, M., Fineman, J. T., Goswami, M. & Tsai, M. T. (2017).
Cross-Referenced dictionaries and the limits of write optimization. In P. N. Klein (Ed.),
28th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017 (pp. 1523-1532). Association for Computing Machinery.
Georgiadis, L., Hansen, T. D., Italiano, G. F., Krinninger, S. & Parotsidis, N. (2017).
Decremental Data Structures for Connectivity and Dominators in Directed Graphs. In I. Chatzigiannakis, P. Indyk, F. Kuhn & A. Muscholl (Eds.),
44th International Colloquium on Automata, Languages, and Programming (ICALP 2017) (Vol. 80, pp. 42:1-42:15). Article 42 Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH.
https://doi.org/10.4230/LIPIcs.ICALP.2017.42
Blunck, H., Prentow, T. S., Temme, S., Thom, A. & Vahrenhold, J. (2017).
Deviation maps for robust and informed indoor positioning services.
SIGSPATIAL Special,
9(1), 27-34.
https://doi.org/10.1145/3124104.3124110
Lindahl, C.
, Wagner, S. R., Bertelsen, O. W., Schlütter, J. M., Uldbjerg, N. & Sandager, P. (2017).
Effects of context-aware patient guidance on blood pressure selfmeasurement adherence levels.
Health Informatics Journal,
25(2), 417-428.
https://doi.org/10.1177/1460458217717073
De Cock . M., Dowsley, R., Horst, C., Katti, R., Nascimento, A. C. A., Poon , W.-S. & Truex, S. (2017).
Efficient Privacy-Preserving Scoring of Decision Trees, SVM and Logistic Regression Models.
https://sites.google.com/view/psml/program
Biniaz, A., Bose, P., van Duijn, I., Maheshwari, A. & Smid, M. (2017).
Faster algorithms for the minimum red-blue-purple spanning graph problem.
Journal of Graph Algorithms and Applications,
21(4), 527-546.
https://doi.org/10.7155/jgaa.00427
Alamdari, S., Angelini, P., Barrera-Cruz, F., Chan, T. M., Da Lozzo, G., Di Battista, G., Frati, F., Haxell, P., Lubiw, A., Patrignani, M., Roselli, V., Singla, S.
& Wilkinson, B. T. (2017).
How to Morph Planar Graph Drawings.
S I A M Journal on Computing,
46(2), 824-852.
https://doi.org/10.1137/16M1069171
Bringmann, K., Hansen, T. D. & Krinninger, S. (2017).
Improved Algorithms for Computing the Cycle of Minimum Cost-to-Time Ratio in Directed Graphs. In I. Chatzigiannakis, P. Indyk, F. Kuhn & A. Muscholl (Eds.),
44th International Colloquium on Automata, Languages, and Programming (ICALP 2017) (Vol. 80, pp. 124:1-124:16). Article 124 Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH.
https://doi.org/10.4230/LIPIcs.ICALP.2017.124
Kristensen, E. K.
& Møller, A. (2017).
Inference and Evolution of TypeScript Declaration Files. In M. Huisman & J. Rubin (Eds.),
Fundamental Approaches to Software Engineering - 20th International Conference, FASE 2017 Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2017, Proceedings: 20th International Conference, FASE 2017, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2017, Uppsala, Sweden, April 22-29, 2017, Proceedings (Vol. 10202, pp. 99-115). Springer VS.
https://doi.org/10.1007/978-3-662-54494-5_6