Graph-Theoretic Concepts in Computer Science 46th International Workshop, WG 2020, Leeds, UK, June 24–26, 2020, Revised Selected Papers /
This book constitutes the revised papers of the 46th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2020, held in Leeds, UK, in June 2020. The workshop was held virtually due to the COVID-19 pandemic. The 32 full papers presented in this volume were carefully reviewed and...
| Corporate Author: | |
|---|---|
| Other Authors: | , |
| Language: | English |
| Published: |
Cham :
Springer International Publishing : Imprint: Springer,
2020.
|
| Edition: | 1st ed. 2020. |
| Series: | Theoretical Computer Science and General Issues ;
12301 |
| Subjects: | |
| Online Access: | https://doi.org/10.1007/978-3-030-60440-0 |
Table of Contents:
- Combinatorial Bounds for Conflict-free Coloring on Open Neighborhoods
- Guarding Quadrangulations and Stacked Triangulations with Edges
- Hamiltonian Cycle Parameterized by Treedepth in Single Exponential Time and Polynomial Space
- Parameterized Inapproximability of Independent Set in H-Free Graphs
- Clique-Width of Point Configurations
- On the complexity of finding large odd induced subgraphs and odd colorings
- Knot Diagrams of Treewidth Two
- Treewidth versus clique number in graph classes with a forbidden structure
- Graph Isomorphism Restricted by Lists
- Clique-Width: Harnessing the Power of Atoms
- Edge elimination and weighted graph classes
- Well-partitioned chordal graphs: obstruction set and disjoint paths
- Plattenbauten: Touching Rectangles in Space Universal Geometric Graphs
- Computing Subset Transversals in H-Free Graphs
- Feedback Edge Sets in Temporal Graphs
- On flips in planar matchings
- Degree Distribution for Duplication-Divergence Graphs: Large Deviations
- On Finding Balanced Bicliques via Matchings
- Finding large matchings in 1-planar graphs of minimum degree 3
- Strong cliques in diamond-free graphs
- Recognizing k-Clique Extendible Orderings
- Linear-Time Recognition of Double-Threshold Graphs
- Characterization and Linear-time Recognition of Paired Threshold Graphs
- Drawing Graphs as Spanners
- Inserting one edge into a simple drawing is hard
- Bitonic st-orderings for Upward Planar Graphs: The Variable Embedding Setting
- 2.5-Connectivity: Unique Components, Critical Graphs, and Applications Stable Structure on Safe Set Problems in Vertex-weighted Graphs II – Recognition and Complexity
- The linear arboricity conjecture for 3-degenerate graphs
- Node Multiway Cut and Subset Feedback Vertex Set on Graphs of Bounded Mim-width
- Weighted Additive Spanners.