Publications

Contribution to journal

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, Article 2.3. https://doi.org/10.1145/3209685

Afshani, 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

Afshani, P. & Cheng, P. (2023). Lower Bounds for Semialgebraic Range Searching and Stabbing Problems. Journal of the ACM, 70(2), 1-26. Article 16. https://doi.org/10.1145/3578574

Afshani, P. & Tsakalidis, K. (2018). Optimal Deterministic Shallow Cuttings for 3-d Dominance Ranges. Algorithmica, 80(11), 3192-3206. https://doi.org/10.1007/s00453-017-0376-3

Afshani, P., Matulef, K. & Wilkinson, B. T. (2013). Property Testing on Linked Lists. Electronic Colloquium on Computational Complexity, TR13-187. http://www.informatik.uni-trier.de/~ley/db/journals/eccc/eccc20.html

Afshani, P. & Killmann, R. (2023). Rectangle stabbing and orthogonal range reporting lower bounds in moderate dimensions. Computational Geometry: Theory and Applications, 111, Article 101959. https://doi.org/10.1016/j.comgeo.2022.101959

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

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/

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

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

Alstrup, S., Brodal, G. S., Gørtz, I. L. & Rauhe, T. (2001). Time and Space Efficient Multi-Method Dispatching. Electronic Colloquium on Computational Complexity, (ITU-TR-2001-8).

Andersen, A. H., Clausen, K. K., Normand, S., Vikstrøm, T. & Moeslund, J. E. (2023). The influence of landscape characteristics on breeding bird dark diversity. Oecologia, 201(4), 1039-1052. https://doi.org/10.1007/s00442-023-05351-8

Arge, L. A., Brodal, G. S. & Satti, S. R. (2012). External Memory Planar Point Location with Logarithmic Updates. Algorithmica, 63(1-2), 457-475. https://doi.org/10.1007/s00453-011-9541-2

Arge, L., Brodal, G. S. & Toma, L. (2004). On External-Memory MST, SSP and Multi-Way Planar Graph Separation. Journal of Algorithms, 53(2), 186-206.

Assmann, J. J., Moeslund, J. E., Treier, U. A. & Normand, S. (2022). EcoDes-DK15: high-resolution ecological descriptors of vegetation and terrain derived from Denmark's national airborne laser scanning data set. Earth System Science Data, 14(2), 823-844. https://doi.org/10.5194/essd-14-823-2022

Axmanova, I., Kalusová, V., Danihelka, J., Dengler, J., Pergl, J., Pysek, P., Večeřa, M., Attorre, F., Biurrun, I., Boch, S., Conradi, T., Gavilán, R. G., Jimenez-Alfaro, B., Knollová, I., Kuzemko, A., Lenoir, J., Medvecká, J., Moeslund, J. E., Obratov-Petković, D. ... Chytrý, M. (2021). Neophyte invasions in European grasslands. Journal of Vegetation Science, 32(2), Article e12994. https://doi.org/10.1111/jvs.12994

Bender, M. A., Brodal, G. S., Fagerberg, R., Jacob, R. & Vicari, E. (2010). Optimal Sparse Matrix Dense Vector Multiplication in the I/O-Model. Theory of Computing Systems, 47(4), 934-962. https://doi.org/10.1007/s00224-010-9285-4

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-0

Berglin, E. & Brodal, G. S. (2020). A Simple Greedy Algorithm for Dynamic Graph Orientation. Algorithmica, 82(2), 245-259. https://doi.org/10.1007/s00453-018-0528-0

Böhm, M., Fazzone, A., Leonardi, S., Menghini, C. & Schwiegelshohn, C. (2021). Algorithms for fair k-clustering with multiple protected attributes. Operations Research Letters, 49(5), 787-789. https://doi.org/10.1016/j.orl.2021.08.011

Brodal, G. S., Georgiadis, L. & Katriel, I. (2008). An O(n log n) Version of the Averbakh-Berman Algorithm for the Robust Median of a Tree. Operations Research Letters, 36(1), 14 -18. https://doi.org/10.1016/j.orl.2007.02.012

Brodal, G. S., Träff, J. L. & Zaroliagis, C. D. (1998). A Parallel Priority Queue with Constant Time Operations. Journal of Parallel and Distributed Computing, 49(1), 4-21. https://doi.org/10.1006/jpdc.1998.1425

Brodal, G. S., Fagerberg, R. & Jacob, R. (2001). Cache Oblivious Search Trees via Binary Trees of Small Height. B R I C S Report Series, (RS-01-36), 1-20.

Brodal, G. S. & Pinotti, M. C. (2001). Comparator Networks for Binary Heap Construction. Theoretical Computer Science, 250(1-2), 235-245. https://doi.org/10.1016/S0304-3975(99)00137-1

Brodal, G. S., Fagerberg, R. & Pedersen, C. N. S. (2003). Computing the Quartet Distance Between Evolutionary Trees in Time O(n log n). Algorithmica, 38(2), 377-395. https://doi.org/10.1007/s00453-003-1065-y

Brodal, G. S., Sioutas, S., Pantazos, K. & Zaroliagis, C. D. (2015). D2-tree: A new overlay with deterministic bounds. Algorithmica, 72(3), 860-883. https://doi.org/10.1007/s00453-014-9878-4

Brodal, G. S., Fagerberg, R. & Vinther, K. (2007). Engineering a Cache-Oblivious Sorting Algorithm. Journal of Experimental Algorithmics, 12. https://doi.org/10.1145/1227161.1227164

Brodal, G. S., Demaine, E. D. & Munro, J. I. (2005). Fast Allocation and Deallocation with an Improved Buddy System. Acta Informatica, 41(4-5), 273-291. https://doi.org/10.1007/s00236-004-0159-6

Brodal, G. S., Kaligosi, K., Katriel, I. & Kutz, M. (2005). Faster Algorithms for Computing Longest Common Increasing Subsequences. B R I C S Report Series, (RS-05-37).

Brodal, G. S., Sioutas, S., Tsakalidis, K. & Tsichlas, K. (2020). Fully persistent B-trees. Theoretical Computer Science, 841, 10-26. https://doi.org/10.1016/j.tcs.2020.06.027

Brodal, G. S. & Srinivasan, V. (2000). Improved Bounds for Dictionary Look-up with One Error. Information Processing Letters, 75(1-2), 57-59. https://doi.org/10.1016/S0020-0190(00)00079-X

Brodal, G. S., Greve, M., Pandy, V. & Satti, S. R. (2014). Integer representations towards efficient counting in the bit probe model. Journal of Discrete Algorithms, 26(May), 34–44. https://doi.org/10.1016/j.jda.2013.11.001

Brodal, G. S., Moruz, G. & Negoescu, A. (2015). OnlineMin: A Fast Strongly Competitive Randomized Paging Algorithm. Theory of Computing Systems, 56 (1). https://doi.org/10.1007/s00224-012-9427-y

Brodal, G. S., Davoodi, P. & Rao, S. S. (2012). On Space Efficient Two Dimensional Range Minimum Data Structures. Algorithmica, 63(4), 815-830. https://doi.org/10.1007/s00453-011-9499-0

Brodal, G. S., Fagerberg, R. & Moruz, G. (2004). On the Adaptiveness of Quicksort. B R I C S Report Series, (RS-04-27).

Brodal, G. S., Fagerberg, R. & Moruz, G. (2008). On the Adaptiveness of Quicksort. Journal of Experimental Algorithmics, 12. https://doi.org/10.1145/1227161.1402294

Brodal, G. S., Lagogiannis, G., Makris, C., Tsakalidis, A. & Tsichlas, K. (2003). Optimal Finger Search Trees in the Pointer Machine. Journal of Computer and System Sciences, 67(2), 381-418. https://doi.org/10.1016/S0022-0000(03)00013-8

Brodal, G. S., Makris, C., Sioutas, S., Tsakalidis, A. K. & Tsichlas, K. (2002). Optimal Solutions for the Temporal Precedence Problem. Algorithmica, 33(4), 494-510. https://doi.org/10.1007/s00453-002-0935-z

Brodal, G. S. (1999). Priority queues on parallel machines. Parallel Computing, 25(8), 987-1011. https://doi.org/10.1016/S0167-8191(99)00032-0

Brodal, G. S. & Jacob, R. (2001). Time-dependent Networks as Models to Achieve Fast Exact Time-table Queries. Electronic Colloquium on Computational Complexity, 92(ALCOMFT-TR-01-176).

Brodal, G. S., Gfeller, B., Jørgensen, A. G. & Sanders, P. (2011). Towards optimal range medians. Theoretical Computer Science, 412(24), 2588-2601. https://doi.org/10.1016/j.tcs.2010.05.003

Brody, J. E. & Larsen, K. G. (2015). Adapt or Die: Polynomial Lower Bounds for Non-Adaptive Dynamic Data Structures. Theory of Computing, 11(19), 471-489. https://doi.org/10.4086/toc.2015.v011a019

Bruelheide, H., Dengler, J., Jiménez-Alfaro, B., Purschke, O., Hennekens, S. M., Chytrý, M., Pillar, V. D., Jansen, F., Kattge, J., Sandel, B., Aubin, I., Biurrun, I., Field, R., Haider, S., Jandt, U., Lenoir, J., Peet, R. K., Peyre, G., Sabatini, F. M. ... Zverev, A. (2019). sPlot – A new tool for global vegetation analyses. Journal of Vegetation Science, 30(2), 161-186. https://doi.org/10.1111/jvs.12710