Graph-Theoretic Concepts in Computer Science [E-Book] : 49th International Workshop, WG 2023, Fribourg, Switzerland, June 28-30, 2023, Revised Selected Papers / edited by Daniël Paulusma, Bernard Ries.
This volume constitutes the thoroughly refereed proceedings of the 49th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2023. The 33 full papers presented in this volume were carefully reviewed and selected from a total of 116 submissions. The WG 2022 workshop aims to merg...
Saved in:
Full text |
|
Personal Name(s): | Paulusma, Daniël, editor |
Ries, Bernard, editor | |
Edition: |
1st edition 2023. |
Imprint: |
Cham :
Springer,
2023
|
Physical Description: |
XIII, 478 pages 84 illustrations, 53 illustrations in color (online resource) |
Note: |
englisch |
ISBN: |
9783031433801 |
DOI: |
10.1007/978-3-031-43380-1 |
Series Title: |
/* Depending on the record driver, $field may either be an array with
"name" and "number" keys or a flat string containing only the series
name. We should account for both cases to maximize compatibility. */?>
Lecture Notes in Computer Science ;
14093 |
Subject (LOC): |
- Proportionally Fair Matching with Multiple Groups
- Reconstructing Graphs from Connected Triples
- Parameterized Complexity of Vertex Splitting to Pathwidth at most 1
- Odd Chromatic Number of Graph Classes
- Deciding the Erdos-P osa property in 3-connected digraphs
- New Width Parameters for Independent Set: One-sided-mim-width and Neighbor-depth
- Computational Complexity of Covering Colored Mixed Multigraphswith Degree Partition Equivalence Classes of Size at Most Two
- Cutting Barnette graphs perfectly is hard
- Metric dimension parameterized by treewidth in chordal graphs
- Efficient Constructions for the Gyori-Lovasz Theorem on Almost Chordal Graphs
- Generating faster algorithms for d-Path Vertex Cover
- A new width parameter of graphs based on edge cuts: -edge-crossing width
- Snakes and Ladders: a Treewidth Story
- Parameterized Results on Acyclic Matchings with Implications for Related Problems
- P-matchings Parameterized by Treewidth
- Algorithms and hardness for Metric Dimension on digraphs
- Degreewidth : a New Parameter for Solving Problems on Tournaments
- Approximating Bin Packing with Con ict Graphs via Maximization Techniques
- i-Metric Graphs: Radius, Diameter and all Eccentricities
- Maximum edge colouring problem on graphs that exclude a xed minor
- Bounds on Functionality and Symmetric Di erence { Two Intriguing Graph Parameters
- Cops and Robbers on Multi-layer Graphs
- Parameterized Complexity of Broadcasting in Graphs
- Turan's Theorem Through Algorithmic Lens
- On the Frank number and nowhere-zero ows on graphs
- On the minimum number of arcs in 4-dicritical oriented graphs
- Tight Algorithms for Connectivity Problems Parameterized byModular-Treewidth.