14 citations · 20 across the 13 of their papers we have counts for
5 papers · 1 filter
Matching with Multiple Bottlenecks: Parameterized Complexity and Approximation
Jonas Friemel, Tilo Hoitz, Phillip Keldenich +1
We consider a matching problem in which the cost of each edge is a vector with components. The cost of a matching is the sum of the bottlenecks over all components, and we ask…
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…
Parallel Online Algorithms for the Bin Packing Problem
Sándor P. Fekete, Jonas Grosse-Holz, Phillip Keldenich +1
We study \emph{parallel} online algorithms: For some fixed integer , a collective of parallel processes that perform online decisions on the same sequence of events forms a…
CADbots: Algorithmic Aspects of Manipulating Programmable Matter with Finite Automata
Sándor P. Fekete, Robert Gmyr, Sabrina Hugo +3
We contribute results for a set of fundamental problems in the context of programmable matter by presenting algorithmic methods for evaluating and manipulating a collective of part…
Tilt Assembly: Algorithms for Micro-Factories That Build Objects with Uniform External Forces
Aaron T. Becker, Sándor P. Fekete, Phillip Keldenich +4
We present algorithmic results for the parallel assembly of many micro-scale objects in two and three dimensions from tiny particles, which has been proposed in the context of prog…