WG 2016 Accepted Papers
Michał Dębski, Zbigniew Lonc and Paweł Rzążewski. Sequences of radius k for complete bipartite graphs Mitre C. Dourado, Lucia Penso and Dieter Rautenbach. Geodetic convexity parameters for graphs with few short induced paths
Andreas Brandstädt and Raffaele Mosca. Weighted Efficient Domination for P5-Free and for P6-Free Graphs Bruno Escoffier. Saving colors and Max Coloring: some fixed-parameter tractability results Leizhen Cai and Junjie Ye. Finding Two Edge-Disjoint Paths with Length Constraints
Eric Angel, Evripidis Bampis, Bruno Escoffier and Michael Lampis. Parameterized Power Vertex Cover Feodor Dragan, Ekkehard Koehler and Hend Alrasheed. Eccentricity Approximating Trees: Extended Abstract
Linda Kleist. Drawing Planar Graphs with Prescribed Face Areas
Fedor Fomin and Torstein Strømme. Vertex Cover Structural Parameterization Revisited Pedro Montealegre and Ioan Todinca. Distance-d Independent Set and other problems in graphs with "few" minimal separators
Didem Gözüpek, Sibel Özkan, Christophe Paul, Ignasi Sau and Mordechai Shalom. Parameterized complexity of the MINCCA problem on graphs of bounded decomposability Martin Pergel and Paweł Rzążewski. On edge intersection graphs of paths with 2 bends Mingyu Xiao and Shaowei Kou. Almost Induced Matching: Linear Kernels and Parameterized Algorithms Ondrej Suchy. On Directed Steiner Trees with Multiple Roots
Ramanujan M. S.. A Faster Parameterized Algorithm for Group Feedback Edge Set Katerina Bohmova, Jérémie Chalopin, Matúš Mihalák, Guido Proietti and Peter Widmayer. Sequence Hypergraphs: Directed Colored Graphs s.t. Color Forms Path