- Liliana Alcon, Luerbio Faria, Celina Figueiredo and Marisa Gutierrez. Split clique graph complexity
- Felix Arends, Joel Ouaknine and Charles Wampler. On Searching for Small Kochen-Specker Vector Systems
- Christopher Auer and Andreas Gleißner. Characterizations of Deque and Queue Graphs
- Rémy Belmonte and Martin Vatshelle. Graph Classes with Structured Neighborhoods and Algorithmic Applications
- Hans L. Bodlaender and Dieter Kratsch. Exact Algorithms for Kayles
- Marijke Bodlaender, Cor Hurkens and Gerhard J. Woeginger. The Cinderella game on holes and anti-holes
- Ondřej Bílka, Jozef Jirásek, Pavel Klavík, Martin Tancer and Jan Volec. On the Complexity of Planar Covering of Small Graphs
- Katarina Cechlarova and Eva Jelinkova. Approximability of Economic Equilibrium for Housing Markets With Duplicate Houses
- Christine Cheng, Eric McDermid and Ichiro Suzuki. Planarization and acyclic colorings of subcubic claw-free graphs
- Jean-Francois Couturier, Petr Golovach, Dieter Kratsch and Daniel Paulusma. List coloring in the absence of a linear forest
- Marek Cygan, Daniel Marx, Marcin Pilipczuk, Michal Pilipczuk and Ildiko Schlotter. Parameterized Complexity of Eulerian Deletion Problems
- Andreas Emil Feldmann, Shantanu Das and Peter Widmayer. Restricted Cuts for Bisections in Solid Grids
- Holger Flier, Matus Mihalak, Anna Zych and Peter Widmayer. Maximum Independent Set in 2-Direction Outersegment Graphs
- Serge Gaspers, Mathieu Liedloff, Maya Stein and Karol Suchan. Complexity of Splits Reconstruction for Low-Degree Trees
- Magnus M. Halldorsson, Sergey Kitaev and Artem Pyatking. Alternation graphs
- Toru Hasunuma and Hiroshi Nagamochi. Improved Bounds for Minimum Fault-Tolerant Gossip Graphs
- Danny Hermelin, Chien-Chung Huang, Stefan Kratsch and Magnus Wahlström. Parameterized Two-Player Nash Equilibrium
- Konstanty Junosza-Szaniawski, Zbigniew Lonc and Michal Tuczynski. Counting independent sets in claw-free graphs
- Iyad Kanj and Fenghui Zhang. On the independence number of graphs with maximum degree 3
- Ján Katrenič, František Galčík and Gabriel Semanišin. On computing an optimal semi-matching
- Daniel Lokshtanov, Matthias Mnich and Saket Saurabh. Planar k-Path in Subexponential Time and Polynomial Space
- Andrew McGrae and Michele Zito. Empires Make Cartography Hard: The Complexity of the Empire Colouring Problem
- 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
- Michael Pelsmajer, Marcus Schaefer, Daniel Štefankovie and Radoslav Fulek. Hanani-Tutte and Monotone Drawings
- Alexander Ravsky and Oleg Verbitsky. On collinear sets in straight line drawings
- Manuel Sorge, René Van Bevern, Rolf Niedermeier and Mathias Weller. From Few Components to an Eulerian Graph by Adding Arcs
- Juraj Stacho, Elad Cohen and Steven Chaplick. Recognizing some subclasses of vertex intersection graphs of 0-bend paths in a grid
- Hisao Tamaki. A polynomial time algorithm for bounded directed pathwidth