ERC DASTCO: Developing and Applying Structural Techniques for Combinatorial Objects
I am the principal investigator of the European Research Starting Grant DASTCO. We seek to create new structural tools and techniques for graphs and other combinatorial objects by studying labeled graphs. The goal is to increase our understanding of the classic results in graph theory while developing a broader structural theory of labeled graphs.
We have an ongoing search for graduate students and post doctoral researchers interested in structural aspects of labeled graphs. Interested people should email a CV and a brief description of reserach interests.
I am on the program committee for ACM/SIAM Symposium on Discrete Algorithms (SODA) 2014.
I gave a plenary talk at the Dagstuhl Seminar "Bidimensional Structures: Algorithms, Combinatorics and Logic" in March 2013. I talked about a new proof of the Weak Structure Theorem or Flat Wall Theorem. The article can be found here and a copy of the slides can be found here.
Bertinoro Workshop on Algorithms and Graphs
The Third Bertinoro Workshop on Algorithms and Graphs will be held December 15-20, 2013. The conference webpage can be found here. Plenary speakers this year are:
Julia Chuzhoy, Toyota Technological Institute Chicago
Dan Kral, Warwick University
Daniel Marx, MTA SZTAKI
Bruce Reed, McGill University
Paul Seymour, Princeton University
Stephan Thomasse, Ecole Normale Superieure de Lyon