Bladt, J., Brunbjerg, A. K., Moeslund, J. E., Petersen, A. H.
& Ejrnæs, R., (2016).
Appendix 6: Opdatering af biodiversitetskortet for Danmark 2015, 10 p., Notat fra DCE - Nationalt Center for Miljø og Energi
Brunbjerg, A. K., Bladt, J., Brink, M.
, Fredshavn, J. R., Mikkelsen, P., Moeslund, J. E., Nygaard, B., Skov, F. & Ejrnæs, R. (2016).
Development and implementation of a High Nature Value (HNV) farming indicator for Denmark.
Ecological Indicators,
61(2), 274-281.
https://doi.org/10.1016/j.ecolind.2015.09.027
Stølting Brodal, G., Davoodi, P., Lewenstein, M., Raman, R.
& Satti, S. R. (2016).
Two dimensional range minimum queries and Fibonacci lattices.
Theoretical Computer Science,
638, 33-43.
https://doi.org/10.1016/j.tcs.2016.02.016
Yon, J., Won, S. B., Cheng, S. W., Cheong, O.
& Wilkinson, B. T. (2016).
Approximating convex shapes with respect to symmetric difference under homotheties. In S. Fekete & A. Lubiw (Eds.),
32nd International Symposium on Computational Geometry, SoCG 2016 (Vol. 51, pp. 63.1-63.15). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. Leibniz International Proceedings in Informatics Vol. 51
https://doi.org/10.4230/LIPIcs.SoCG.2016.63
Afshani, P., De Berg, M., Casanova, H., Karsin, B., Lambrechts, C.
, Sitchinava, N. & Tsirogiannis, C. (2017).
An efficient algorithm for the 1D total visibility-index problem. In S. Fekete & V. Ramachandran (Eds.),
2017 Proceedings of the Ninteenth Workshop on Algorithm Engineering and Experiments (ALENEX) (Vol. PRAL17, pp. 218-231). Society for Industrial and Applied Mathematics.
https://doi.org/10.1137/1.9781611974768.18
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.
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
Brunbjerg, A. K., Bruun, H. H.
, Moeslund, J. E., Sadler, J. P.
, Svenning, J-C. & Ejrnæs, R. (2017).
Ecospace: a unified framework for understanding variation in terrestrial biodiversity.
Basic and Applied Ecology,
18, 86-94.
https://doi.org/10.1016/j.baae.2016.09.002
Moeslund, J. E., Brunbjerg, A. K., Clausen, K., Dalby, L., Fløjgaard, C., Juel, A. & Lenoir, J. (2017).
Using dark diversity and plant characteristics to guide conservation and restoration.
Journal of Applied Ecology,
54(6), 1730-1741.
https://doi.org/10.1111/1365-2664.12867
Peterka, T., Hájek, M., Jiroušek, M., Jiménez-Alfaro, B., Aunina, L., Bergamini, A., Dítě, D., Felbaba-Klushyna, L., Graf, U., Hájková, P., Hettenbergerová, E., Ivchenko, T. G., Jansen, F., Koroleva, N. E., Lapshina, E. D., Lazarević, P. M., Moen, A., Napreenko, M. G., Pawlikowski, P. ... Chytrý, M. (2017).
Formalized classification of European fen vegetation at the alliance level.
Applied Vegetation Science,
20(1), 124-142.
https://doi.org/10.1111/avsc.12271
Afshani, P., De Berg, M., Casanova, H., Karsin, B., Lambrechts, C.
, Sitchinava, N. & Tsirogiannis, C. (2018).
An efficient algorithm for the 1D total visibility-index problem and its parallelization.
ACM Journal of Experimental Algorithmics,
23, [2.3].
https://doi.org/10.1145/3209685
Dalsgaard, P., Pedersen, B. P., Dimke, H., Møller, N. M.
, Normand, S., Bjørk, R., Bille, M.
& Larsen, K. G. (2018).
Opholdskrav i skatteaftale hæmmer dansk forskning.
Politiken, (Sektion 2 (Kultur)), 7.
Tsourakakis, C. E., Mitzenmacher, M.
, Larsen, K. G., Blasiok, J., Lawson, B., Nakkiran, P. & Nakos, V. (2018).
Predicting Positive and Negative Links with Noisy Queries: Theory Practice. arXiv.org.
http://arxiv.org/abs/1709.07308
Afshani, P., Fagerberg, R., Hammer, D., Jacob, R., Kostitsyna, I., Meyer, U., Penschuck, M.
& Sitchinava, N. (2019).
Fragile complexity of comparison-based algorithms. In M. A. Bender, O. Svensson & G. Herman (Eds.),
27th Annual European Symposium on Algorithms, ESA 2019 [2] Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. Leibniz International Proceedings in Informatics, LIPIcs Vol. 144
https://doi.org/10.4230/LIPIcs.ESA.2019.2
Afshani, P., Agrawal, M., Doerr, B., Doerr, C.
, Larsen, K. G. & Mehlhorn, K. (2019).
The query complexity of a permutation-based variant of Mastermind.
Discrete Applied Mathematics,
260, 28-50.
https://doi.org/10.1016/j.dam.2019.01.007