Publications

Afshani, P., de Berg, M., Buchin, K., Gao, J., Löffler, M., Nayyeri, A., Raichel, B., Sarkar, R., Wang, H. & Yang, H. T. (2022). On Cyclic Solutions to the Min-Max Latency Multi-Robot Patrolling Problem. In X. Goaoc & M. Kerber (Eds.), 38th International Symposium on Computational Geometry, SoCG 2022 [2] Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. Leibniz International Proceedings in Informatics, LIPIcs Vol. 224 https://doi.org/10.4230/LIPIcs.SoCG.2022.2

Afshani, P. & Cheng, P. (2022). On Semialgebraic Range Reporting. In X. Goaoc & M. Kerber (Eds.), 38th International Symposium on Computational Geometry, SoCG 2022 [3] Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. Leibniz International Proceedings in Informatics, LIPIcs Vol. 224 https://doi.org/10.4230/LIPIcs.SoCG.2022.3

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

Bartal, Y., Fandina, O. N. & Neiman, O. (2022). Covering metric spaces by few trees. Journal of Computer and System Sciences, 130, 26-42. https://doi.org/10.1016/j.jcss.2022.06.001

Bartal, Y., Fandina, O. N. & Larsen, K. G. (2022). Optimality of the Johnson-Lindenstrauss Dimensionality Reduction for Practical Measures. In X. Goaoc & M. Kerber (Eds.), 38th International Symposium on Computational Geometry, SoCG 2022 [13] Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. Leibniz International Proceedings in Informatics, LIPIcs Vol. 224 https://doi.org/10.4230/LIPIcs.SoCG.2022.13

Brodal, G. S. (2022). Priority Queues with Decreasing Keys. In P. Fraigniaud & Y. Uno (Eds.), 11th International Conference on Fun with Algorithms, FUN 2022 (pp. 8:1-8:19). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. Leibniz International Proceedings in Informatics, LIPIcs Vol. 226 https://doi.org/10.4230/LIPIcs.FUN.2022.8

Cohen-Addad, V., Epasto, A., Lattanzi, S., Mirrokni, V., Munoz Medina, A., Saulpic, D., Schwiegelshohn, C. & Vassilvitskii, S. (2022). Scalable Differentially Private Clustering via Hierarchically Separated Trees. In KDD 2022 - Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining (pp. 221-230). Association for Computing Machinery, Inc. Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining https://doi.org/10.1145/3534678.3539409

Cohen-Addad, V., Larsen, K. G., Saulpic, D. & Schwiegelshohn, C. (2022). Towards optimal lower bounds for k-median and k-means coresets. In S. Leonardi & A. Gupta (Eds.), STOC 2022 - Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing (pp. 1038-1051). Association for Computing Machinery. https://doi.org/10.1145/3519935.3519946

Fleischhacker, N., Larsen, K. G. & Simkin, M. (2022). Property-Preserving Hash Functions for Hamming Distance from Standard Assumptions. In O. Dunkelman & S. Dziembowski (Eds.), Advances in Cryptology – EUROCRYPT 2022: 41st Annual International Conference on the Theory and Applications of Cryptographic Techniques, 2022, Proceedings (pp. 764-781). Springer. Lecture Notes in Computer Science (LNCS) Vol. 13276 https://doi.org/10.1007/978-3-031-07085-3_26

Afshani, P. (2021). A Lower Bound for Dynamic Fractional Cascading. In SODA '21: Proceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 2229-2248). Association for Computing Machinery. https://doi.org/10.5555/3458064.3458197

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

Afshani, P. & Cheng, P. (2021). Lower bounds for semialgebraic range searching and stabbing problems. In K. Buchin & E. C. de Verdiere (Eds.), 37th International Symposium on Computational Geometry, SoCG 2021 [8] Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. Leibniz International Proceedings in Informatics, LIPIcs Vol. 189 https://doi.org/10.4230/LIPIcs.SoCG.2021.8

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), [e12994]. https://doi.org/10.1111/jvs.12994

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

Bury, M., Gentili, M., Schwiegelshohn, C. & Sorella, M. (2021). Polynomial Time Approximation Schemes for All 1-Center Problems on Metric Rational Set Similarities. Algorithmica, 83(5), 1371-1392. https://doi.org/10.1007/s00453-020-00787-3

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

Cohen-Addad, V., Saulpic, D. & Schwiegelshohn, C. (2021). A new coreset framework for clustering. In S. Khuller & V. V. Williams (Eds.), STOC 2021 - Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing (pp. 169-182). Association for Computing Machinery. Proceedings of the Annual ACM Symposium on Theory of Computing https://doi.org/10.1145/3406325.3451022

Damgård, I. B., Larsen, K. G. & Yakoubov, S. (2021). Broadcast secret-sharing, bounds and applications. In S. Tessaro (Ed.), 2nd Conference on Information-Theoretic Cryptography, ITC 2021 [10] Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. Leibniz International Proceedings in Informatics, LIPIcs Vol. 199 https://doi.org/10.4230/LIPIcs.ITC.2021.10

Ejrnæs, R., Bladt, J., Moeslund, J. E. & Brunbjerg, A. K. (2021). Biodiversitetskortets bioscore. Aarhus Universitet, DCE - Nationalt Center for Miljø og Energi. Videnskabelig rapport fra DCE - Nationalt Center for Miljø og Energi No. 456

Ejrnæs, R., Nygaard, B., Kjær, C., Baattrup-Pedersen, A., Brunbjerg, A. K., Clausen, K. K., Fløjgaard, C., Hansen, J. L. S., D.D. Hansen, M., Holm, T. E., Johnsen, T. J., Johansson, L. S., Moeslund, J. E., Sterup, J., Hansen, R. R., Strandberg, B., Søndergaard, M. & Wiberg-Larsen, P. (2021). Danmarks biodiversitet 2020. DCE - Nationalt Center for Miljø og Energi. Videnskabelig rapport fra DCE - Nationalt Center for Miljø og Energi No. 465 https://dce2.au.dk/pub/SR465.pdf

Haxen, M., Raeburn, M., Afshani, P. & Karras, P. (2021). Centerpoint Query Authentication. In Proceedings of the 30th ACM International Conference on Information & Knowledge Management (CIKM '21) (pp. 3083-3087). Association for Computing Machinery. https://doi.org/10.1145/3459637.3482072

Hájek, M., Jimenez-Alfaro, B., Hájek, O., Brancaleoni, L., Cantonati, M., Carbognani, M., Dedić, A., Dítě, D., Gerdol, R., Hájková, P., Horsáková, V., Jansen, F., Kamberović, J., Kapfer, J., Kolari, T. H. M., Lamentowicz, M., Lazarević, P. M., Mašić, E., Moeslund, J. E. ... Biţă-Nicolae, C. (2021). A European map of groundwater pH and calcium. Earth System Science Data, 13, 1089-1105. https://doi.org/10.5194/essd-13-1089-2021

Jafargholi, Z., Larsen, K. G. & Simkin, M. (2021). Optimal oblivious priority queues. In D. Marx (Ed.), ACM-SIAM Symposium on Discrete Algorithms, SODA 2021 (pp. 2366-2383). Association for Computing Machinery. Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Kejlberg-Rasmussen, C., Tao, Y., Tsakalidis, K., Tsichlas, K. & Yoon, J. (2021). I/O-efficient 2-d orthogonal range skyline and attrition priority queues. Computational Geometry: Theory and Applications, 93, [101689]. https://doi.org/10.1016/j.comgeo.2020.101689

Larsen, K. G., Pagh, R. & Tetek, J. (2021). CountSketches, Feature Hashing and the Median of Three. In M. Meila & T. Zhang (Eds.), Proceedings of the 38th International Conference on Machine Learning, ICML 2021, 18-24 July 2021, Virtual Event (pp. 6011-6020). Proceedings of Machine Learning Research Vol. 139 http://proceedings.mlr.press/v139/larsen21a.html

Larsen, K. G., Starup, J. L. & Steensgaard, J. (2021). Further Unifying the Landscape of Cell Probe Lower Bounds. Paper presented at Happening virtually , -. https://cs.au.dk/~larsen/papers/FurtherUnifying.pdf

Moeslund, J. E., (2021). Kortlægning af beskyttede dagsommerfugle ved Natura 2000-område: Bygholm Ådal, 5 p., Fagligt notat fra DCE – Nationalt Center for Miljø og Energi Vol. 2021 No. 22 https://dce.au.dk/fileadmin/dce.au.dk/Udgivelser/Notater_2021/N2021_22.pdf

Moeslund, J. E., (2021). Oversigter over forekomsten af rødlistede arter, 212 p., Fagligt notat fra DCE – Nationalt Center for Miljø og Energi Vol. 2021 No. 24 https://dce.au.dk/fileadmin/dce.au.dk/Udgivelser/Notater_2021/N2021_24.pdf

Moeslund, J. E., Nygaard, B., Normand, S. & Madsen, B. (2021). Udredning af alternative datakilder i NOVANA-programmets naturtypeovervågning. Aarhus Universitet, DCE - Nationalt Center for Miljø og Energi. Videnskabelig rapport fra DCE - Nationalt Center for Miljø og Energi No. 458 https://dce2.au.dk/pub/SR458.pdf

Nygaard, B., Moeslund, J. E., Ejrnæs, R., Mielec, C. L., Carl, H., Clausen, K. K., Dylmer, E., Elmeros, M., Flensted, K. N., Fog, K., Goldberg, I., Hansen, M. D. D., Helsing, F., Jørum, P., Lissner, J., Læssøe, T., Bang Madsen, H., Misser, J., Olsen, K. ... Wind, P. (2021). De vigtigste levesteder for rødlistede arter i Danmark. DCE - Nationalt Center for Miljø og Energi. Videnskabelig rapport fra DCE - Nationalt Center for Miljø og Energi No. 470 https://dce2.au.dk/pub/SR470.pdf

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

Pouteau, R., Biurrun, I., Brunel, C., Chytrý, M., Dawson, W., Essl, F., Fristoe, T., Haveman, R., Hobohm, C., Jansen, F., Kreft, H., Lenoir, J., Lenzner, B., Meyer, C., Moeslund, J. E., Pergl, J., Pyšek, P., Svenning, J. C., Thuiller, W. ... van Kleunen, M. (2021). Potential alien ranges of European plants will shrink in the future, but less so for already naturalized than for not yet naturalized species. Diversity and Distributions, 27(11), 2063-2076. https://doi.org/10.1111/ddi.13378

Sabatini, F. M., Lenoir, J., Hattab, T., Arnst, E. A., Chytrý, M., Dengler, J., De Ruffray, P., Hennekens, S. M., Jandt, U., Jansen, F., Jiménez-Alfaro, B., Kattge, J., Levesley, A., Pillar, V. D., Purschke, O., Sandel, B., Sultana, F., Aavik, T., Aćić, S. ... Bruelheide, H. (2021). sPlotOpen – An environmentally balanced, open-access, global dataset of vegetation plots. Global Ecology and Biogeography, 30(9), 1740-1764. https://doi.org/10.1111/geb.13346

Sporbert, M., Welk, E., Seidler, G., Jandt, U., Acic, S., Biurrun, I., Campos, J. A., Čarni, A., Cerabolini, B. E. L., Chytrý, M., Ćušterevska, R., Dengler, J., De Sanctis, M., Dziuba, T., Fagúndez, J., Field, R., Golub, V., He, T., Jansen, F. ... Bruelheide, H. (2021). Different sets of traits explain abundance and distribution patterns of European plants at different spatial scales. Journal of Vegetation Science, 32(2), [e13016]. https://doi.org/10.1111/jvs.13016

Valdez, J., Brunbjerg, A. K., Fløjgaard, C., Dalby, L., Clausen, K. K., Pärtel, M., Pfeifer, N., Hollaus, M., Wimmer, M. H., Ejrnæs, R. & Moeslund, J. E. (2021). Relationships between macro-fungal dark diversity and habitat parameters using LiDAR. Fungal Ecology, 51, [101054]. https://doi.org/10.1016/j.funeco.2021.101054

Večeřa, M., Axmanova, I., Padullés Cubino, J., Lososová, Z., Divíšek, J., Knollová, I., Aćić, S., Biurrun, I., Boch, S., Bonari, G., Antonio Campos, J., Čarni, A., Carranza, M. L., Casella, L., Chiarucci, A., Ćušterevska, R., Pauline, D., Dengler, J., Fernandez-Gonzalez, F. ... Chytrý, M. (2021). Mapping species richness of plant families in European vegetation. Journal of Vegetation Science, 32(3), [e13035]. https://doi.org/10.1111/jvs.13035

Afshani, P. & Cheng, P. (2020). 2D generalization of fractional cascading on axis-aligned planar subdivisions. In Proceedings - 2020 IEEE 61st Annual Symposium on Foundations of Computer Science, FOCS 2020 (pp. 716-727). [9317953] IEEE. Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS Vol. 2020-November https://doi.org/10.1109/FOCS46700.2020.00072

Afshani, P., van Duijn, I., Killmann, R. & Nielsen, J. S. (2020). A lower bound for jumbled indexing. In S. Chawla (Ed.), Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms (pp. 592-606). Association for Computing Machinery. https://doi.org/10.1137/1.9781611975994.36

Anagnostopoulos, A., Becchetti, L., Fazzone, A., Menghini, C. & Schwiegelshohn, C. (2020). Spectral Relaxations and Fair Densest Subgraphs. In CIKM 2020 - Proceedings of the 29th ACM International Conference on Information and Knowledge Management (pp. 35–44). Conference on Information and Knowledge Management https://doi.org/10.1145/3340531.3412036

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

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

Brunbjerg, A. K., Bruun, H. H., Dalby, L., Classen, A. T., Fløjgaard, C., Frøslev, T. G., Hansen, O. L. P., Høye, T. T., Moeslund, J. E., Svenning, J-C. & Ejrnæs, R. (2020). Multi-taxon inventory reveals highly consistent biodiversity responses to ecospace variation. Oikos, 129(9), 1381-1392. https://doi.org/10.1111/oik.07145

Bury, M., Schwiegelshohn, C. & Sorella, M. (2020). Similarity Search for Dynamic Data Streams. IEEE Transactions on Knowledge and Data Engineering, 32(11), 2241-2253. https://doi.org/10.1109/TKDE.2019.2916858

Damgaard, C., Moeslund, J. E. & Wind, P. (2020). Changes in the abundance of Danish orchids over the past 30 years. Diversity, 12(6), [244]. https://doi.org/10.3390/d12060244

Fløjgaard, C., Valdez, J. W., Dalby, L., Moeslund, J. E., Clausen, K. K., Ejrnæs, R., Pärtel, M. & Brunbjerg, A. K. (2020). Dark diversity reveals importance of biotic resources and competition for plant diversity across habitats. Ecology and Evolution, 10(12), 6078-6088. https://doi.org/10.1101/685040, https://doi.org/10.1002/ece3.6351

Freksen, C. B. & Larsen, K. G. (2020). On Using Toeplitz and Circulant Matrices for Johnson–Lindenstrauss Transforms. Algorithmica, 82(2), 338-354. https://doi.org/10.1007/s00453-019-00644-y

Green Larsen, K., Mitzenmacher, M. & Tsourakakis, C. (2020). Clustering with a faulty oracle. In Y. Huang, I. King, T-Y. Liu & M. van Steen (Eds.), WWW '20: Proceedings of The Web Conference 2020 (pp. 2831-2834). Association for Computing Machinery. https://doi.org/10.1145/3366423.3380045

Grønlund, A., Kamma, L. & Larsen, K. G. (2020). Margins are Insufficient for Explaining Gradient Boosting. In H. Larochelle, MA. Ranzato, R. Hadsell, M-F. Balcan & H-T. Lin (Eds.), Advances in Neural Information Processing Systems 33 (NeurIPS 2020) https://proceedings.neurips.cc/paper/2020/hash/146f7dd4c91bc9d80cf4458ad6d6cd1b-Abstract.html

Grønlund, A., Kamma, L. & Larsen, K. G. (2020). Near-Tight Margin-Based Generalization Bounds for Support Vector Machines. In H. Daumé III & A. Singh (Eds.), International Conference on Machine Learning (pp. 3779-3788). MLResearch Press. Proceedings of Machine Learning Research Vol. 119 http://proceedings.mlr.press/v119/gronlund20a.html

Jamalabadi, S., Schwiegelshohn, C. & Schwiegelshohn, U. (2020). Commitment and Slack for Online Load Maximization. In Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures (pp. 339–348). Association for Computing Machinery. https://doi.org/10.1145/3350755.3400271

Displaying results 1 to 50 out of 330

Revised 26.09.2022

Department of Computer Science

Publications

Kasper Green Larsen

Peyman Afshani

Gerth Stølting Brodal

Chris Schwiegelshohn

Publications

Head of research

Kasper Green Larsen

Faculty

Peyman Afshani

Gerth Stølting Brodal

Chris Schwiegelshohn