On this webpage you will find the slides of WG 2011 presentations that we were provided to us. In case of powerpoint presentations, whenever possible, we provide both the original ppt-version as well as a converted pdf-version.
Invited talks
- Alberto Marchetti-Spaccamela: Structures and Hyperstructures in Metabolic Networks – pdf
- Dániel Marx: Important separators and parameterized algorithms – pdf
Contributed talks
- Liliana Alcon, Luerbio Faria, Celina Figueiredo and Marisa Gutierrez. Split clique graph complexity – pdf | ppt
- Christopher Auer and Andreas Gleißner. Characterizations of Deque and Queue Graphs – pdf
- Rémy Belmonte and Martin Vatshelle. Graph Classes with Structured Neighborhoods and Algorithmic Applications – pdf
- Hans L. Bodlaender and Dieter Kratsch. Exact Algorithms for Kayles – pdf
- Marijke Bodlaender, Cor Hurkens and Gerhard J. Woeginger. The Cinderella game on holes and anti-holes – pdf
- Katarina Cechlarova and Eva Jelinkova. Approximability of Economic Equilibrium for Housing Markets With Duplicate Houses – pdf
- Jean-Francois Couturier, Petr Golovach, Dieter Kratsch and Daniel Paulusma. List coloring in the absence of a linear forest – pdf
- Marek Cygan, Daniel Marx, Marcin Pilipczuk, Michal Pilipczuk and Ildiko Schlotter. Parameterized Complexity of Eulerian Deletion Problems – pdf
- Andreas Emil Feldmann, Shantanu Das and Peter Widmayer. Restricted Cuts for Bisections in Solid Grids – svg (open with a web browser)
- Holger Flier, Matus Mihalak, Anna Zych and Peter Widmayer. Maximum Independent Set in 2-Direction Outersegment Graphs – pdf
- Serge Gaspers, Mathieu Liedloff, Maya Stein and Karol Suchan. Complexity of Splits Reconstruction for Low-Degree Trees – pdf
- Toru Hasunuma and Hiroshi Nagamochi. Improved Bounds for Minimum Fault-Tolerant Gossip Graphs – pptx
- Danny Hermelin, Chien-Chung Huang, Stefan Kratsch and Magnus Wahlström. Parameterized Two-Player Nash Equilibrium – pdf | ppt
- Konstanty Junosza-Szaniawski, Zbigniew Lonc and Michal Tuczynski. Counting independent sets in claw-free graphs – pdf
- Iyad Kanj and Fenghui Zhang. On the independence number of graphs with maximum degree 3 – pdf
- Ján Katrenič, František Galčík and Gabriel Semanišin. On computing an optimal semi-matching – pdf
- Daniel Lokshtanov, Matthias Mnich and Saket Saurabh. Planar k-Path in Subexponential Time and Polynomial Space – pdf
- Yota Otachi, Toshiki Saitoh, Katsuhisa Yamanaka, Shuji Kijima, Yoshio Okamoto, Hirotaka Ono, Yushi Uno and Koichi Yamazaki. Approximability of the Path-Distance-Width for AT-free Graphs – pdf
- Alexander Ravsky and Oleg Verbitsky. On collinear sets in straight line drawings – pdf
- Hisao Tamaki. A polynomial time algorithm for bounded directed pathwidth – pdf
