From Daan
MeesterDaan (talk | contribs) |
MeesterDaan (talk | contribs) |
||
Line 8: | Line 8: | ||
<Center> | <Center> | ||
− | {| align="center" | style=" align=" | + | {| align="center" | style=" align="left"; text-align: center; margin-left: 1em; margin-bottom: 1em; font-size: 100%;" |
! A | ! A | ||
! B | ! B |
Revision as of 21:17, 16 November 2016
Introduction
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 van den Berg) welcome all feedback you might have. Look me up in the UvA-directory, on LinkedIn or FaceBook.
Q&A
A | B |
---|---|
What is ASQAS-34 ?
ASQAS-34 ASQAS-34 ASQAS-34 ASQAS-34 |
|
C | D |
Krustylorty krustymorty | |
E | F |
Stompycorky corkylorty |