Accepted presentations
- Bruno COURCELLE. Short vertex labels for connectivity checking in planar graphs with forbidden parts
- Mamadou Moustapha Kanté. Short Labeling Scheme for Connectivity Check on Certain Graph Classes of Unbounded Clique-Width
- Carmen Centeno, Mitre Dourado and Jayme Szwarcfiter. On the convexity of paths of length two in undirected graphs
- Vladimir Deineko and Alexander Tiskin. Minimum-weight double-tree shortcutting for Metric TSP: Bounding the approximation ratio
- Pinar Heggernes, Daniel Meister and Charis Papadopoulos. A new representation of proper interval graphs with an application to clique-width
- Alexander Grigoriev, Natalya Usotskaya and Bert Marchal. On planar graphs with large tree-width and small grid minors
- Stan van Hoesel and Bert Marchal. Finding good tree decompositions by local search
- Daniel Brügmann, Christian Komusiewicz and Hannes Moser. On Generating Triangle-Free Graphs
- Ignasi Sau and Dimitrios Thilikos. Subexponential Parameterized Algorithms for Bounded-Degree Connected Subgraph Problems on Planar Graphs
- Kathie Cameron, Chinh Hoang and Benjamin Leveque. Asteroids in rooted and directed path graphs
- Gregory Gutin. Out-branchings with Maximal Number of Leaves or Internal Vertices: Algorithmic Results and Open Problems
- Tomas Feder, Pavol Hell, Jing Huang and Arash Rafiey. Adjusted Interval Digraphs
- Frédéric Mazoit. Tree-width of graphs and surface duality
- Michel Habib and Juraj Stacho. Linear Algorithms for Chordal Graphs of Bounded Directed Vertex Leafage
- David Coudert, Dorian Mazauric and Nicolas Nisse. On Rerouting Connection Requests in Networks with Shared Bandwidth
- Feodor Dragan. Collective Tree Spanners for Unit Disk Graphs with Applications
- Michel Habib and Vincent Limouzy. On some simplicial elimination schemes for chordal graphs
- Kristina Vuskovic and Nicolas Trotignon. Graphs with no cycle with a unique chord
- Domingos Cardoso and Sofia Pinheiro. Spectral upper bounds on the size of k-regular induced subgraphs
- Robert Ganian and Petr Hlineny. On Parse Trees and Myhill-Nerode-type Tools for handling Graphs of Bounded Rank-width
- Nicholas Korpelainen. A Polynomial-time Algorithm for the Dominating Induced Matching Problem in the Class of Convex Graphs
- Leo van Iersel and Matthias Mnich. Rooted and Unrooted Maximum Consistent Supertrees
- Stanislav Zivny, David Cohen and Peter Jeavons. The Expressive Power of Binary Submodular Functions
- Andreas Brandstadt and Raffaele Mosca. On Variants of the Maximum Induced Matching Problem
- Enide Martins, Liliana Costa and Carlos Fonseca. Counting vertices and edges of a Birkhoff polytope for trees
- Illya Hicks. Integer Programming Techniques for General Branchwidth
- Marcin Kaminski, Pim van’t Hof and Daniël Paulusma. Induced paths with parity constraints in claw-free graphs
- Stefan Szeider. MSO problems on graphs with local cardinality constraints
- Pierre Charbit, Fabien de Montgolfier and Mathieu Raffinot. On split decomposition of undirected graph
- Binh-Minh Bui-Xuan, Jan Arne Telle and Martin Vatshelle. Dynamic programming on graph of bounded rank-width in fast FPT time using unions of neighbourhoods
- Stephan Kreutzer. Dominating Sets in Nowhere Dense Classes of Structures
- Ferdinando Cicalese and Martin Milanic. The structure of graphs of separability at most 2
- Thomas Erlebach, Torben Hagerup, Klaus Jansen, Moritz Minzlaff and Alexander Wolff. Trimming of Graphs, with Applications to Point Labeling
- Andras Salamon. Multicoloured cliques in vertex-coloured graphs
- Hans L. Bodlaender, Stephan Thomasse and Anders Yeo. Analysis of Data Reduction: Transformations give evidence for non-existence of polynomial kernels
- P. Tittmann, I. Averbouch and J.A. Makowsky. The Enumeration of Vertex Induced Subgraphs with respect to the Number of Components
- M.C. Golumbic, Conflict and Tolerance in Algorithmic Graph Theory