Welcome!
I am a postdoctoral researcher in the Knowledge-Based Systems Group of the Institute of Information Systems at the Vienna University of Technology. The position is funded through Prof. Stefan Szeider's ERC grant on The Parameterized Complexity of Reasoning Problems.
Previously, I held postdoctoral positions in the Discrete Mathematics Group at the Center for Mathematical Modeling (CMM) - Universidad de Chile, Santiago, and in the AlGco group (ALgorithms for Graphs and COmbinatorics) at the LIRMM (Laboratoire d'Informatique, de Robotique et de Microélectronique de Montpellier), University of Montpellier 2 in France.
I obtained a PhD from the University of Bergen, Norway in December 2008. The topic of my PhD thesis is Exponential Time Algorithms. I was supervised by Fedor V. Fomin and co-supervised by Pinar Heggernes in the Algorithms Group of the Department of Informatics.
I also studied at the University of Metz, France from 2002 - 2005 where I did my Master Thesis (Algorithmes exponentiels) under the tuition of Dieter Kratsch. From 2000 - 2002, I studied at the University of Luxembourg, Luxembourg.
News
- 30/04/2012: New paper Strong Backdoors to Bounded Treewidth SAT (with Stefan Szeider) available on the arXiv.
- 17/04/2012: The paper Backdoors to Acyclic SAT (with Stefan Szeider) has been accepted to ICALP 2012.
- 13/04/2012: The paper Strong Backdoors to Nested Satisfiability (with Stefan Szeider) has been accepted to SAT 2012.
- 29/03/2012: New paper On Finding Optimal Polytrees (with Mikko Koivisto, Mathieu Liedloff, Sebastian Ordyniak, and Stefan Szeider) accepted to AAAI 2012.
- 29/03/2012: New paper Don't Be Strict in Local Search! (with Eun Jung Kim, Sebastian Ordyniak, Saket Saurabh, and Stefan Szeider) accepted to AAAI 2012.
- 21/03/2012: New paper From edge-disjoint paths to independent paths available on the arXiv.
- 16/03/2012: The paper A Linear Vertex Kernel for Maximum Internal Spanning Tree (with Fedor V. Fomin, Saket Saurabh, and Stéphan Thomassé) has been accepted to the Journal of Computer and System Sciences.
- 21/02/2012: New paper Strong Backdoors to Nested Satisfiability (with Stefan Szeider) available on the arXiv.
- 06/01/2012: The paper A Branch-and-Reduce Algorithm for Finding a Minimum Independent Dominating Set (with Mathieu Liedloff) has been accepted to Discrete Mathematics & Theoretical Computer Science.
- 06/12/2011: New book chapter Multivariate Complexity Theory (with Michael R. Fellows and Frances Rosamond) in Edward K. Blum and Alfred V. Aho, editors, Computer Science: The Hardware, Software and Heart of It, Springer, December 2011.
- 25/11/2011: New paper k-Gap Interval Graphs (with Fedor V. Fomin, Petr Golovach, Karol Suchan, Stefan Szeider, Erik Jan van Leeuwen, Martin Vatshelle, and Yngve Villanger) accepted to LATIN 2012.
- 14/11/2011: I have received a Discovery Early Career Researcher Award from the Australian Research Council. This means I have to turn down the VC postdoctoral fellowship. The 3-year project entitled "Solving intractable problems: from practice to theory and back" will fund my research at The University of New South Wales, with Toby Walsh as a mentor.
- 08/11/2011: I have been awarded a 2012 Vice-Chancellor's Postdoctoral Research Fellowship at The University of New South Wales.
- 08/11/2011: The paper Feedback Vertex Sets in Tournaments (with Matthias Mnich) has been accepted to the Journal of Graph Theory.
- 31/10/2011: New paper Backdoors to Acyclic SAT (with Stefan Szeider) available on the arXiv.
- 31/10/2011: New survey Backdoors to Satisfaction (with Stefan Szeider) available on the arXiv.