Graph-Theoretic Concepts in Computer Science 49th International Workshop, WG 2023, Fribourg, Switzerland, June 28–30, 2023, Revised Selected Papers /
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...
Bewaard in:
| Coauteur: | |
|---|---|
| Andere auteurs: | , |
| Formaat: | Elektronisch E-boek |
| Taal: | Engels |
| Gepubliceerd in: |
Cham :
Springer Nature Switzerland : Imprint: Springer,
2023.
|
| Editie: | 1st ed. 2023. |
| Reeks: | Lecture Notes in Computer Science,
14093 |
| Onderwerpen: | |
| Online toegang: | https://doi.org/10.1007/978-3-031-43380-1 |
| Tags: |
Voeg label toe
Geen labels, Wees de eerste die dit record labelt!
|
Inhoudsopgave:
- 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.