Archive for June, 2012

This week the University of Waterloo celebrated Bill Cunningham’s 65th birthday with a conference in his honour. Bill’s work is on graph matchings and matroids, specifically exact optimization, algorithms, and polyhedral combinatorics. For example, he gave the first polynomial-time algorithm to compute the strength of a graph. He completed his thesis at Waterloo under the […]


Diagrams

03Jun12

The diagram above is from a paper of mine which, as I found out today, was published last year! It is in ACM Transactions on Algorithms, although their website still lists the “current issue” as 2010 and they didn’t tell me when it went to press. The paper, joint with Ramki Thurimella, is about using a […]