| 2023 | Upper Clique Transversals in Graphs. | Martin Milanic, Yushi Uno |
| 2023 | Complexity Results for Matching Cut Problems in Graphs Without Long Induced Paths. | Hong-Oanh Le, Van Bang Le |
| 2023 | Cops and Robber - When Capturing Is Not Surrounding. | Paul Jungeblut, Samuel Schneider, Torsten Ueckerdt |
| 2023 | Tight Algorithms for Connectivity Problems Parameterized by Modular-Treewidth. | Falko Hegerfeld, Stefan Kratsch |
| 2023 | On the Minimum Number of Arcs in 4-Dicritical Oriented Graphs. | Frdric Havet, Lucas Picasarri-Arrieta, Clment Rambaud |
| 2023 | On the Frank Number and Nowhere-Zero Flows on Graphs. | Jan Goedgebeur, Edita Mcajov, Jarne Renders |
| 2023 | Turn's Theorem Through Algorithmic Lens. | Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov |
| 2023 | Parameterized Complexity of Broadcasting in Graphs. | Fedor V. Fomin, Pierre Fraigniaud, Petr A. Golovach |
| 2023 | Cops and Robbers on Multi-Layer Graphs. | Jessica A. Enright, Kitty Meeks, William Pettersson, John Sylvester |
| 2023 | Maximum Edge Colouring Problem On Graphs That Exclude a Fixed Minor. | Zdenek Dvork, Abhiruk Lahiri |
| 2023 | Bounds on Functionality and Symmetric Difference - Two Intriguing Graph Parameters. | Pavel Dvork, Luks Folwarczn, Michal Opler, Pavel Pudlk, Robert Smal, Tung Anh Vu |
| 2023 | α | Feodor F. Dragan, Guillaume Ducoffe |
| 2023 | Degreewidth: A New Parameter for Solving Problems on Tournaments. | Tom Davot, Lucas Isenmann, Sanjukta Roy, Jocelyn Thiebaut |
| 2023 | Algorithms and Hardness for Metric Dimension on Digraphs. | Antoine Dailly, Florent Foucaud, Anni Hakanen |
| 2023 | Untitled record | Juhi Chaudhary, Meirav Zehavi |
| 2023 | Parameterized Results on Acyclic Matchings with Implications for Related Problems. | Juhi Chaudhary, Meirav Zehavi |
| 2023 | Snakes and Ladders: A Treewidth Story. | Steven Chaplick, Steven Kelk, Ruben Meuwese, Mats Mihalk, Georgios Stamoulis |
| 2023 | A New Width Parameter of Graphs Based on Edge Cuts: α-Edge-Crossing Width. | Yeonsu Chang, O-joung Kwon, Myounghwan Lee |
| 2023 | Generating Faster Algorithms for d-Path Vertex Cover. | Radovan Cerven, Ondrej Such |
| 2023 | Efficient Constructions for the Győri-Lovsz Theorem on Almost Chordal Graphs. | Katrin Casel, Tobias Friedrich, Davis Issac, Aikaterini Niklanovits, Ziena Zeif |
| 2023 | Metric Dimension Parameterized by Treewidth in Chordal Graphs. | Nicolas Bousquet, Quentin Deschamps, Aline Parreau |
| 2023 | Cutting Barnette Graphs Perfectly is Hard. | douard Bonnet, Dibyayan Chakraborty, Julien Duron |
| 2023 | Computational Complexity of Covering Colored Mixed Multigraphs with Degree Partition Equivalence Classes of Size at Most Two (Extended Abstract). | Jan Bok, Jir Fiala, Nikola Jedlickov, Jan Kratochvl, Michaela Seifrtov |
| 2023 | Nonplanar Graph Drawings with k Vertices per Face. | Carla Binucci, Giuseppe Di Battista, Walter Didimo, Seok-Hee Hong, Michael Kaufmann, Giuseppe Liotta, Pat Morin, Alessandra Tappini |
| 2023 | New Width Parameters for Independent Set: One-Sided-Mim-Width and Neighbor-Depth. | Benjamin Bergougnoux, Tuukka Korhonen, Igor Razgon |