Brodal, G. S., Fagerberg, R., Östlin, A.
, Pedersen, C. N. S. & Rao, S. S. (2003).
Computing Refined Buneman Trees in Cubic Time. In G. Benson & R. Page (Eds.),
Algorithms in Bioinformatics: Third International Workshop, WABI 2003, Budapest, Hungary, September 15-20, 2003. Proceedings (pp. 259-270). Springer. Lecture Notes in Computer Science Vol. 2812
https://doi.org/10.1007/978-3-540-39763-2_20
Pouteau, R., Thuiller, W., Hobohm, C., Brunel, C., Conn, B. J., Dawson, W., de Sá Dechoum, M., Ebel, A. L., Essl, F., Fragman-Sapir, O., Fristoe, T., Jogan, N., Kreft, H., Lenzner, B., Meyer, C., Pergl, J., Pyšek, P., Verkhozina, A., Weigelt, P. ... van Kleunen, M. (2021).
Climate and socio-economic factors explain differences between observed and expected naturalization patterns of European plants around the world.
Global Ecology and Biogeography,
30(7), 1514-1531.
https://doi.org/10.1111/geb.13316
Brodal, G. S., Demaine, E. D., Fineman, J. T., Iacono, J., Langerman, S. & Munro, J. I. (2010).
Cache-Oblivious Dynamic Dictionaries with Optimal Update/Query Tradeoff.
Annual A C M - S I A M Symposium on Discrete Algorithms. Proceedings, 1448-1456.
http://www.siam.org/proceedings/soda/2010/SODA10_117_brodalg.pdf
Brodal, G. S., Fagerberg, R., Meyer, U. & Zeh, N. (2004).
Cache-Oblivious Data Structures and Algorithms for Undirected Breadth-First Search and Shortest Paths. In T. Hagerup & J. Katajainen (Eds.),
Algorithm Theory - SWAT 2004: 9th Scandinavian Workshop on Algorithm Theory, Humlebaek, Denmark, July 8-10, 2004. Proceedings (pp. 480-492). Springer. Lecture Notes in Computer Science Vol. 3111
https://doi.org/10.1007/978-3-540-27810-8_41
Brodal, G. S., Fagerberg, R.
& Moruz, G. (2005).
Cache-Aware and Cache-Oblivious Adaptive Sorting. In L. Caires, G. F. Italiano, L. Monteiro, C. Palamidessi & M. Yung (Eds.),
Automata, Languages and Programming: 32nd International Colloquium, ICALP 2005, Lisbon, Portugal, July 11-15, 2005. Proceedings (pp. 576-588). Springer. Lecture Notes in Computer Science Vol. 3580
https://doi.org/10.1007/11523468_47
Brodal, G. S. & Fagerberg, R. (2002).
Cache Oblivious Distribution Sweeping. In P. Widmayer, S. Eidenbenz, F. Triguero, R. Morales, R. Conejo & M. Hennessy (Eds.),
Automata, Languages and Programming: 29th International Colloquium, ICALP 2002 Málaga, Spain, July 8–13, 2002 Proceedings (pp. 426-438). Springer. Lecture Notes in Computer Science Vol. 2380
https://doi.org/10.1007/3-540-45465-9_37
Ejrnæs, R., Petersen, A. H.
, Bladt, J., Bruun, H. H.
, Moeslund, J. E., Wiberg-Larsen, P. & Rahbek, C. (2014).
Biodiversitetskort for Danmark: Udviklet i samarbejde mellem Center for Makroøkologi, Evolution og Klima på Københavns Universitet og Institut for Bioscience ved Aarhus Universitet. Aarhus Universitet, DCE - Nationalt Center for Miljø og Energi. Videnskabelig rapport fra DCE - Nationalt Center for Miljø og Energi No. 112
Sporbert, M., Bruelheide, H., Seidler, G., Keil, P., Jandt, U., Austrheim, G., Biurrun, I., Campos, J. A., Čarni, A., Chytrý, M., Csiky, J., De Bie, E., Dengler, J., Golub, V., Grytnes, J-A., Indreica, A., Jansen, F., Martin Jiroušek, M., Lenoir, J. ... Welk, E. (2019).
Assessing sampling coverage of species distribution in biodiversity databases.
Journal of Vegetation Science,
30(4), 620-632.
https://doi.org/10.1111/jvs.12763
Afshani, P., de Berg, M., Buchin, K., Gao, J., Loffler, M., Nayyeri, A., Raichel, B., Sarkar, R., Wang, H. & Wang, H-T. (2021).
Approximation Algorithms for Multi-Robot Patrol-Scheduling with Min-Max Latency. In S. M. LaValle, M. Lin, T. Ojala, D. Shell & J. Yu (Eds.),
Algorithmic Foundations of Robotics XIV-Part A: Proceedings of the Fourteenth Workshop on the Algorithmic Foundations of Robotics Springer. Springer Proceedings in Advanced Robotics
https://arxiv.org/abs/2005.02530
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
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
Arge, L., Brodal, G. S., Truelsen, J. & Tsirogiannis, C. (2013).
An optimal and practical cache-oblivious algorithm for computing multiresolution rasters. In
Algorithms – ESA 2013: 21st Annual European Symposium, Sophia Antipolis, France, September 2-4, 2013. Proceedings (pp. 61-72). Springer VS. Lecture Notes in Computer Science Vol. 8125
https://doi.org/10.1007/978-3-642-40450-4_6
Brodal, G. S., Fagerberg, R., Hammer, D., Meyer, U., Penschuck, M. & Tran, H. (2021).
An experimental study of external memory algorithms for connected components. In D. Coudert & E. Natale (Eds.),
19th International Symposium on Experimental Algorithms, SEA 2021 (pp. 23). [23] Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. Leibniz International Proceedings in Informatics, LIPIcs Vol. 190
https://doi.org/10.4230/LIPIcs.SEA.2021.23
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
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
Sand, A., Holt, M. K., Johansen, J., Fagerberg, R.
, Pedersen, C. N. S., Brodal, G. S. & Mailund, T. (2013).
Algorithms for Computing the Triplet and Quartet Distances for Binary and General Trees.
Biology,
2(4), 1189-1209.
https://doi.org/10.3390/biology2041189
Alexander, C., Moeslund, J. E., Bøcher, P. K., Arge, L. & Svenning, J-C. (2013).
Airborne laser scanner (LiDAR) proxies for understory light conditions.
Remote Sensing of Environment,
134, 152-161.
https://doi.org/10.1016/j.rse.2013.02.028
Sand, A., Pedersen, C. N. S., Mailund, T., Brodal, G. S. & Fagerberg, R. (2013).
A practical O(n log2 n) time algorithm for computing the triplet distance on binary trees.
B M C Bioinformatics,
14(Suppl 2), S18.
https://doi.org/10.1186/1471-2105-14-S2-S18