7 citations · 8 across the 8 of their papers we have counts for
9 papers
Drone Air Traffic Control: Tracking a Set of Moving Objects with Minimal Power
Chek-Manh Loi, Michael Perk, Malte Hoffmann +1
A common sensing problem is to use a set of stationary tracking locations to monitor a collection of moving devices: Given objects that need to be tracked, each following its o…
Efficient Heuristics and Exact Methods for Pairwise Interaction Sampling
Sándor P. Fekete, Phillip Keldenich, Dominik Krupke +1
We consider a class of optimization problems that are fundamental to testing in modern configurable software systems, e.g., in automotive industries. In pairwise interaction sampli…
Minimum Non-Obtuse Triangulations: The CG:SHOP Challenge 2025
Sándor P. Fekete, Phillip Keldenich, Dominik Krupke +1
We give an overview of the 2025 Computational Geometry Challenge targeting the problem Minimum Non-Obtuse Triangulation: Given a planar straight-line graph G in the plane, defined…
A quantum search method for quadratic and multidimensional knapsack problems
Sören Wilkening, Andreea-Iulia Lefterovici, Lennart Binkowski +5
Solving combinatorial optimization problems is a promising application area for quantum algorithms in real-world scenarios. In this work, we extend the "Quantum Tree Generator" (QT…
Exact Algorithms for Minimum Dilation Triangulation
Sándor P. Fekete, Phillip Keldenich, Michael Perk
We provide a spectrum of new theoretical insights and practical results for finding a Minimum Dilation Triangulation (MDT), a natural geometric optimization problem of considerable…
Multi-Covering a Point Set by Disks with Minimum Total Area
Mariem Guitouni, Chek-Manh Loi, Sándor P. Fekete +2
A common robotics sensing problem is to place sensors to robustly monitor a set of assets, where robustness is assured by requiring asset to be monitored by at least sen…
How Low Can We Go? Minimizing Interaction Samples for Configurable Systems
Dominik Krupke, Ahmad Moradi, Michael Perk +5
Modern software systems are typically configurable, a fundamental prerequisite for wide applicability and reusability. This flexibility poses an extraordinary challenge for quality…
Realistic Runtime Analysis for Quantum Simplex Computation
Sabrina Ammann, Maximilian Hess, Debora Ramacciotti +10
In recent years, strong expectations have been raised for the possible power of quantum computing for solving difficult optimization problems, based on theoretical, asymptotic wors…
A quantum algorithm for solving 0-1 Knapsack problems
Sören Wilkening, Andreea-Iulia Lefterovici, Lennart Binkowski +3
Here we present two novel contributions for achieving quantum advantage in solving difficult optimisation problems, both in theory and foreseeable practice. (1) We introduce the "Q…