1 citations · 1 across the 4 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2026
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…
cs.DS2025★ 1 cited
Tile Reconfiguration by a Finite Automaton
Jonas Friemel, David Liedtke, Christian Scheffer
Shape formation is one of the most thoroughly studied problems in programmable matter and swarm robotics. However, in many models, the class of shapes that can be formed is highly…