| 2018 | An Improved FPT Algorithm for Independent Feedback Vertex Set. Shaohua Li, Marcin Pilipczuk |
| 2018 | Anagram-Free Chromatic Number Is Not Pathwidth-Bounded. Paz Carmi, Vida Dujmovic, Pat Morin |
| 2018 | Characterising AT-free Graphs with BFS. Jesse Beisegel |
| 2018 | Characterization and Recognition of Tree 3-Spanner Admissible Directed Path Graphs of Diameter Three. B. S. Panda, Anita Das |
| 2018 | Computing Small Pivot-Minors. Konrad K. Dabrowski, François Dross, Jisu Jeong, Mamadou Moustapha Kanté, O-joung Kwon, Sang-il Oum, Daniël Paulusma |
| 2018 | Connected Vertex Cover for (sP_1+P_5) ( s P 1 + P 5 ) -Free Graphs. Matthew Johnson, Giacomo Paesani, Daniël Paulusma |
| 2018 | Construction and Local Routing for Angle-Monotone Graphs. Anna Lubiw, Debajyoti Mondal |
| 2018 | Convexity-Increasing Morphs of Planar Graphs. Linda Kleist, Boris Klemz, Anna Lubiw, Lena Schlipf, Frank Staals, Darren Strash |
| 2018 | Covering a Graph with Nontrivial Vertex-Disjoint Paths: Existence and Optimization. Renzo Gómez, Yoshiko Wakabayashi |
| 2018 | Edge Partitions of Optimal 2-plane and 3-plane Graphs. Michael A. Bekos, Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani, Chrysanthi N. Raftopoulou |
| 2018 | Equiangular Polygon Contact Representations. Stefan Felsner, Hendrik Schrezenmaier, Raphael Steiner |
| 2018 | Graph Amalgamation Under Logical Constraints. Mateus de Oliveira Oliveira |
| 2018 | Graph-Theoretic Concepts in Computer Science - 44th International Workshop, WG 2018, Cottbus, Germany, June 27-29, 2018, Proceedings Andreas Brandstädt, Ekkehard Köhler, Klaus Meer |
| 2018 | On Directed Feedback Vertex Set Parameterized by Treewidth. Marthe Bonamy, Lukasz Kowalik, Jesper Nederlof, Michal Pilipczuk, Arkadiusz Socala, Marcin Wrochna |
| 2018 | On Dispersable Book Embeddings. Jawaherul Md. Alam, Michael A. Bekos, Martin Gronemann, Michael Kaufmann, Sergey Pupyrev |
| 2018 | On Minimum Connecting Transition Sets in Graphs. Thomas Bellitto, Benjamin Bergougnoux |
| 2018 | On Perfect Linegraph Squares. Meike Hatzel, Sebastian Wiederrecht |
| 2018 | On Weak Isomorphism of Rooted Vertex-Colored Graphs. Lars Jaffke, Mateus de Oliveira Oliveira |
| 2018 | On the Relation of Strong Triadic Closure and Cluster Deletion. Niels Grüttemeier, Christian Komusiewicz |
| 2018 | Optimal General Matchings. Szymon Dudycz, Katarzyna Paluch |
| 2018 | Optimality Program in Segment and String Graphs. Édouard Bonnet, Pawel Rzazewski |
| 2018 | Popular Matchings of Desired Size. Telikepalli Kavitha |
| 2018 | Quasimonotone Graphs. Martin E. Dyer, Haiko Müller |
| 2018 | Recognizing Hyperelliptic Graphs in Polynomial Time. Jelco M. Bodewes, Hans L. Bodlaender, Gunther Cornelissen, Marieke van der Wegen |
| 2018 | Saving Probe Bits by Cube Domination. Peter Damaschke |
| 2018 | Structurally Parameterized d-Scattered Set. Ioannis Katsikarelis, Michael Lampis, Vangelis Th. Paschos |
| 2018 | Subexponential-Time and FPT Algorithms for Embedded Flat Clustered Planarity. Giordano Da Lozzo, David Eppstein, Michael T. Goodrich, Siddharth Gupta |
| 2018 | Temporal Graph Classes: A View Through Temporal Separators. Till Fluschnik, Hendrik Molter, Rolf Niedermeier, Philipp Zschoche |
| 2018 | Tight Lower Bounds for the Number of Inclusion-Minimal st-Cuts. Alessio Conte, Roberto Grossi, Andrea Marino, Romeo Rizzi, Takeaki Uno, Luca Versari |
| 2018 | Treedepth Bounds in Linear Colorings. Jeremy Kun, Michael P. O'Brien, Blair D. Sullivan |
| 2018 | ∀∃ℝ-Completeness and Area-Universality. Michael Gene Dobbins, Linda Kleist, Tillmann Miltzow, Pawel Rzazewski |