Talks (not a complete list)

Title Date Place
Partial matching width and lower bounds for read-once branching programs 18.09.2017 Dagstuhl Seminar Series, Seminar 17381: Recent Trends in Knowledge Compilation, Germany
Well-quasi-orderability vs cliquewidth 05.01.2017 Invited talk, Prof. Gregory Gutin's 60th birthday conference, Royal Holloway, University of London, UK
Lower bounds for branching programs of bounded repetition computing CNFs of bounded treewidth: an overview 23.06.2016 Vienna University of Technology, Austria
On the relationship between Non-deterministic read-once branching programs and DNNFs 05.06.2015 Vienna University of Technology, Austria
Finding small separators in linear time via treewidth reduction 09.04.2013 Invited talk, the update meeting on parameterized complexity of graph separation problems, Warsaw, Poland, link
A brief glance at fixed-parameter algorithms and their applications 09.11.2011 Department of Computer Science and Information Systems, Birkbeck, University of London, UK
Parameterization of Graph Separation Problems: current results and further challenges 25.01.2011 Computer Science Department, Royal Holloway University, London, UK
A New Upper Bound on the Number of Important Separators and an Alternative Parameterization of the Multiway Cut Problem 06.03.2011 The University of Warwick, UK
Directed Feedback Vertex Set is Fixed-Parameter Tractable 11.03.2008 Department of Information and Computing Sciences, Utrecht University, The Netherlands
04.03.2008 Computer Science Department, University of Trier, Germany
30.10.2007 Computer Science Department, Royal Holloway University, London, UK
11.07.2007 Dagstuhl Seminar Series, Seminar 07281: Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs, Germany
Exact Computation of Maximum Induced Forest 05.10.2006 EIDMA Seminar Combinatorial Theory, Department of Mathematics and Computer Science, Technische Universiteit Eindhoven, Netherlands
07.09.2006 Algorithms Research Group, Computer Science Department, Université Libre de Bruxelles, Brussels, Belgium
Almost 2-SAT is Fixed-Parameter Tractable 16.10.2008 Computing Sciences Department, University of Munich,Germany
29.01.2009 LIRMM, Montpellier, France
28.05.2009 University of Karlsruhe, Germany
A Faster Exponential Algorithm for Directed Feedback Vertex Set 20.10.2008 Dagstuhl Seminar Series, Seminar 08431, Germany
Parameterised Complexity and Constraint Reasoning 23.06.2009 Association for Constraint Programming Summer School 2009, Cork Constraint Computation Centre (4C), Cork, Ireland
Exploiting Fixed-Parameter Tractability in Satisfiability and Constraint Satisfaction 21.09.2009 CP 2009, Lisbon, Portugal (titorial together with Barry O'Sullivan)