Abstract is missing.
- Proportionally Fair Matching with Multiple GroupsSayan Bandyapadhyay, Fedor V. Fomin, Tanmay Inamdar 0002, Kirill Simonov. 1-15 [doi]
- Reconstructing Graphs from Connected TriplesPaul Bastide 0002, Linda Cook, Jeff Erickson 0001, Carla Groenland, Marc J. van Kreveld, Isja Mannens, Jordi L. Vermeulen. 16-29 [doi]
- Parameterized Complexity of Vertex Splitting to Pathwidth at Most 1Jakob Baumann, Matthias Pfretzschner, Ignaz Rutter. 30-43 [doi]
- Odd Chromatic Number of Graph ClassesRémy Belmonte, Ararat Harutyunyan, Noleen Köhler, Nikolaos Melissinos. 44-58 [doi]
- Deciding the Erdős-Pósa Property in 3-Connected DigraphsJulien Bensmail, Victor A. Campos, Ana Karolinna Maia, Nicolas Nisse, Ana Silva 0001. 59-71 [doi]
- New Width Parameters for Independent Set: One-Sided-Mim-Width and Neighbor-DepthBenjamin Bergougnoux, Tuukka Korhonen, Igor Razgon. 72-85 [doi]
- Nonplanar Graph Drawings with k Vertices per FaceCarla Binucci, Giuseppe Di Battista, Walter Didimo, Seok-Hee Hong 0001, Michael Kaufmann 0001, Giuseppe Liotta, Pat Morin, Alessandra Tappini. 86-100 [doi]
- Computational Complexity of Covering Colored Mixed Multigraphs with Degree Partition Equivalence Classes of Size at Most Two (Extended Abstract)Jan Bok, Jirí Fiala 0001, Nikola Jedlicková, Jan Kratochvíl, Michaela Seifrtová. 101-115 [doi]
- Cutting Barnette Graphs Perfectly is HardÉdouard Bonnet, Dibyayan Chakraborty, Julien Duron. 116-129 [doi]
- Metric Dimension Parameterized by Treewidth in Chordal GraphsNicolas Bousquet, Quentin Deschamps, Aline Parreau. 130-142 [doi]
- Efficient Constructions for the Győri-Lovász Theorem on Almost Chordal GraphsKatrin Casel, Tobias Friedrich 0001, Davis Issac, Aikaterini Niklanovits, Ziena Zeif. 143-156 [doi]
- Generating Faster Algorithms for d-Path Vertex CoverRadovan Cervený, Ondrej Suchý. 157-171 [doi]
- A New Width Parameter of Graphs Based on Edge Cuts: α-Edge-Crossing WidthYeonsu Chang, O-joung Kwon, Myounghwan Lee. 172-186 [doi]
- Snakes and Ladders: A Treewidth StorySteven Chaplick, Steven Kelk, Ruben Meuwese, Matús Mihalák, Georgios Stamoulis. 187-200 [doi]
- Parameterized Results on Acyclic Matchings with Implications for Related ProblemsJuhi Chaudhary, Meirav Zehavi. 201-216 [doi]
- P-Matchings Parameterized by TreewidthJuhi Chaudhary, Meirav Zehavi. 217-231 [doi]
- Algorithms and Hardness for Metric Dimension on DigraphsAntoine Dailly, Florent Foucaud, Anni Hakanen. 232-245 [doi]
- Degreewidth: A New Parameter for Solving Problems on TournamentsTom Davot, Lucas Isenmann, Sanjukta Roy, Jocelyn Thiebaut. 246-260 [doi]
- Approximating Bin Packing with Conflict Graphs via Maximization TechniquesIlan Doron Arad, Hadas Shachnai. 261-275 [doi]
- i-Metric Graphs: Radius, Diameter and all EccentricitiesFeodor F. Dragan, Guillaume Ducoffe . 276-290 [doi]
- Maximum Edge Colouring Problem On Graphs That Exclude a Fixed MinorZdenek Dvorák, Abhiruk Lahiri. 291-304 [doi]
- Bounds on Functionality and Symmetric Difference - Two Intriguing Graph ParametersPavel Dvorák, Lukas Folwarczny, Michal Opler, Pavel Pudlák, Robert Sámal, Tung Anh Vu. 305-318 [doi]
- Cops and Robbers on Multi-Layer GraphsJessica A. Enright, Kitty Meeks, William Pettersson, John Sylvester 0001. 319-333 [doi]
- Parameterized Complexity of Broadcasting in GraphsFedor V. Fomin, Pierre Fraigniaud, Petr A. Golovach. 334-347 [doi]
- Turán's Theorem Through Algorithmic LensFedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov. 348-362 [doi]
- On the Frank Number and Nowhere-Zero Flows on GraphsJan Goedgebeur, Edita Mácajová, Jarne Renders. 363-375 [doi]
- On the Minimum Number of Arcs in 4-Dicritical Oriented GraphsFrédéric Havet, Lucas Picasarri-Arrieta, Clément Rambaud. 376-387 [doi]
- Tight Algorithms for Connectivity Problems Parameterized by Modular-TreewidthFalko Hegerfeld, Stefan Kratsch. 388-402 [doi]
- Cops and Robber - When Capturing Is Not SurroundingPaul Jungeblut, Samuel Schneider, Torsten Ueckerdt. 403-416 [doi]
- Complexity Results for Matching Cut Problems in Graphs Without Long Induced PathsHoàng-Oanh Le, Van Bang Le. 417-431 [doi]
- Upper Clique Transversals in GraphsMartin Milanic, Yushi Uno. 432-446 [doi]
- Critical Relaxed Stable Matchings with Two-Sided TiesMeghana Nasre, Prajakta Nimbhorkar, Keshav Ranjan. 447-461 [doi]
- Graph Search Trees and Their LeavesRobert Scheffler 0001. 462-476 [doi]