| 2014 | A New Characterization of P | Eglantine Camby, Oliver Schaudt |
| 2014 | Structural Parameterizations for Boxicity. | Henning Bruhn, Morgan Chopin, Felix Joos, Oliver Schaudt |
| 2014 | Independent Set Reconfiguration in Cographs. | Paul S. Bonsma |
| 2014 | Maximal Induced Matchings in Triangle-Free Graphs. | Manu Basavaraju, Pinar Heggernes, Pim van 't Hof, Reza Saei, Yngve Villanger |
| 2014 | Boxicity and Separation Dimension. | Manu Basavaraju, L. Sunil Chandran, Martin Charles Golumbic, Rogers Mathew, Deepak Rajendraprasad |
| 2014 | Deciding the Bell Number for Hereditary Graph Properties - (Extended Abstract). | Aistis Atminas, Andrew Collins, Jan Foniok, Vadim V. Lozin |
| 2014 | Distributedly Testing Cycle-Freeness. | Heger Arfaoui, Pierre Fraigniaud, David Ilcinkas, Fabien Mathieu |
| 2014 | Vertex Contact Graphs of Paths on a Grid. | Nieke Aerts, Stefan Felsner |
| 2014 | Linear Rank-Width of Distance-Hereditary Graphs. | Isolde Adler, Mamadou Moustapha Kant, O-joung Kwon |
| 2014 | DMVP: Foremost Waypoint Coverage of Time-Varying Graphs. | Eric Aaron, Danny Krizanc, Elliot Meyerson |
| 2013 | Connecting Terminals and 2-Disjoint Connected Subgraphs. | Jan Arne Telle, Yngve Villanger |
| 2013 | Overview of New Approaches for Approximating TSP. | Ola Svensson |
| 2013 | Drawing Graphs with Few Arcs. | Andr Schulz |
| 2013 | Characterizing and Computing the Structure of Clique Intersections in Strongly Chordal Graphs. | Ragnar Nevries, Christian Rosenke |
| 2013 | Parameterized Algorithms for Max Colorable Induced Subgraph Problem on Perfect Graphs. | Neeldhara Misra, Fahad Panolan, Ashutosh Rai, Venkatesh Raman, Saket Saurabh |
| 2013 | Certifying 3-Edge-Connectivity. | Kurt Mehlhorn, Adrian Neumann, Jens M. Schmidt |
| 2013 | On Finding Tucker Submatrices and Lekkerkerker-Boland Subgraphs. | Nathan Lindzey, Ross M. McConnell |
| 2013 | Coloring Triangle-Free Rectangular Frame Intersection Graphs with O(loglogn) Colors. | Tomasz Krawczyk, Arkadiusz Pawlik, Bartosz Walczak |
| 2013 | On Retracts, Absolute Retracts, and Folds in Cographs. | Ton Kloks, Yue-Li Wang |
| 2013 | A Linear-Time Kernelization for the Rooted k-Leaf Outbranching Problem. | Frank Kammer |
| 2013 | Tight Upper Bounds for Minimum Feedback Arc Sets of Regular Graphs. | Kathrin Hanauer, Franz-Josef Brandenburg, Christopher Auer |
| 2013 | OBDD-Based Representation of Interval Graphs. | Marc Gill |
| 2013 | Excluding Graphs as Immersions in Surface Embedded Graphs. | Archontia C. Giannopoulou, Marcin Kaminski, Dimitrios M. Thilikos |
| 2013 | Lower and Upper Bounds for Long Induced Paths in 3-Connected Planar Graphs. | Emilio Di Giacomo, Giuseppe Liotta, Tamara Mchedlidze |
| 2013 | FPT Is Characterized by Useful Obstruction Sets. | Michael R. Fellows, Bart M. P. Jansen |