| Computing Area-Optimal Simple Polygonizations SP Fekete, A Haas, P Keldenich, M Perk, A Schmidt ACM Journal of Experimental Algorithmics (JEA) 27, 1-23, 2022 | 10 | 2022 |
| Automated data retrieval from large-scale distributed satellite systems D Krupke, V Schaus, A Haas, M Perk, J Dippel, B Grzesik, MKB Larbi, ... 2019 IEEE 15th International Conference on Automation Science and …, 2019 | 5 | 2019 |
| On hard instances of the minimum-weight triangulation problem SP Fekete, A Haas, Y Lieder, E Niehs, M Perk, V Sack, C Scheffer 36th European Workshop on Computational Geometry (EuroCG 2020) 3, 2020 | 4 | 2020 |
| A Closer Cut: Computing Near-Optimal Lawn Mowing Tours SP Fekete, D Krupke, M Perk, C Rieck, C Scheffer 2023 Proceedings of the Symposium on Algorithm Engineering and Experiments …, 2023 | 3 | 2023 |
| Covering Geometric Sets with Lines SP Fekete, CM Loi, M Perk 40th European Workshop on Computational Geometry (EuroCG 2024), 2024 | | 2024 |
| Realistic Runtime Analysis for Quantum Simplex Computation S Ammann, M Hess, D Ramacciotti, SP Fekete, PLA Goedicke, D Gross, ... arXiv preprint arXiv:2311.09995, 2023 | | 2023 |
| A quantum algorithm for the solution of the 0-1 Knapsack problem S Wilkening, AI Lefterovici, L Binkowski, M Perk, S Fekete, TJ Osborne arXiv preprint arXiv:2310.06623, 2023 | | 2023 |
| The Lawn Mowing Problem: From Algebra to Algorithms SP Fekete, D Krupke, M Perk, C Rieck, C Scheffer arXiv preprint arXiv:2307.01092, 2023 | | 2023 |
| Circling a Square: The Lawn Mowing Problem Is Algebraically Hard SP Fekete, D Krupke, M Perk, C Rieck, C Scheffer | | 2023 |
| Computing Area-Optimal Simple Polygonalizations. SP Fekete, A Haas, P Keldenich, M Perk, A Schmidt 36th European Workshop on Computational Geometry, 2020 | | 2020 |
Sándor P. FeketeTechnische Universität Braunschweig, L3S Research Center在 tu-bs.de 的电子邮件经过验证
