| 2023 | A New Width Parameter of Graphs Based on Edge Cuts: α-Edge-Crossing Width. Yeonsu Chang, O-joung Kwon, Myounghwan Lee |
| 2023 | Algorithms and Hardness for Metric Dimension on Digraphs. Antoine Dailly, Florent Foucaud, Anni Hakanen |
| 2023 | Approximating Bin Packing with Conflict Graphs via Maximization Techniques. Ilan Doron-Arad, Hadas Shachnai |
| 2023 | Bounds on Functionality and Symmetric Difference - Two Intriguing Graph Parameters. Pavel Dvorák, Lukás Folwarczný, Michal Opler, Pavel Pudlák, Robert Sámal, Tung Anh Vu |
| 2023 | Complexity Results for Matching Cut Problems in Graphs Without Long Induced Paths. Hoàng-Oanh Le, Van Bang Le |
| 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 Kratochvíl, Michaela Seifrtová |
| 2023 | Cops and Robber - When Capturing Is Not Surrounding. Paul Jungeblut, Samuel Schneider, Torsten Ueckerdt |
| 2023 | Cops and Robbers on Multi-Layer Graphs. Jessica A. Enright, Kitty Meeks, William Pettersson, John Sylvester |
| 2023 | Critical Relaxed Stable Matchings with Two-Sided Ties. Meghana Nasre, Prajakta Nimbhorkar, Keshav Ranjan |
| 2023 | Cutting Barnette Graphs Perfectly is Hard. Édouard Bonnet, Dibyayan Chakraborty, Julien Duron |
| 2023 | Deciding the Erdős-Pósa Property in 3-Connected Digraphs. Julien Bensmail, Victor A. Campos, Ana Karolinna Maia, Nicolas Nisse, Ana Silva |
| 2023 | Degreewidth: A New Parameter for Solving Problems on Tournaments. Tom Davot, Lucas Isenmann, Sanjukta Roy, Jocelyn Thiebaut |
| 2023 | Efficient Constructions for the Győri-Lovász Theorem on Almost Chordal Graphs. Katrin Casel, Tobias Friedrich, Davis Issac, Aikaterini Niklanovits, Ziena Zeif |
| 2023 | Generating Faster Algorithms for d-Path Vertex Cover. Radovan Cervený, Ondrej Suchý |
| 2023 | Graph Search Trees and Their Leaves. Robert Scheffler |
| 2023 | Graph-Theoretic Concepts in Computer Science - 49th International Workshop, WG 2023, Fribourg, Switzerland, June 28-30, 2023, Revised Selected Papers Daniël Paulusma, Bernard Ries |
| 2023 | Maximum Edge Colouring Problem On Graphs That Exclude a Fixed Minor. Zdenek Dvorák, Abhiruk Lahiri |
| 2023 | Metric Dimension Parameterized by Treewidth in Chordal Graphs. Nicolas Bousquet, Quentin Deschamps, Aline Parreau |
| 2023 | New Width Parameters for Independent Set: One-Sided-Mim-Width and Neighbor-Depth. Benjamin Bergougnoux, Tuukka Korhonen, Igor Razgon |
| 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 | Odd Chromatic Number of Graph Classes. Rémy Belmonte, Ararat Harutyunyan, Noleen Köhler, Nikolaos Melissinos |
| 2023 | On the Frank Number and Nowhere-Zero Flows on Graphs. Jan Goedgebeur, Edita Mácajová, Jarne Renders |
| 2023 | On the Minimum Number of Arcs in 4-Dicritical Oriented Graphs. Frédéric Havet, Lucas Picasarri-Arrieta, Clément Rambaud |
| 2023 | Parameterized Complexity of Broadcasting in Graphs. Fedor V. Fomin, Pierre Fraigniaud, Petr A. Golovach |
| 2023 | Parameterized Complexity of Vertex Splitting to Pathwidth at Most 1. Jakob Baumann, Matthias Pfretzschner, Ignaz Rutter |
| 2023 | Parameterized Results on Acyclic Matchings with Implications for Related Problems. Juhi Chaudhary, Meirav Zehavi |
| 2023 | Proportionally Fair Matching with Multiple Groups. Sayan Bandyapadhyay, Fedor V. Fomin, Tanmay Inamdar, Kirill Simonov |
| 2023 | Reconstructing Graphs from Connected Triples. Paul Bastide, Linda Cook, Jeff Erickson, Carla Groenland, Marc J. van Kreveld, Isja Mannens, Jordi L. Vermeulen |
| 2023 | Snakes and Ladders: A Treewidth Story. Steven Chaplick, Steven Kelk, Ruben Meuwese, Matús Mihalák, Georgios Stamoulis |
| 2023 | Tight Algorithms for Connectivity Problems Parameterized by Modular-Treewidth. Falko Hegerfeld, Stefan Kratsch |
| 2023 | Turán's Theorem Through Algorithmic Lens. Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov |
| 2023 | Upper Clique Transversals in Graphs. Martin Milanic, Yushi Uno |
| 2023 | α Feodor F. Dragan, Guillaume Ducoffe |