From Daan
Revision as of 14:15, 16 November 2016 by MeesterDaan (talk | contribs)
ASQAS-34 is a perfect rectangle packing problem solved by Braam, Moes, Suilen, Van den Berg and Bhulai in 2016 and earlier (unpublished) by Giovanni Resta. I'm still working on this page, but our paper is here. I (Daan) welcome all feedback you might have.
The Leuven Solution |
---|
Cases
AmstelHaege | Rush Hour | (EN) Chips & Circuits |
---|---|---|
Tegelzetten | Fruitvliegen | Radio Russia |
Lectures & Lesroosters | (Hier komt 'Forensics') | (under construction) |