Marcin Kaminski. Max-Cut and containment relations in graphsStavros Nikolopoulos and Kyriaki Ioannidou. The Longest Path Problem is Polynomial on Cocomparability GraphsPetr Golovach, Dieter Kratsch and Jean-Francois Couturier. Colorings With Few Colors: Counting, Enumeration and Combinatorial Bounds Tamas Fleiner. On stable matchings and flowsHajo Broersma, Petr Golovach, Daniel Paulusma and Jian Song. Narrowing down the gap on the complexity of coloring P_k-free graphsPinar Heggernes, Pim van 't Hof, Daniel Lokshtanov and Jesper Nederlof. Computing the cutwidth of bipartite permutation graphs in linear timeMathieu Liedloff, Ioan Todinca and Yngve Villanger.Solving Capacitated Dominating Set by using Covering by Subsets and Maximum MatchingFrederic Dorn, Hannes Moser, Rolf Niedermeier and Mathias Weller. Efficient Algorithms for Eulerian ExtensionGe Xia and Yong Zhang. On the Small Cycle Transversal of Planar GraphsPanos Giannopoulos, Christian Knauer, Mike Fellows, Christophe Paul, Frances Rosamond, Sue Whitesides and Nathan Yu.Milling a Graph with Turn Costs: a Parameterized Complexity PerspectiveKarin Arikushi, Radoslav Fulek, Balazs Keszegh, Filip Moric and Csaba Toth. Drawing Graphs with Orthogonal CrossingsMarek Cygan, Marcin Pilipczuk, MichaÅ‚ Pilipczuk and Jakub Wojtaszczyk. Kernelization hardness of connectivity problems in d-degenerate graphsIsolde Adler, Binh-Minh Bui-Xuan, Yuri Rabinovich, Gabriel Renault, Jan Arne Telle and Martin Vatshelle.On the boolean-width of a graph: structure and applications Pinar Heggernes, Daniel Lokshtanov, Jesper Nederlof, Christophe Paul and Jan Arne Telle. Generalized graph clustering: recognizing (p,q)-cluster graphsKonrad Dabrowski, Vadim Lozin, Rajiv Raman and Bernard Ries. Colouring vertices of triangle-free graphsGeevarghese Philip, Venkatesh Raman and Yngve Villanger. A Quartic Kernel for Pathwidth-One Vertex DeletionJeremie Chalopin, Paola Flocchini, Bernard Mans and Nicola Santoro. Network ExplorationÂ Â by Silent and Oblivious RobotsAnnabell Berger and Matthias MÃ¼ller-Hannemann. Uniform Sampling of Undirected and Directed Graphs with a Fixed Degree SequenceRenÃ© van Bevern, Christian Komusiewicz, Hannes Moser and Rolf Niedermeier.Measuring Indifference: Unit Interval Vertex DeletionDÃ¡niel Marx and IldikÃ³ Schlotter. Parameterized Complexity of the Arc-Preserving Subsequence ProblemSteven Chaplick, Marisa Gutierrez, Benjamin LÃ©vÃªque and Silvia Tondato. From path graphs to directed path graphsNicolas Bonichon, Cyril Gavoille, Nicolas Hanusse and David Ilcinkas. Connections between Theta-Graphs, Delaunay Triangulations, and Orthogonal SurfacesRobert Elsaesser and Adrian Ogierman. Efficient Broadcasting in Random Power Law NetworksPadmini Mukkamala, Janos Pach and Deniz Sarioz.Graphs with large obstacle numbers. The Complexity of Vertex Coloring Problems in Uniform Hypergraphs with High CodegreeEdyta Szymanska Colin McDiarmid and Tobias Mueller. The number of bits needed to represent a unit disk graphJannik Matuschke and Britta Peis. Lattices and maximum flow algorithms in planar graphs |