Postal Address:
Room MAL260
Department of Computer Science and Information Systems
Birkbeck University of London
Malet Street
London
WC1E 7HX
T: +44 (0)20 7631 6480
F: +44 (0)20 7631 6727
E: igor at dcs.bbk.ac.uk
Includes the complete list of publications, preprints, and the overview of the most important ones.
Funded: by EPSRC
Started: 30.08.2014
Total amount: £395000
Birkbeck part: £152000; includes 18 months Research Fellowship - starts in Sept 2016
Principal investigator: Dr. Vadim Lozin
Title | Date | Place |
---|---|---|
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 |
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, 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) |