Algorithms Seminar and Problem Solving Session

Fall 2006
date speaker title
September 13 Ethan Kim, School of Computer Science, McGill University On Bus Graph Realizability
September 27 Steph Durocher, Department of Computer Science, Geometric Facility Location under Continuous Motion
University of British Columbia
October 11 Godfried Toussaint, School of Computer Science, McGill University Computational Geometric Aspects of Musical Rhythm
October 18 Katsuhisa Yamanaka, Department of Computer Science, A Compact Encoding of Rectangular Drawings
Gunma University, Japan with Efficient Query Support
October 25 Christophe Paul, Laboratoire d'Informatique de Robotique Algorithmic Aspects of Modular Decomposition
et de Microélectronique de Montpellier
November 1 Olivier Devillers, INRIA Sophia Antipolis Succinct Representations of Triangulations and Planar Maps
November 15 Mark Grundland, Computer Laboratory, University of Cambridge Improving Image Quality in Image Compositing
November 29 Emeric Gioan, Laboratoire d'Informatique de Robotique Bijections between Spanning Trees and Orientations
et de Microélectronique de Montpellier in Graphs, Geometrical Algorithms and Extensions
December 6 Pat Morin, School of Computer Science, Carleton University Distribution-Sensitive Point Location in Convex Subdivisions
 
Winter 2007
January 10 Christophe Paul, Laboratoire d'Informatique de Robotique Interval Completion with Few Edges
et de Microélectronique de Montpellier
January 17 David Avis, School of Computer Science, McGill University Enumerating Constrained Non-crossing Minimally Rigid Frameworks
February 7 Bruce Shepherd, Bell Labs, New Jersey Network Design with Uncertain Demand
February 28 Vida Dujmović, Department of Mathematics and Statistics, McGill University A Characterization of the Degree Sequences of 2-Trees
March 7 Adrian Vetta, School of Computer Science Degree-Constrained Network Flows
and Department of Mathematics and Statistics, McGill University
March 14 Prosenjit Bose, School of Computer Science, Carleton University On Geometric Spanners
March 28 Lata Narayanan, Department of Computer Science, Concordia University Mechanisms to Induce Random Choice
April 3 Jonathan Farley, University of the West Indies, Jamaica Distributive Lattices of Small Width: A Problem from Stanley's Enumerative Combinatorics
April 25 Christophe Paul, Laboratoire d'Informatique de Robotique Dynamic Representations of Intersection Graphs
et de Microélectronique de Montpellier
 
Summer 2007
June 26 Anthony Bonato, Department of Mathematics, Wilfrid Laurier University Modelling Self-Organizing Networks with a Hidden Metric
June 27 Francesco Giordano, Dipartimento di Ingegneria Elettronica e dell'Informazione, Overlapping Cluster Planarity
Università degli Studi di Perugia
July 18 Francesco Giordano, Dipartimento di Ingegneria Elettronica e dell'Informazione, Upward Spirality and Upward Planarity Testing
Università degli Studi di Perugia
July 19 Francesco Trotta, Dipartimento di Ingegneria Elettronica e dell'Informazione, Drawing Colored Graphs with Constrained Vertex Positions and Few Bends per Edge
Università degli Studi di Perugia
 
Fall 2007
September 26 Rahul Savani , University of Warwick, A simple P-matrix linear complementarity problem for discounted games
 
Winter 2008
January 18 Shin-ichi Tanigawa, Kyoto University, Fast enumeration algorithms for non-crossing geometric graphs