# WorKer 2011 – The Third Workshop on Kernelization

**Vienna University of Technology, 2-4 September 2011, Vienna, Austria.**

This page has been mirrored here from its original location at http://www.kr.tuwien.ac.at/drm/worker2011.

Contents

## Aims & Scope

Research on theory and applications of kernelization is a vibrant and rapidly developing area in algorithm design and complexity. After successful workshops in Bergen 2009 and Leiden 2010, this third workshop aims at consolidating the results achieved in recent years and discussing future research directions.

A special aspect this year is to take a closer look at related work from different research areas, in particular from Practical Preprocessing, Property Testing, and Knowledge Compilation. Therefore we have invited leading researchers from these three areas to provide keynote talks.

The workshop will feature invited keynote talks as well as several invited and contributed talks with surveys and new technical results. The workshop will also provide opportunities for all participants to engage in joint research and discussions on open problems and future directions.

We expect the workshop program to start in the morning of Friday, 2 September 2011, and to end after lunch on Sunday, 4 September 2011.

## Keynote Speakers

- Armin Biere, Johannes Kepler University, Linz, Austria
- Sourav Chakraborty, Chennai Mathematical Institute, India
- Michael R. Fellows, Charles Darwin University, Australia
- Fedor V. Fomin, University of Bergen, Norway
- Bart Jansen, Utrecht University, the Netherlands
- Daniel Lokshtanov, University of California, San Diego, USA
- Pierre Marquis, Université d’Artois & CRIL-CNRS, France
- Anders Yeo, Royal Holloway, University of London, UK

## Organizers

The workshop is organized by Serge Gaspers, Sebastian Ordyniak, and Stefan Szeider (chair).

The organizers acknowledge the support from the advisory board consisting of Sourav Chakraborty, Fedor V. Fomin, and Daniel Lokshtanov.

## Sponsors

The organizers acknowledge the funding from the following organizations:

- Vienna Center for Logic and Algorithms (VCLA)
- Wolfgang Pauli Institute (WPI)
- European Research Council (ERC)

## Registration

The registration is now **closed**.

For people invited by the organizers it was possible to register until 18 July 2011. Registration is free of charge and includes attendance to all workshop events and lectures, coffee breaks, and lunches.

Note that this workshop does not produce any proceedings and presentations here should not cause any problem for submitting the same material to a conference or journal.

The invited talks will be open to the public. Local people who are interested in some of the talks but do not want to participate in the entire workshop (and the social program) do not need to register.

## Travel and Local Information

### Travel Information to Vienna / your Hotel

Please consult our visitors’ guide.

### The Workshop Venue

Lectures will take place at a department building of Vienna University of Technology. The street address is: Gußhausstrasse 25-29. The lecture room is called “EI 9 Hlawka Hörsaal” and is located on the ground floor. After entering the building through the glass doors turn right.

The venue can be reached by a 5 minutes walk from Karlsplatz, a hub of Vienna’s public transport system. For instance the underground lines U1, U2, and U4 have a stop at Karlsplatz.

View Workshop Venue in a larger map

### Tourist Information

Please consult our visitors’ guide.

## Participants

- Faisal Abu-Khzam, Lebanese American University, Lebanon
- Rémy Belmonte, University of Bergen, Norway
- Armin Biere, Johannes Kepler University, Linz, Austria
- Sourav Chakraborty, Chennai Mathematical Institute, India
- Robert Crowston, Royal Holloway, University of London, UK
- Wolfgang Dvorak, Vienna University of Technology, Austria
- Uwe Egly, Vienna University of Technology, Austria
- Michael R. Fellows, Charles Darwin University, Australia
- Henning Fernau, Universität Trier, Germany
- Fedor Fomin, University of Bergen, Norway
- Serge Gaspers, Vienna University of Technology, Austria
- Archontia Giannopoulou, National and Kapodistrian University of Athens, Greece
- Jiong Guo, University of Saarland, Germany
- Gregory Gutin, Royal Holloway, University of London, UK
- Sepp Hartung, TU Berlin, Germany
- Pinar Heggernes, University of Bergen, Norway
- Marijn Heule, Delft University of Technology, The Netherlands
- Pim van ‘t Hof, University of Bergen, Norway
- Falk Hüffner, TU Berlin, Germany
- Bart Jansen, Utrecht University, the Netherlands
- Matti Järvisalo, University of Helsinki, Finland
- Mark Jones, Royal Holloway, University of London, United Kingdom
- Eunjung Kim, CNRS, France
- Stefan Kratsch, Utrecht University, The Netherlands
- Martin Lackner, Vienna University of Technology, Austria
- Daniel Lokshtanov, University of California, San Diego, USA
- Dániel Marx, Humboldt-Universität zu Berlin, Germany
- Ramanujan Maadapuzhi Sridharan, The Institute of Mathematical Sciences, India
- Pierre Marquis, Université d’Artois & CRIL-CNRS, France
- Jesper Nederlof, University of Bergen, Norway
- Rolf Niedermeier, TU Berlin, Germany
- Sebastian Ordyniak, Vienna University of Technology, Austria
- Christophe Paul, CNRS – LIRMM (Montpellier), France
- Andreas Pfandler, Vienna University of Technology, Austria
- Reinhard Pichler, Vienna University of Technology, Austria
- Marcin Pilipczuk, University of Warsaw, Poland
- Michał Pilipczuk, University of Warsaw, Poland
- Arash Rafiey, IDSIA, Switzerland
- Venkatesh Raman, Institute of Mathematical Sciences, Chennai, India
- Frances A. Rosamond, Charles Darwin University, Australia
- Stefan Rümmele, Vienna University of Technology, Austria
- Saket Saurabh, The Institute of Mathematical Sciences, India
- Martina Seidl, Johannes Kepler Universität Linz, Austria
- Hadas Shachnai, Technion, Israel
- Narges Simjour, University of Waterloo, Canada
- Friedrich Slivovsky, Vienna University of Technology, Austria
- Karolina Soltys, Max Planck Institute, Germany
- Ondra Suchy, Saarland University, Saarbrucken, Germany
- Stefan Szeider, Vienna University of Technology, Austria
- Jan Arne Telle, University of Bergen, Norway
- Dimitrios Thilikos, National and Kapodistrian University of Athens, Greece
- Erik Jan van Leeuwen, University of Bergen, Norway
- Angelina Vidali, University of Vienna, Austria
- Yngve Villanger, University of Bergen, Norway
- Magnus Wahlström, Max Planck Institute for Informatics, Germany
- Mathias Weller, TU Berlin, Germany
- Stefan Woltran, Vienna University of Technology, Austria
- Anders Yeo, Royal Holloway, University of London, UK

## Talks

### Keynote Talks

*Armin Biere:*Preprocessing and Inprocessing Techniques in SAT slides [Abstract]*Sourav Chakraborty:*Property Testing: Sublinear Algorithms for Promise Problems slides [Abstract]*Michael R. Fellows:*Kernelization and the Larger Picture of Practical Algorithmics, in Contemporary Context slides [Abstract]*Fedor V. Fomin:*Protrusions in graphs and their applications slides [Abstract]*Bart Jansen:*Kernelization for a Hierarchy of Structural Parameters slides [Abstract]*Daniel Lokshtanov:*Generalization and Specialization of Kernelization slides [Abstract]*Pierre Marquis:*A Few Words about Knowledge Compilation slides [Abstract]*Anders Yeo:*Simultaneously Satisfying Linear Equations Over F_2: Parameterized Above Average slides [Abstract]

### Contributed Talks

*Robert Crowston:*Max-r-Lin Above Average and its Applications slides*Henning Fernau:*A linear kernel for the differential of a graph slides*Sepp Hartung:*Linear-Time Computation of a Linear Problem Kernel for Dominating Set on Planar Graphs slides*Pim van ‘t Hof:*Parameterized Complexity of Vertex Deletion into Perfect Graph Classes slides*Falk Hüffner:*Graph Transformation and Kernelization: Confluent Data Reduction for Edge Clique Cover slides*Stefan Kratsch:*Co-nondeterminism in compositions: A kernelization lower bound for a Ramsey-type problem slides*Erik Jan van Leeuwen:*Kernels for domination when the stars are out slides*Dániel Marx:*Kernelization of Packing Problems*Hadas Shachnai:*From Approximative Kernelization to High Fidelity Reductions slides*Karolina Soltys:*Hierarchies of kernelization hardness slides*Magnus Wahlström:*Polynomial kernels for some graph cut problems slides*Gregory Gutin:*Kernels for below-upper-bound parameterizations of the hitting set and directed dominating set problem slides

## Schedule

### Friday, September 2

08.50 – 09.00 | Opening |

09.00 – 10.00 | Keynote talk. Fedor V. Fomin: Protrusions in graphs and their applications slides |

10.00 – 10.30 | Sepp Hartung: Linear-Time Computation of a Linear Problem Kernel for Dominating Set on Planar Graphs slides |

10.30 – 11.00 | Coffee break |

11.00 – 12.00 | Keynote talk. Pierre Marquis: A Few Words about Knowledge Compilation slides |

12.00 – 12.30 | Falk Hüffner: Graph Transformation and Kernelization: Confluent Data Reduction for Edge Clique Cover slides |

12.30 – 14.00 | Lunch: Mensa |

14.00 – 15.00 | Keynote talk. Anders Yeo: Simultaneously Satisfying Linear Equations Over F_2: Parameterized Above Average slides |

15.00 – 15.30 | Robert Crowston: Max-r-Lin Above Average and its Applications slides |

15.30 – 16.00 | Erik Jan van Leeuwen: Kernels for domination when the stars are out slides |

16.00 – 16.30 | Coffee break |

16.30 – 17.30 | Keynote talk. Armin Biere: Preprocessing and Inprocessing Techniques in SAT slides |

17.30 – 18.00 | Henning Fernau: A linear kernel for the differential of a graph slides |

### Saturday, September 3

09.00 – 10.00 | Open problem session. |

10.00 – 10.30 | Karolina Soltys: Hierarchies of kernelization hardness slides |

10.30 – 11.00 | Coffee break |

11.00 – 12.00 | Keynote talk. Sourav Chakraborty: Property Testing: Sublinear Algorithms for Promise Problems slides |

12.00 – 12.30 | Hadas Shachnai: From Approximative Kernelization to High Fidelity Reductions slides |

12.30 – 13.30 | Lunch: Buffet |

13.30 – 14.00 | Group photo |

14.00 – 15.00 | Keynote talk. Daniel Lokshtanov: Generalization and Specialization of Kernelization slides |

15.00 – 15.30 | Stefan Kratsch: Co-nondeterminism in compositions: A kernelization lower bound for a Ramsey-type problem slides |

15.30 – 16.00 | Coffee break |

16.00 – 16.30 | Gregory Gutin: Kernels for below-upper-bound parameterizations of the hitting set and directed dominating set problems slides |

16.30 – 17.30 | Keynote talk. Bart Jansen: Kernelization for a Hierarchy of Structural Parameters slides |

18.00 | Group 1 leaves via public transport to Kahlenberg (view) and then to Heurigen |

18.30 | Group 2 leaves via private bus directly to Heurigen |

19.00 – 23.00 | Workshop dinner: at Heurigen Sirbu |

22.00 | Group 2 leaves via bus to Karlsplatz |

### Sunday, September 4

09.30 – 10.30 | Keynote talk. Michael R. Fellows: Kernelization and the Larger Picture of Practical Algorithmics, in Contemporary Context slides |

10.30 – 11.00 | Coffee break |

11.00 – 11.30 | Pim van ‘t Hof: Parameterized Complexity of Vertex Deletion into Perfect Graph Classes slides |

11.30 – 12.00 | Magnus Wahlström: Polynomial kernels for some graph cut problems slides |

12.00 – 12.30 | Dániel Marx: Kernelization of Packing Problems |

13.00 – 14.00 | Lunch: Restaurant Ischia |

14.00 | Closing |