Graph-theoretic Concepts In Computer Science 35th International Workshop Wg 2

Graph-theoretic Solutions To Computational Geometry Problems.- Algorithms For Classes Of Graphs With Bounded Expansion.- A Graph Polynomial Arising From Community Structure (extended Abstract).- Fast Exact Algorithms For Hamiltonicity In Claw- Graphs.- Maximum Series-parallel Subgraph.- Low-port Tree Representations.- Fully Dynamic Representations Of Interval Graphs.- The Parameterized Complexity Of Some Minimum Label Problems.- Exact And Parameterized Algorithms For Max Internal Spanning Tree.- An Exact Algorithm For Minimum Distortion Embedding.- Sub-coloring And Hypo-coloring Interval Graphs.- Parameterized Complexity Of Generalized Domination Problems.- Connected Feedback Vertex Set In Planar Graphs.- Logical Locality Entails Frugal Distributed Computation Over Graphs (extended Abstract).- On Module-composed Graphs.- An Even Simpler Linear-time Algorithm For Verifying Minimum Spanning Trees.- The K-disjoint Paths Problem On Chordal Graphs.- Local Algorithms For Edge Colorings In Udgs.- Directed Rank-width And Displit Decomposition.- An Algorithmic Study Of Switch Graphs.- Hardness Results And Efficient Algorithms For Graph Powers.- Graph Partitioning And Traffic Grooming With Bounded Degree Request Graph.- Injective Oriented Colourings.- Chordal Digraphs.- A Intersection Model And Improved Algorithms For Tolerance Graphs.- Counting The Number Of Matchings In Chordal And Chordal Bipartite Graph Classes.- Distance D-domination Games.- Cycles, Paths, Connectivity And Diameter In Distance Graphs.- Smallest Odd Holes In Claw- Graphs (extended Abstract).- Finding Induced Paths Of Given Parity In Claw- Graphs.