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