Brodal, G. S., Sioutas, S., Tsichlas, K. & Zaroliagis, C. (2010).
D2-tree: A new overlay with deterministic bounds. In O. Cheong , K-Y. Chwa & K. Park (Eds.),
Algorithms and Computation: 21st International Symposium, ISAAC 2010, Jeju, Korea, December 15-17, 2010, Proceedings, Part II (pp. 1-12). Springer VS.
https://doi.org/10.1007/978-3-642-17514-5_1
Bender, M. A.
, Brodal, G. S., Fagerberg, R., Ge, D., He, S., Hu, H., Iacono, J. & López-Ortiz, A. (2011).
The Cost of Cache-Oblivious Searching.
Algorithmica,
61(2), 463-505.
https://doi.org/10.1007/s00453-010-9394-0Moeslund, J. E., Arge, L. A., Bøcher, P. K., Nygaard, B. & Svenning, J-C. (2011).
Geographically Comprehensive Assessment of Salt-Meadow Vegetation-Elevation Relations Using LiDAR.
Wetlands,
31(3), 471-482.
https://doi.org/10.1007/s13157-011-0179-2
Afshani, P., Afrawal, M., Benjamin, D.
, Larsen, K. G., Mehlhorn, K. & Winzen, C. (2012).
The Query Complexity of Finding a Hidden Permutation.
Electronic Colloquium on Computational Complexity, (TR12-087).
http://eccc.hpi-web.de/report/2012/087/
Brodal, G. S., Davoodi, P., Lewenstein, M., Raman, R. & Rao, S. S. (2012).
Two Dimensional Range Minimum Queries and Fibonacci Lattices.
Lecture Notes in Computer Science,
7501, 217-228 .
https://doi.org/10.1007/978-3-642-33090-2_20
Chan, T. M., Durocher, S.
, Larsen, K. G., Morrison, J.
& Wilkinson, B. T. (2012).
Linear-Space Data Structures for Range Mode Query in Arrays.
Leibniz International Proceedings in Informatics,
14, 290-301.
https://doi.org/10.4230/LIPIcs.STACS.2012.290Afshani, P., Agarwal, P. K.
, Arge, L., Larsen, K. G. & Phillips, J. (2013).
(Approximate) Uncertain Skylines.
Theory of Computing Systems,
52(3), 342-366.
https://doi.org/10.1007/s00224-012-9382-7
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
Moeslund, J. E., Arge, L., Bøcher, P. K., Dalgaard, T., Ejrnæs, R., Odgaard, M. V. & Svenning, J-C. (2013).
Topographically controlled soil moisture drives plant diversity patterns within grasslands.
Biodiversity and Conservation,
22(10), 2151-2166.
https://doi.org/10.1007/s10531-013-0442-3
Moeslund, J. E., Arge, L., Bøcher, P. K., Dalgaard, T., Odgaard, M. V., Nygaard, B. & Svenning, J-C. (2013).
Topographically controlled soil moisture is the primary driver of local vegetation patterns across a lowland region.
Ecosphere (Washington, D.C.),
4(7), Article 91.
https://doi.org/10.1890/ES13-00134.1
Moeslund, J. E., Arge, L., Bøcher, P. K., Dalgaard, T. & Svenning, J-C. (2013).
Topography as a driver of local terrestrial vascular plant diversity patterns.
Nordic Journal of Botany,
31(2), 129-144.
https://doi.org/10.1111/j.1756-1051.2013.00082.x
Odgaard, M. V., Moeslund, J. E., Bøcher, P. K., Dalgaard, T. & Svenning, J-C. (2013).
The relative importance of geophysical constraints, amenity values, and farm-related factors in the dynamics of grassland set-aside.
Agriculture, Ecosystems & Environment,
164, 286-291.
https://doi.org/10.1016/j.agee.2012.09.009
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
Alamdari, S., Angelini, P., Chan, T. M., Di Battista, G., Frati, F., Lubiw, A., Patrignani, M., Roselli, V., Singla, S.
& Wilkinson, B. T. (2013).
Morphing Planar Graph Drawings with a Polynomial Number of Steps.
The Annual A C M - S I A M Symposium on Discrete Algorithms. Proceedings,
24, 1656-1667.
http://knowledgecenter.siam.org/0236-000137/0236-000137/1Brodal, G. S., Fagerberg, R.
, Mailund, T., Pedersen, C. N. S. & Sand, A. (2013).
Efficient Algorithms for Computing the Triplet and Quartet Distance Between Trees of Arbitrary Degree.
The Annual A C M - S I A M Symposium on Discrete Algorithms. Proceedings,
24, 1814-1832.
http://knowledgecenter.siam.org/0236-000098/0236-000098/1
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
