Students

• Hussein Houdrouge
• Saeed Odak
• David Worley

Projects

• Analysis of Franklin's Leader Election Algorithm
• Notes on Helly Properties of Graphs
• Layered Partitions/Product Structure

Open Problems

• Resolution of Convex Drawings
• Tripod Packing
• Anagram-Free Colouring
• Biplanar Crossing Number
• Blockers and Midpoints
• Problems from the Palace
• Edge-independent Spanning Trees
• Erdős-Hajnal for Graphs of Bounded VC-Dimension
• Grid Obstacle Representations
• Open Problems from Hawaiian Workshop
• Induced Forests in Planar Graphs
• Interference in Random Point Sets
• Optimal Log Placement
• General Position Subsets
• Page Number Versus Layered Treewidth
• Pizza Cutting
• Pythagorean Bicliques
• Queue Number versus Layered Treewidth
• Plane Graphs on a Constant Number of Tracks
• Triangles in Arrangements of (Pseudo)Circles
• Unit Distances in Convex Point Sets
• Unmatched Colourings
• Geometric Vehicle Routing/Scheduling Problems
• Distribution-Sensitive Halfspace Range Counting
• Packing Trees
• Partitioning a Sequence in Monotonic Subsequences
• Obstacle Numbers
• Non-Repetitive Colouring
• Pattern Matching on Generalized Strings
• Degeneracy of Small Monotone Classes

Old Stuff

• Free Collinear Sets
• $k$-Holes in Random Point Sets
• Layered Pathwidth and Non-Repetitive Chromatic Number
• Layered Pathwidth versus Stack Number