MEETING-DATE:May 4, 2017
MEETING-LOCATION:DC 1331
MEETING-TIME:1:30
MEETING-CHAIR:Stephen Mann
MEETING-CHAIRPIC:smann-3.jpg
COFFEE-HOUR-LAST-WEEK:Thanks, Marta!
COFFEE-HOUR-THIS-WEEK:Volunteers?
COFFEE-HOUR-NEXT-WEEK:Volunteers?
FORTH-DATE1:May 11, 2017
FORTH-DATE2:May 18, 2017
FORTH-DATE3:May 25, 2017
FORTH-DATE4:June 1, 2017
FORTH-LOCATION1:DC 1331 11:30
FORTH-LOCATION2:DC 1331 1:30
FORTH-LOCATION3:DC 3317 1:30
FORTH-LOCATION4:DC 1331 1:30
FORTH-CHAIR1:Jade Marcoux-Ouellet
FORTH-CHAIR2:Tyler Nowicki
FORTH-CHAIR3:Reza Adhitya Saputra
FORTH-CHAIR4:Matthew Thorne
FORTH-CHAIRPIC1:frog.jpg
FORTH-CHAIRPIC2:tyler.jpg
FORTH-CHAIRPIC3:reza.png
FORTH-CHAIRPIC4:thorne.jpg
FORTH-TP1:Stephen Mann
FORTH-TP2:Jade Marcoux-Ouellet
FORTH-TP3:Tyler Nowicki
FORTH-TP4:Reza Adhitya Saputra
FORTH-TPPIC1:smann-3.jpg
FORTH-TPPIC2:frog.jpg
FORTH-TPPIC3:tyler.jpg
FORTH-TPPIC4:reza.png
TPNAME:Craig S. Kaplan
TPTITLE:Heesch numbers of convex polygons
TPABSTRACT:A polygon's Heesch number is the number of times that polygon can be surrounded by rings of copies of itself.  Very little is known about which Heesch numbers are possible, and a greater understanding of this problem could shed light on open questions in tiling theory.  I will talk about Heesch numbers of convex polygons, with an emphasis on two questions.  First, does there exist a convex n-gon for every n with non-trivial Heesch number?  Second, what can we say about Heesch numbers of convex pentagons?
TPPIC:craig.jpg
DIONE:
DITWO:
DITHREE:
DIFOUR:
AIONE:Lab meeting in DC 3317 on May 25.  See Helen for the key.
AITWO:
AITHREE:
AIFOUR:
LEONE:
LETWO:
LETHREE:
LEFOUR:
DMONE:
DMTWO:
DMTHREE:
DMFOUR:
SEMINARS:<dl><dt>Thursday, May 4, 2017</dt><dd>Seminar * Human Computer Interaction Group<</dd><dd><i>Overcoming Constraints in Small Screen Touch Input</i></dd><dd>Aakar Gupta, University of Toronto</dd><dd>11:00 a.m. * DC 1304</dd></dl><dl><dt>Friday, May 5, 2017</dt><dd>Launch * Graham supercomputer</dd><dd><i>TBA</i></dd><dd>10:30 a.m. * M3 Atrium</dd></dl><dl><dt>Friday, May 5, 2017</dt><dd>Seminar * CrySP Speaker Series on Privacy</dd><dd><i>Access to Basic Subscriber Information and the Spencer Decision: Disentangling Normative and Technological Questions</i></dd><dd>Lisa Austin, University of Toronto</dd><dd>2:00 p.m. * QNC 1502</dd></dl><dl><dt>Saturday, May 6, 2017</dt><dd>Jane's Walk Waterloo Region: Celebrating 50 years of Computer Science at Waterloo</dd><dd>Discover the History of Computer Science at Waterloo</dd><dd>1:00 p.m. * PHY Atrium</dd><dd>https://cs.uwaterloo.ca/events/janes-walk-waterloo-region-celebrating-50-years-computer-science-cs-uwaterloo</dd></dl> <dl><dt>Tuesday, May 9, 2017</dt><dd>Seminar * Algorithms and Complexity Group</dd><dd>Contact Representation of Planar Graphs in 2D and 3D</dd><dd>Stephen Kobourov, University of Arizona</dd><dd>1:30 p.m. * DC 1304</dd></dl>