Articles acceptés
- Satoru Iwata, Alantha Newman and R. Ravi.
Graph TSP from Steiner Cycles
- Oliver Schaudt, Andrea Oversberg and Van Bang Le.
Polynomial time recognition of squares of ptolemaic graphs and 3-sun-free split graphs
- Gregory Gutin, Mark Jones, Bin Sheng and Magnus Wahlström.
Parameterized Directed k-Chinese Postman Problem and k Arc-Disjoint Cycles Problem on Euler Digraphs
- Felix Joos.
A Characterization of Mixed Unit Interval Graphs
- Sigve Hortemo Sæther and Jan Arne Telle.
Between Treewidth and Clique-width
- Nieke Aerts and Stefan Felsner.
Vertex Contact Graphs of Paths on a Grid
- Henning Bruhn, Morgan Chopin, Felix Joos and Oliver Schaudt.
Structural parameterizations for boxicity
- Radoslav Fulek.
Towards Hanani-Tutte Theorem for Clustered Graphs
- Isolde Adler, Mamadou Kanté and O-Joung Kwon.
Linear rank-width of distance-hereditary graphs
- Rajiv Gandhi and Guy Kortsarz.
Edge Covering with Budget Constrains
- Manu Basavaraju, Pinar Heggernes, Pim van't Hof, Reza Saei and Yngve Villanger.
Maximal induced matchings in triangle-free graphs
- Aistis Atminas, Andrew Collins, Jan Foniok and Vadim V. Lozin.
Deciding the Bell number for hereditary graph properties
- Thomas Erlebach and Michael Hoffmann.
Minimum Spanning Tree Verification under Uncertainty
- Thiago Marcilon, Samuel Nascimento and Rudini Sampaio.
The maximum time of 2-neighbour bootstrap percolation: complexity results
- Leo van Iersel and Steven Kelk.
Kernelizations for the hybridization number problem on multiple nonbinary trees
- Petr Golovach, Pinar Heggernes, Pim Van't Hof and Christophe Paul.
Hadwiger Number of Graphs with Small Chordality
- Michael Lampis, Kazuhisa Makino, Valia Mitsou and Yushi Uno.
Parameterized Edge Hamiltonicity
- Oliver Schaudt and Eglantine Camby.
A new characterization of Pk-free graphs
- Stefan Hougardy and Rasmus T. Schroeder.
Edge Elimination in TSP Instances
- Antoine Mamcarz and Michel Habib.
Colored modular and split decompositions of graphs with applications to trigraphs
- Stéphan Thomassé, Nicolas Trotignon and Kristina Vuskovic.
A polynomial Turing-kernel for weighted independent set in bull-free graphs
- Paul Bonsma.
Independent Set Reconfiguration in Cographs
- Eric Aaron, Danny Krizanc and Elliot Meyerson.
DMVP: Foremost Waypoint Coverage of Time-Varying Graphs
- Gengchun Xu and Qian-Ping Gu.
Near-Linear Time Constant-Factor Approximation Algorithm for Branch-Decomposition of Planar Graphs
- Falk Hüffner, Christian Komusiewicz, Rolf Niedermeier and Martin Rötzschke.
The Parameterized Complexity of the Rainbow Subgraph Problem
- Manu Basavaraju, L. Sunil Chandran, Martin Charles Golumbic, Rogers Mathew and Deepak Rajendraprasad.
Boxicity and separation dimension
- Basile Couëtoux, Elie Nakache and Yann Vaxès.
The Maximum Labeled Path Problem
- Steven Chaplick, Paul Dorbec, Jan Kratochvil, Mickael Montassier and Juraj Stacho.
Contact Representations of Planar Graph: Rebuilding is Hard
- Hadas Shachnai and Meirav Zehavi.
Parameterized Algorithms for Graph Partitioning Problems
- Petr Golovach, Daniel Paulusma and Erik Jan van Leeuwen.
Induced Disjoint Paths in Circular-Arc Graphs in Linear Time
- Kustaa Kangas, Petteri Kaski, Mikko Koivisto and Janne Korhonen.
On the Number of Connected Sets in Bounded Degree Graphs
- Ross Mc Connell, Nathan Lindzey, Vinicius F. Dos Santos, Pinar Heggernes, Jeremy Spinrad and Petr Golovach.
Recognizing Threshold Tolerance Graphs in O(n^2) Time
