The Resource Graphtheoretic concepts in computer science : 41st International Workshop, WG 2015 Garching, Germany, June 1719, 2015, revised papers, Ernst W. Mayr (ed.), (electronic book)
Graphtheoretic concepts in computer science : 41st International Workshop, WG 2015 Garching, Germany, June 1719, 2015, revised papers, Ernst W. Mayr (ed.), (electronic book)
Resource Information
The item Graphtheoretic concepts in computer science : 41st International Workshop, WG 2015 Garching, Germany, June 1719, 2015, revised papers, Ernst W. Mayr (ed.), (electronic book) represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in University of Liverpool.This item is available to borrow from 1 library branch.
Resource Information
The item Graphtheoretic concepts in computer science : 41st International Workshop, WG 2015 Garching, Germany, June 1719, 2015, revised papers, Ernst W. Mayr (ed.), (electronic book) represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in University of Liverpool.
This item is available to borrow from 1 library branch.
 Summary
 This book constitutes revised selected papers from the 41st International Workshop on GraphTheoretic Concepts in Computer Science, WG 2015, held in Garching, Germany, in June 2015. The 32 papers presented in this volume were carefully reviewed and selected from 79 submissions. They were organized in topical sections named: invited talks; computational complexity; design and analysis; computational geometry; structural graph theory; graph drawing; and fixed parameter tractability.
 Language
 eng
 Extent
 1 online resource (xiv, 514 pages).
 Note
 Includes index
 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 P6free Graphs in Polynomial Time
 On the Tree Search Problem with Nonuniform Costs
 An O(n2) Time Algorithm for the Minimal Permutation Completion Problem
 On the Number of Minimal Separators in Graphs
 Efficient FarthestPoint Queries in Twoterminal Seriesparallel Networks
 A Polynomial Delay Algorithm for Enumerating Minimal Dominating Sets in Chordal Graphs
 Finding Paths in Grids with Forbidden Transitions
 The Maximum Time of 2neighbour 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 krestricted Edgeconnectivity of a Graph
 Computational Geometry
 Weak Unit Disk and Interval Representation of Graphs
 Simultaneous Visibility Representations of Plane stgraphs Using Lshapes
 An Abstract Approach to Polychromatic Coloring: Shallow Hitting Sets in ABAfree Hypergraphs and Pseudohalfplanes
 Unsplittable Coverings in the Plane
 Structural Graph Theory
 Induced Minor Free Graphs: Isomorphism and Cliquewidth
 On the Complexity of Probe and Sandwich Problems for Generalized Threshold Graphs
 Colouring and Covering Nowhere Dense Graphs
 Parity Linkage and the ErdösPósa Property of Odd Cycles Through Prescribed Vertices in Highly Connected Graphs
 Wellquasiordering Does Not Imply Bounded Cliquewidth
 A Slice Theoretic Approach for Embedding Problems on Digraphs
 Decomposition Theorems for Squarefree 2matchings in Bipartite Graphs
 Graph Drawing
 Saturated Simple and 2simple Topological Graphs with Few Edges
 Testing Full Outer2planarity 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 Locationdomination on Interval and Permutation Graphs
 On Structural Parameterizations of Hitting Set: Hitting Paths in Graphs Using 2SAT
 Recognizing kequistable Graphs in FPT Time
 Beyond Classes of Graphs with \Few" Minimal Separators: FPT
 Results Through Potential Maximal Cliques
 Isbn
 9783662531747
 Label
 Graphtheoretic concepts in computer science : 41st International Workshop, WG 2015 Garching, Germany, June 1719, 2015, revised papers
 Title
 Graphtheoretic concepts in computer science
 Title remainder
 41st International Workshop, WG 2015 Garching, Germany, June 1719, 2015, revised papers
 Statement of responsibility
 Ernst W. Mayr (ed.)
 Language
 eng
 Summary
 This book constitutes revised selected papers from the 41st International Workshop on GraphTheoretic Concepts in Computer Science, WG 2015, held in Garching, Germany, in June 2015. The 32 papers presented in this volume were carefully reviewed and selected from 79 submissions. They were organized in topical sections named: invited talks; computational complexity; design and analysis; computational geometry; structural graph theory; graph drawing; and fixed parameter tractability.
 Cataloging source
 GW5XE
 Dewey number
 003/.72
 Index
 index present
 LC call number
 QA166
 Literary form
 non fiction
 http://bibfra.me/vocab/lite/meetingDate
 2015
 http://bibfra.me/vocab/lite/meetingName
 International Workshop WG
 Nature of contents
 dictionaries
 http://library.link/vocab/relatedWorkOrContributorName
 Mayr, Ernst
 Series statement

 Lecture notes in computer science,
 Advanced research in computing and software science
 LNCS sublibrary. SL 1, Theoretical computer science and general issues
 Series volume
 9224
 http://library.link/vocab/subjectName

 Graph theory
 Computer science
 Computer Science
 Discrete Mathematics in Computer Science
 Algorithm Analysis and Problem Complexity
 Data Structures
 Computer Graphics
 Geometry
 Algorithms
 Label
 Graphtheoretic concepts in computer science : 41st International Workshop, WG 2015 Garching, Germany, June 1719, 2015, revised papers, Ernst W. Mayr (ed.), (electronic book)
 Note
 Includes index
 Antecedent source
 file reproduced from an electronic resource
 Carrier category
 online resource
 Carrier category code
 cr
 Carrier MARC source
 rdacarrier
 Color
 black and white
 Content category
 text
 Content type code
 txt
 Content type MARC source
 rdacontent
 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 P6free Graphs in Polynomial Time  On the Tree Search Problem with Nonuniform Costs  An O(n2) Time Algorithm for the Minimal Permutation Completion Problem  On the Number of Minimal Separators in Graphs  Efficient FarthestPoint Queries in Twoterminal Seriesparallel Networks  A Polynomial Delay Algorithm for Enumerating Minimal Dominating Sets in Chordal Graphs  Finding Paths in Grids with Forbidden Transitions  The Maximum Time of 2neighbour 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 krestricted Edgeconnectivity of a Graph  Computational Geometry  Weak Unit Disk and Interval Representation of Graphs  Simultaneous Visibility Representations of Plane stgraphs Using Lshapes  An Abstract Approach to Polychromatic Coloring: Shallow Hitting Sets in ABAfree Hypergraphs and Pseudohalfplanes  Unsplittable Coverings in the Plane  Structural Graph Theory  Induced Minor Free Graphs: Isomorphism and Cliquewidth  On the Complexity of Probe and Sandwich Problems for Generalized Threshold Graphs  Colouring and Covering Nowhere Dense Graphs  Parity Linkage and the ErdösPósa Property of Odd Cycles Through Prescribed Vertices in Highly Connected Graphs  Wellquasiordering Does Not Imply Bounded Cliquewidth  A Slice Theoretic Approach for Embedding Problems on Digraphs  Decomposition Theorems for Squarefree 2matchings in Bipartite Graphs  Graph Drawing  Saturated Simple and 2simple Topological Graphs with Few Edges  Testing Full Outer2planarity 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 Locationdomination on Interval and Permutation Graphs  On Structural Parameterizations of Hitting Set: Hitting Paths in Graphs Using 2SAT  Recognizing kequistable Graphs in FPT Time  Beyond Classes of Graphs with \Few" Minimal Separators: FPT  Results Through Potential Maximal Cliques
 Control code
 SPR956427552
 Dimensions
 unknown
 Extent
 1 online resource (xiv, 514 pages).
 File format
 one file format
 Form of item
 online
 Isbn
 9783662531747
 Level of compression
 unknown
 Media category
 computer
 Media MARC source
 rdamedia
 Media type code
 c
 Other control number
 10.1007/9783662531747
 Quality assurance targets
 unknown
 Reformatting quality
 unknown
 Specific material designation
 remote
 Label
 Graphtheoretic concepts in computer science : 41st International Workshop, WG 2015 Garching, Germany, June 1719, 2015, revised papers, Ernst W. Mayr (ed.), (electronic book)
 Note
 Includes index
 Antecedent source
 file reproduced from an electronic resource
 Carrier category
 online resource
 Carrier category code
 cr
 Carrier MARC source
 rdacarrier
 Color
 black and white
 Content category
 text
 Content type code
 txt
 Content type MARC source
 rdacontent
 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 P6free Graphs in Polynomial Time  On the Tree Search Problem with Nonuniform Costs  An O(n2) Time Algorithm for the Minimal Permutation Completion Problem  On the Number of Minimal Separators in Graphs  Efficient FarthestPoint Queries in Twoterminal Seriesparallel Networks  A Polynomial Delay Algorithm for Enumerating Minimal Dominating Sets in Chordal Graphs  Finding Paths in Grids with Forbidden Transitions  The Maximum Time of 2neighbour 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 krestricted Edgeconnectivity of a Graph  Computational Geometry  Weak Unit Disk and Interval Representation of Graphs  Simultaneous Visibility Representations of Plane stgraphs Using Lshapes  An Abstract Approach to Polychromatic Coloring: Shallow Hitting Sets in ABAfree Hypergraphs and Pseudohalfplanes  Unsplittable Coverings in the Plane  Structural Graph Theory  Induced Minor Free Graphs: Isomorphism and Cliquewidth  On the Complexity of Probe and Sandwich Problems for Generalized Threshold Graphs  Colouring and Covering Nowhere Dense Graphs  Parity Linkage and the ErdösPósa Property of Odd Cycles Through Prescribed Vertices in Highly Connected Graphs  Wellquasiordering Does Not Imply Bounded Cliquewidth  A Slice Theoretic Approach for Embedding Problems on Digraphs  Decomposition Theorems for Squarefree 2matchings in Bipartite Graphs  Graph Drawing  Saturated Simple and 2simple Topological Graphs with Few Edges  Testing Full Outer2planarity 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 Locationdomination on Interval and Permutation Graphs  On Structural Parameterizations of Hitting Set: Hitting Paths in Graphs Using 2SAT  Recognizing kequistable Graphs in FPT Time  Beyond Classes of Graphs with \Few" Minimal Separators: FPT  Results Through Potential Maximal Cliques
 Control code
 SPR956427552
 Dimensions
 unknown
 Extent
 1 online resource (xiv, 514 pages).
 File format
 one file format
 Form of item
 online
 Isbn
 9783662531747
 Level of compression
 unknown
 Media category
 computer
 Media MARC source
 rdamedia
 Media type code
 c
 Other control number
 10.1007/9783662531747
 Quality assurance targets
 unknown
 Reformatting quality
 unknown
 Specific material designation
 remote
Subject
 Algorithm Analysis and Problem Complexity
 Algorithms
 Computer Graphics
 Computer Science
 Computer science  Congresses
 Data Structures
 Discrete Mathematics in Computer Science
 Geometry
 Graph theory  Data processing  Congresses
Genre
Member of
 LNCS sublibrary, SL 1, Theoretical computer science and general issues
 Lecture notes in computer science, 9224.
 Lecture notes in computer science, Advanced research in computing and software science
 Online access with purchase: Springer
Library Links
Embed (Experimental)
Settings
Select options that apply then copy and paste the RDF/HTML data fragment to include in your application
Embed this data in a secure (HTTPS) page:
Layout options:
Include data citation:
<div class="citation" vocab="http://schema.org/"><i class="fa faexternallinksquare fafw"></i> Data from <span resource="http://link.liverpool.ac.uk/portal/Graphtheoreticconceptsincomputerscience/mahFuQ07mo/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.liverpool.ac.uk/portal/Graphtheoreticconceptsincomputerscience/mahFuQ07mo/">Graphtheoretic concepts in computer science : 41st International Workshop, WG 2015 Garching, Germany, June 1719, 2015, revised papers, Ernst W. Mayr (ed.), (electronic book)</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.liverpool.ac.uk/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.liverpool.ac.uk/">University of Liverpool</a></span></span></span></span></div>
Note: Adjust the width and height settings defined in the RDF/HTML code fragment to best match your requirements
Preview
Cite Data  Experimental
Data Citation of the Item Graphtheoretic concepts in computer science : 41st International Workshop, WG 2015 Garching, Germany, June 1719, 2015, revised papers, Ernst W. Mayr (ed.), (electronic book)
Copy and paste the following RDF/HTML data fragment to cite this resource
<div class="citation" vocab="http://schema.org/"><i class="fa faexternallinksquare fafw"></i> Data from <span resource="http://link.liverpool.ac.uk/portal/Graphtheoreticconceptsincomputerscience/mahFuQ07mo/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.liverpool.ac.uk/portal/Graphtheoreticconceptsincomputerscience/mahFuQ07mo/">Graphtheoretic concepts in computer science : 41st International Workshop, WG 2015 Garching, Germany, June 1719, 2015, revised papers, Ernst W. Mayr (ed.), (electronic book)</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.liverpool.ac.uk/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.liverpool.ac.uk/">University of Liverpool</a></span></span></span></span></div>