Coverart for item
The Resource Graph-theoretic concepts in computer science : 41st International Workshop, WG 2015 Garching, Germany, June 17-19, 2015, revised papers, Ernst W. Mayr (ed.), (electronic book)

Graph-theoretic concepts in computer science : 41st International Workshop, WG 2015 Garching, Germany, June 17-19, 2015, revised papers, Ernst W. Mayr (ed.), (electronic book)

Label
Graph-theoretic concepts in computer science : 41st International Workshop, WG 2015 Garching, Germany, June 17-19, 2015, revised papers
Title
Graph-theoretic concepts in computer science
Title remainder
41st International Workshop, WG 2015 Garching, Germany, June 17-19, 2015, revised papers
Statement of responsibility
Ernst W. Mayr (ed.)
Creator
Contributor
Editor
Subject
Genre
Language
eng
Summary
This book constitutes revised selected papers from the 41st International Workshop on Graph-Theoretic 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.
Member of
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
Graph-theoretic concepts in computer science : 41st International Workshop, WG 2015 Garching, Germany, June 17-19, 2015, revised papers, Ernst W. Mayr (ed.), (electronic book)
Instantiates
Publication
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 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
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/978-3-662-53174-7
Quality assurance targets
unknown
Reformatting quality
unknown
Specific material designation
remote
Label
Graph-theoretic concepts in computer science : 41st International Workshop, WG 2015 Garching, Germany, June 17-19, 2015, revised papers, Ernst W. Mayr (ed.), (electronic book)
Publication
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 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
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/978-3-662-53174-7
Quality assurance targets
unknown
Reformatting quality
unknown
Specific material designation
remote

Library Locations

Processing Feedback ...