Björn Feldkord

Algorithmen und Komplexität / Heinz Nixdorf Institut (bis 2023)
bjoernf@campus.uni-paderborn.de
ID
22704

16 Publications

Mark all

[16]
2022 | Conference Paper | LibreCat-ID: 31847
Castenow, Jannik, et al. “The K-Server with Preferences Problem.” Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures, Association for Computing Machinery, 2022, pp. 345–56, doi:10.1145/3490148.3538595.
LibreCat | DOI | arXiv
 
[15]
2021 | Journal Article | LibreCat-ID: 20683
Feldkord, Björn, et al. “Managing Multiple Mobile Resources.” Theory of Computing Systems, vol. 65, 2021, pp. 943–984, doi:10.1007/s00224-020-10023-8.
LibreCat | DOI
 
[14]
2021 | Conference Paper | LibreCat-ID: 20817
Bienkowski, Marcin, et al. “A Nearly Optimal Deterministic Online Algorithm for Non-Metric Facility Location.” Proceedings of the 38th Symposium on Theoretical Aspects of Computer Science (STACS), 2021, pp. 14:1-14:17, doi:10.4230/LIPIcs.STACS.2021.14.
LibreCat | DOI
 
[13]
2020 | Conference Paper | LibreCat-ID: 17370
Castenow, Jannik, et al. “The Online Multi-Commodity Facility Location Problem.” Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 2020, doi:10.1145/3350755.3400281.
LibreCat | Files available | DOI | arXiv
 
[12]
2020 | Dissertation | LibreCat-ID: 15631
Feldkord, Björn. Mobile Resource Allocation. 2020, doi:10.17619/UNIPB/1-869.
LibreCat | Files available | DOI
 
[11]
2019 | Conference Paper | LibreCat-ID: 12870
Feldkord, Björn, et al. “Managing Multiple Mobile Resources.” Proceedings of the 17th Workshop on Approximation and Online Algorithms (WAOA), Springer, 2019, pp. 120–37, doi:10.1007/978-3-030-39479-0_9.
LibreCat | DOI | arXiv
 
[10]
2019 | Journal Article | LibreCat-ID: 13873
Feldkord, Björn, and Friedhelm Meyer auf der Heide. “The Mobile Server Problem.” ACM Transactions on Parallel Computing (TOPC), vol. 6, no. 3, 14, 2019, doi:10.1145/3364204.
LibreCat | Files available | DOI
 
[9]
2018 | Conference Paper | LibreCat-ID: 2484
Feldkord, Björn, et al. “Fully-Dynamic Bin Packing with Little Repacking.” 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018), edited by Ioannis Chatzigiannakis et al., vol. 107, Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 2018, pp. 51:1-51:24, doi:10.4230/LIPIcs.ICALP.2018.51.
LibreCat | Files available | DOI | arXiv
 
[8]
2018 | Conference Paper | LibreCat-ID: 2485
Feldkord, Björn, and Friedhelm Meyer auf der Heide. “Online Facility Location with Mobile Facilities.” Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), ACM, 2018, pp. 373–81, doi:10.1145/3210377.3210389.
LibreCat | Files available | DOI
 
[7]
2018 | Book Chapter | LibreCat-ID: 16392
Feldkord, Björn, et al. “A Dynamic Distributed Data Structure for Top-k and k-Select Queries.” Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications, 2018, doi:10.1007/978-3-319-98355-4_18.
LibreCat | DOI
 
[6]
2017 | Conference Paper | LibreCat-ID: 70
Feldkord, Björn, et al. “Price Fluctuations in Online Leasing.” Proceedings of the 11th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 2017, pp. 17–31, doi:10.1007/978-3-319-71147-8_2.
LibreCat | Files available | DOI
 
[5]
2017 | Conference Paper | LibreCat-ID: 55
Feldkord, Björn, and Friedhelm Meyer auf der Heide. “The Mobile Server Problem.” Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2017, pp. 313–19, doi:10.1145/3087556.3087575.
LibreCat | Files available | DOI
 
[4]
2017 | Conference Paper | LibreCat-ID: 16348
Biermeier, Felix, et al. “A Communication-Efficient Distributed Data Structure for Top-k and k-Select Queries.” Proceedings of the 15th Workshop on Approximation and Online Algorithms (WAOA), Springer, 2017, pp. 285–300, doi:10.1007/978-3-319-89441-6_21.
LibreCat | DOI
 
[3]
2016 | Conference Paper | LibreCat-ID: 149
Drees, Maximilian, et al. “Strategic Online Facility Location.” Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 2016, pp. 593--607, doi:10.1007/978-3-319-48749-6_43.
LibreCat | Files available | DOI
 
[2]
2014 | Mastersthesis | LibreCat-ID: 391
Feldkord, Björn. On Variants of the Page Migration Problem. Universität Paderborn, 2014.
LibreCat
 
[1]
2012 | Bachelorsthesis | LibreCat-ID: 600
Feldkord, Björn. Lokale Swaps und überholte Informationen in Basic Network Creation Games. Universität Paderborn, 2012.
LibreCat
 
Marked Publication(s)

Search

Filter Publications

Display / Sort

Citation Style: MLA

Export / Embed

16 Publications

Mark all

[16]
2022 | Conference Paper | LibreCat-ID: 31847
Castenow, Jannik, et al. “The K-Server with Preferences Problem.” Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures, Association for Computing Machinery, 2022, pp. 345–56, doi:10.1145/3490148.3538595.
LibreCat | DOI | arXiv
 
[15]
2021 | Journal Article | LibreCat-ID: 20683
Feldkord, Björn, et al. “Managing Multiple Mobile Resources.” Theory of Computing Systems, vol. 65, 2021, pp. 943–984, doi:10.1007/s00224-020-10023-8.
LibreCat | DOI
 
[14]
2021 | Conference Paper | LibreCat-ID: 20817
Bienkowski, Marcin, et al. “A Nearly Optimal Deterministic Online Algorithm for Non-Metric Facility Location.” Proceedings of the 38th Symposium on Theoretical Aspects of Computer Science (STACS), 2021, pp. 14:1-14:17, doi:10.4230/LIPIcs.STACS.2021.14.
LibreCat | DOI
 
[13]
2020 | Conference Paper | LibreCat-ID: 17370
Castenow, Jannik, et al. “The Online Multi-Commodity Facility Location Problem.” Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 2020, doi:10.1145/3350755.3400281.
LibreCat | Files available | DOI | arXiv
 
[12]
2020 | Dissertation | LibreCat-ID: 15631
Feldkord, Björn. Mobile Resource Allocation. 2020, doi:10.17619/UNIPB/1-869.
LibreCat | Files available | DOI
 
[11]
2019 | Conference Paper | LibreCat-ID: 12870
Feldkord, Björn, et al. “Managing Multiple Mobile Resources.” Proceedings of the 17th Workshop on Approximation and Online Algorithms (WAOA), Springer, 2019, pp. 120–37, doi:10.1007/978-3-030-39479-0_9.
LibreCat | DOI | arXiv
 
[10]
2019 | Journal Article | LibreCat-ID: 13873
Feldkord, Björn, and Friedhelm Meyer auf der Heide. “The Mobile Server Problem.” ACM Transactions on Parallel Computing (TOPC), vol. 6, no. 3, 14, 2019, doi:10.1145/3364204.
LibreCat | Files available | DOI
 
[9]
2018 | Conference Paper | LibreCat-ID: 2484
Feldkord, Björn, et al. “Fully-Dynamic Bin Packing with Little Repacking.” 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018), edited by Ioannis Chatzigiannakis et al., vol. 107, Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 2018, pp. 51:1-51:24, doi:10.4230/LIPIcs.ICALP.2018.51.
LibreCat | Files available | DOI | arXiv
 
[8]
2018 | Conference Paper | LibreCat-ID: 2485
Feldkord, Björn, and Friedhelm Meyer auf der Heide. “Online Facility Location with Mobile Facilities.” Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), ACM, 2018, pp. 373–81, doi:10.1145/3210377.3210389.
LibreCat | Files available | DOI
 
[7]
2018 | Book Chapter | LibreCat-ID: 16392
Feldkord, Björn, et al. “A Dynamic Distributed Data Structure for Top-k and k-Select Queries.” Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications, 2018, doi:10.1007/978-3-319-98355-4_18.
LibreCat | DOI
 
[6]
2017 | Conference Paper | LibreCat-ID: 70
Feldkord, Björn, et al. “Price Fluctuations in Online Leasing.” Proceedings of the 11th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 2017, pp. 17–31, doi:10.1007/978-3-319-71147-8_2.
LibreCat | Files available | DOI
 
[5]
2017 | Conference Paper | LibreCat-ID: 55
Feldkord, Björn, and Friedhelm Meyer auf der Heide. “The Mobile Server Problem.” Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2017, pp. 313–19, doi:10.1145/3087556.3087575.
LibreCat | Files available | DOI
 
[4]
2017 | Conference Paper | LibreCat-ID: 16348
Biermeier, Felix, et al. “A Communication-Efficient Distributed Data Structure for Top-k and k-Select Queries.” Proceedings of the 15th Workshop on Approximation and Online Algorithms (WAOA), Springer, 2017, pp. 285–300, doi:10.1007/978-3-319-89441-6_21.
LibreCat | DOI
 
[3]
2016 | Conference Paper | LibreCat-ID: 149
Drees, Maximilian, et al. “Strategic Online Facility Location.” Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 2016, pp. 593--607, doi:10.1007/978-3-319-48749-6_43.
LibreCat | Files available | DOI
 
[2]
2014 | Mastersthesis | LibreCat-ID: 391
Feldkord, Björn. On Variants of the Page Migration Problem. Universität Paderborn, 2014.
LibreCat
 
[1]
2012 | Bachelorsthesis | LibreCat-ID: 600
Feldkord, Björn. Lokale Swaps und überholte Informationen in Basic Network Creation Games. Universität Paderborn, 2012.
LibreCat
 
Marked Publication(s)

Search

Filter Publications

Display / Sort

Citation Style: MLA

Export / Embed