000 05213nam a22005895i 4500
001 978-3-662-53174-7
003 DE-He213
005 20200421111200.0
007 cr nn 008mamaa
008 160804s2016 gw | s |||| 0|eng d
020 _a9783662531747
_9978-3-662-53174-7
024 7 _a10.1007/978-3-662-53174-7
_2doi
050 4 _aQA76.9.M35
072 7 _aPBD
_2bicssc
072 7 _aUYAM
_2bicssc
072 7 _aCOM018000
_2bisacsh
072 7 _aMAT008000
_2bisacsh
082 0 4 _a004.0151
_223
245 1 0 _aGraph-Theoretic Concepts in Computer Science
_h[electronic resource] :
_b41st International Workshop, WG 2015, Garching, Germany, June 17-19, 2015, Revised Papers /
_cedited by Ernst W. Mayr.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2016.
300 _aXIV, 514 p. 106 illus.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v9224
505 0 _aInvited 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�os-P�osa 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.
520 _aThis 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. .
650 0 _aComputer science.
650 0 _aData structures (Computer science).
650 0 _aAlgorithms.
650 0 _aComputer science
_xMathematics.
650 0 _aComputer graphics.
650 0 _aGeometry.
650 1 4 _aComputer Science.
650 2 4 _aDiscrete Mathematics in Computer Science.
650 2 4 _aAlgorithm Analysis and Problem Complexity.
650 2 4 _aData Structures.
650 2 4 _aComputer Graphics.
650 2 4 _aGeometry.
650 2 4 _aAlgorithms.
700 1 _aMayr, Ernst W.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783662531730
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v9224
856 4 0 _uhttp://dx.doi.org/10.1007/978-3-662-53174-7
912 _aZDB-2-SCS
912 _aZDB-2-LNC
942 _cEBK
999 _c53797
_d53797