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.
https://doi.org/10.1007/978-3-540-39763-2_20
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.
https://doi.org/10.1007/3-540-45465-9_37
Brodal, G. S., Fagerberg, R., Bose, P. (Ed.) & Morin, P. (Ed.) (2002).
Funnel Heap - A Cache Oblivious Priority Queue. In P. Bose & P. Morin (Eds.),
Algorithms and Computation: 13th International Symposium, ISAAC 2002 Vancouver, BC, Canada, November 21–23, 2002 Proceedings (pp. 219-228). Springer.
https://doi.org/10.1007/3-540-36136-7_20
Brodal, G. S., Lyngsø, R. B., Östlin, A.
& Pedersen, C. N. S. (2002).
Solving the String Statistics Problem in Time O(n log n). 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. 728-739). Springer.
https://doi.org/10.1007/3-540-45465-9_62
Brodal, G. S., Fagerberg, R.
, Pedersen, C. N. S., Eades, P. (Ed.) & Takaoka, T. (Ed.) (2001).
Computing the Quartet Distance Between Evolutionary Trees in Time O(n log² n). In
Proceedings of Algorithms and Computation : 12th International Symposium, ISAAC 2001 (2223 of Lecture Notes in Computer Science ed., Vol. 2223/2001, pp. 731-742). Springer.
Brodal, G. S., Fagerberg, R.
, Pedersen, C. N. S., Östlin, A., Orejas, F. (Ed.), Spirakis, P. G. (Ed.) & Leeuwen, J. V. (Ed.) (2001).
The Complexity of Constructing Evolutionary Trees Using Experiments. In
Lecture Notes In Computer Science; Vol. 2076: Proceedings of the 28th International Colloquium on Automata, Languages and Programming (2076 of Lecture Notes in Computer Science ed., Vol. 2076/2001, pp. 140-151). Springer.
Alstrup, S.
, Brodal, G. S. & Rauhe, T. (2000).
Pattern matching in dynamic texts. In D. Shmoys (Ed.),
Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms (pp. 819-828). Society for Industrial and Applied Mathematics.
Brodal, G. S., Lyngsø, R. B., Pedersen, C. N. S. & Stoye, J. (1999).
Finding Maximal Pairs with Bounded Gap. In M. Crochemore & M. Paterson (Eds.),
Combinatorial Pattern Matching: 10th Annual Symposium, CPM 99 Warwick University, UK, July 22–24, 1999 Proceedings (pp. 134-149). Springer.
https://doi.org/10.1007/3-540-48452-3_11
Afshani, P., Agrawal, M., Benjamin, D., Doerr, C.
, Larsen, K. G. & Mehlhorn, K. (2013).
The Query Complexity of Finding a Hidden Permutation. In A. Brodnik, A. López-Ortiz, V. Raman & A. Viola (Eds.),
Space-Efficient Data Structures, Streams, and Algorithms: Papers in Honor of J. Ian Munro on the Occasion of His 66th Birthday (pp. 1-11). Springer VS.
https://doi.org/10.1007/978-3-642-40273-9_1
Bender, M. A.
, Brodal, G. S., Fagerberg, R., Ge, D., He, S., Hu, H., Iacono, J. & López-Ortiz, A. (2003).
The Cost of Cache-Oblivious Searching. In
Proc. 44th Annual IEEE Symposium on Foundations of Computer Science (FOCS): IEEE Computer Society Press, Washington D.C. (Vol. Session 6, pp. 271-282). IEEE Computer Society Press.
Alstrup, S.
, Brodal, G. S., Gørtz, I. L. & Rauhe, T. (2002).
Time and Space Efficient Multi-Method Dispatching. In M. Penttonen & E. M. Schmidt (Eds.),
Algorithm Theory — SWAT 2002: 8th Scandinavian Workshop on Algorithm Theory Turku, Finland, July 3–5, 2002 Proceedings (pp. 20-29). Springer.
https://doi.org/10.1007/3-540-45471-3_3Brodal, G. S., Fagerberg, R.
, Pedersen, C. N. S. & Östlin, A. (2001).
The Complexity of Constructing Evolutionary Trees Using Experiments. In F. Orejas, P. G. Spirakis & J. van Leeuwen (Eds.),
Automata, Languages and Programming: 28th International Colloquium, ICALP 2001 Crete, Greece, July 8–12, 2001 Proceedings (pp. 140-151). Springer.
https://doi.org/10.1007/3-540-48224-5_12
Johannsen, V. K., Rojas, S. K.
, Brunbjerg, A. K., Schumacher, J.
, Bladt, J., Bladt, J., Nyed, P.
, Moeslund, J. E., Nord-Larsen, T.
& Ejrnæs, R. (2015).
Udvikling af et High Nature Value - HNV-skovkort for Danmark: IGN Rapport November 2015, Institut for Geovidenskab og Naturforvaltning, Københavns Universitet, Frederiksberg.
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 University, DCE - Danish Centre for Environment and Energy. Videnskabelig rapport fra DCE - Nationalt Center for Miljø og Energi No. 112
Burkhardt, J., Caragiannis, I., Fehrs, K., Russo, M.
, Schwiegelshohn, C. & Shyam, S. (2024).
Low-Distortion Clustering with Ordinal and Limited Cardinal Information.
Proceedings of the AAAI Conference on Artificial Intelligence,
38(9), 9555-9563.
https://doi.org/10.1609/aaai.v38i9.28811
