
Computing Convex Partitions for Point Sets in the Plane: The CG:SHOP Challenge 2020
We give an overview of the 2020 Computational Geometry Challenge, which ...
read it

WorstCase Optimal Covering of Rectangles by Disks
We provide the solution for a fundamental problem of geometric optimizat...
read it

Parallel Online Algorithms for the Bin Packing Problem
We study parallel online algorithms: For some fixed integer k, a colle...
read it

Packing Disks into Disks with Optimal WorstCase Density
We provide a tight result for a fundamental problem arising from packing...
read it

CADbots: Algorithmic Aspects of Manipulating Programmable Matter with Finite Automata
We contribute results for a set of fundamental problems in the context o...
read it

Coordinated Motion Planning: Reconfiguring a Swarm of Labeled Robots with Bounded Stretch
We present a number of breakthroughs for coordinated motion planning, in...
read it

Tilt Assembly: Algorithms for MicroFactories That Build Objects with Uniform External Forces
We present algorithmic results for the parallel assembly of many micros...
read it

ConflictFree Coloring of Intersection Graphs
A conflictfree kcoloring of a graph G=(V,E) assigns one of k different...
read it
Phillip Keldenich
is this you? claim profile