WG

Keyphrases

Publications

2023

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

volume 14093, 2023

Graph-Theoretic Concepts in Computer Science - 49th International Workshop, WG 2023, Fribourg, Switzerland, June 28-30, 2023, Revised Selected Papers WG 14093 (2023)

2022

volume 13453, 2022

Graph-Theoretic Concepts in Computer Science - 48th International Workshop, WG 2022, Tübingen, Germany, June 22-24, 2022, Revised Selected Papers WG 13453 (2022)