Graph-theoretic concepts in computer science : 41st International Workshop, WG 2015 Garching, Germany, June 17-19, 2015, revised papers /: 41st International Workshop, WG 2015 Garching, Germany, June 17-19, 2015, revised papers. (2016)

• Record Type: Book
• Further Information: Note: Ernst W. Mayr (ed.).
• Editors: Mayr, Ernst
• Other Names: International Workshop WG, 41st
• Contents: Invited Talks -- Parameterized Algorithmics for Graph Modification Problems: On Interactions with Heuristics -- Open Problems on Graph Coloring for Special Graph Classes -- On the Complexity of Approximation and Online Scheduling Problems with Applications to Optical Networks -- Computational Complexity -- The Stable Fixtures Problem with Payments -- Complexity of Secure Sets -- Efficient Domination for Some Subclasses of P6-free Graphs in Polynomial Time -- On the Tree Search Problem with Non-uniform Costs -- An O(n2) Time Algorithm for the Minimal Permutation Completion Problem -- On the Number of Minimal Separators in Graphs -- Efficient Farthest-Point Queries in Two-terminal Series-parallel Networks -- A Polynomial Delay Algorithm for Enumerating Minimal Dominating Sets in Chordal Graphs -- Finding Paths in Grids with Forbidden Transitions -- The Maximum Time of 2-neighbour Bootstrap Percolation in Grid Graphs and Parametrized Results -- Design and Analysis -- Minimum Eccentricity Shortest Paths in Some Structured Graph Classes -- Approximating Source Location and Star Survivable Network Problems -- On the Complexity of Computing the k-restricted Edge-connectivity of a Graph -- Computational Geometry -- Weak Unit Disk and Interval Representation of Graphs -- Simultaneous Visibility Representations of Plane st-graphs Using L-shapes -- An Abstract Approach to Polychromatic Coloring: Shallow Hitting Sets in ABA-free Hypergraphs and Pseudohalfplanes -- Unsplittable Coverings in the Plane -- Structural Graph Theory -- Induced Minor Free Graphs: Isomorphism and Clique-width -- On the Complexity of Probe and Sandwich Problems for Generalized Threshold Graphs -- Colouring and Covering Nowhere Dense Graphs -- Parity Linkage and the Erdös-Pósa Property of Odd Cycles Through Prescribed Vertices in Highly Connected Graphs -- Well-quasi-ordering Does Not Imply Bounded Clique-width -- A Slice Theoretic Approach for Embedding Problems on Digraphs -- Decomposition Theorems for Square-free 2-matchings in Bipartite Graphs -- Graph Drawing -- Saturated Simple and 2-simple Topological Graphs with Few Edges -- Testing Full Outer-2-planarity in Linear Time -- Fixed Parameter Tractability -- Triangulating Planar Graphs While Keeping the Pathwidth Small -- Polynomial Kernelization for Removing Induced Claws and Diamonds -- Algorithms and Complexity for Metric Dimension and Location-domination on Interval and Permutation Graphs -- On Structural Parameterizations of Hitting Set: Hitting Paths in Graphs Using 2-SAT -- Recognizing k-equistable Graphs in FPT Time -- Beyond Classes of Graphs with \Few" Minimal Separators: FPT -- Results Through Potential Maximal Cliques.
• Publisher Details: Berlin : Springer
• Publication Date: 2016
• Extent: 1 online resource (xiv, 514 pages)
• Subjects: 003/.72; Graph theory -- Data processing -- Congresses; Computer science -- Congresses; Computer science; Graph theory -- Data processing; Computer Science; Discrete Mathematics in Computer Science; Algorithm Analysis and Problem Complexity; Data Structures; Computer Graphics; Geometry; Algorithms; Electronic books; Electronic books; Conference papers and proceedings
• Languages: English
• ISBNs: 9783662531747; 3662531747; 3662531739; 9783662531730
• Related ISBNs: 9783662531730
• Notes: Note: Online resource; title from PDF title page (SpringerLink, viewed August 10, 2016).
• Access Rights: Legal Deposit; Only available on premises controlled by the deposit library and to one user at any one time; The Legal Deposit Libraries (Non-Print Works) Regulations (UK).
• Access Usage: Restricted: Printing from this resource is governed by The Legal Deposit Libraries (Non-Print Works) Regulations (UK) and UK copyright law currently in force.