Paper on Rectangle Packing Accepted at ICALP 2021

Our paper on anchored rectangle packing was accepted at the 48th International Colloquium on Automata, Languages and Programming (ICALP 2021)! It is about an open problem by Freedman from 1969, asking whether one can always cover 50% of the unit rectangle with disjoint rectangles anchored in $n$ adversarially given points. Up to now the best result proved a coverage of 10%. Our paper improves this to 39%! See arXiv for the full version of our paper.

Professor for Theoretical Computer Science