| 2019 | Subexponential Algorithms for Variants of Homomorphism Problem in String Graphs. | Karolina Okrasa, Pawel Rzazewski |
| 2019 | Reconfiguring Hamiltonian Cycles in L-Shaped Grid Graphs. | Rahnuma Islam Nishat, Sue Whitesides |
| 2019 | Classified Rank-Maximal Matchings and Popular Matchings - Algorithms and Hardness. | Meghana Nasre, Prajakta Nimbhorkar, Nada Pulath |
| 2019 | Minimal Separators in Graph Classes Defined by Small Forbidden Induced Subgraphs. | Martin Milanic, Nevena Pivac |
| 2019 | Hamiltonicity Below Dirac's Condition. | Bart M. P. Jansen, Lszl Kozma, Jesper Nederlof |
| 2019 | A Polynomial-Time Algorithm for the Independent Set Problem in P_10, C_4, C_6 -Free Graphs. | Edin Husic, Martin Milanic |
| 2019 | Linear MIM-Width of Trees. | Svein Hgemo, Jan Arne Telle, Erlend Raa Vgset |
| 2019 | Cyclewidth and the Grid Theorem for Perfect Matching Width of Bipartite Graphs. | Meike Hatzel, Roman Rabinovich, Sebastian Wiederrecht |
| 2019 | Maximum Independent Sets in Subcubic Graphs: New Results. | Ararat Harutyunyan, Michael Lampis, Vadim V. Lozin, Jrme Monnot |
| 2019 | Fast Breadth-First Search in Still Less Space. | Torben Hagerup |
| 2019 | 3-Colorable Planar Graphs Have an Intersection Segment Representation Using 3 Slopes. | Daniel Gonalves |
| 2019 | The Power of Cut-Based Parameters for Computing Edge Disjoint Paths. | Robert Ganian, Sebastian Ordyniak |
| 2019 | Counting Independent Sets in Graphs with Bounded Bipartite Pathwidth. | Martin E. Dyer, Catherine S. Greenhill, Haiko Mller |
| 2019 | The 4-Steiner Root Problem. | Guillaume Ducoffe |
| 2019 | A Turing Kernelization Dichotomy for Structural Parameterizations of ℱ -Minor-Free Deletion. | Huib Donkers, Bart M. P. Jansen |
| 2019 | Travelling on Graphs with Small Highway Dimension. | Yann Disser, Andreas Emil Feldmann, Max Klimm, Jochen Knemann |
| 2019 | The Exponential-Time Complexity of Counting (Quantum) Graph Homomorphisms. | Hubie Chen, Radu Curticapean, Holger Dell |
| 2019 | Intersection Graphs of Non-crossing Paths. | Steven Chaplick |
| 2019 | Approximating Minimum Dominating Set on String Graphs. | Dibyayan Chakraborty, Sandip Das, Joydeep Mukherjee |
| 2019 | Shortest Reconfiguration of Matchings. | Nicolas Bousquet, Tatsuhiko Hatanaka, Takehiro Ito, Moritz Mhlenthaler |
| 2019 | Color Refinement, Homomorphisms, and Hypergraphs. | Jan Bker |
| 2019 | On Happy Colorings, Cuts, and Structural Parameterizations. | Ivan Bliznets, Danil Sagunov |
| 2019 | Maximum Matchings and Minimum Blocking Sets in \varTheta _6 -Graphs. | Therese Biedl, Ahmad Biniaz, Veronika Irvine, Kshitij Jain, Philipp Kindermann, Anna Lubiw |
| 2019 | Fixed-Parameter Tractability of Counting Small Minimum (S, T)-Cuts. | Pierre Berg, Benjamin Mouscadet, Arpad Rimmel, Joanna Tomasik |
| 2019 | Independent Set Reconfiguration Parameterized by Modular-Width. | Rmy Belmonte, Tesshu Hanaka, Michael Lampis, Hirotaka Ono, Yota Otachi |