Borrow it
 African Studies Library
 Alumni Medical Library
 Astronomy Library
 Fineman and Pappas Law Libraries
 Frederick S. Pardee Management Library
 Howard Gotlieb Archival Research Center
 Mugar Memorial Library
 Music Library
 Pikering Educational Resources Library
 School of Theology Library
 Science & Engineering Library
 Stone Science Library
The Resource Graphtheoretic concepts in computer science : 39th International Workshop, WG 2013, Lübeck, Germany, June 1921, 2013, Revised Papers, Andreas Brandstädt, Klaus Jansen, Rüdiger Reischuk (eds.)
Graphtheoretic concepts in computer science : 39th International Workshop, WG 2013, Lübeck, Germany, June 1921, 2013, Revised Papers, Andreas Brandstädt, Klaus Jansen, Rüdiger Reischuk (eds.)
Resource Information
The item Graphtheoretic concepts in computer science : 39th International Workshop, WG 2013, Lübeck, Germany, June 1921, 2013, Revised Papers, Andreas Brandstädt, Klaus Jansen, Rüdiger Reischuk (eds.) represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in Boston University Libraries.This item is available to borrow from all library branches.
Resource Information
The item Graphtheoretic concepts in computer science : 39th International Workshop, WG 2013, Lübeck, Germany, June 1921, 2013, Revised Papers, Andreas Brandstädt, Klaus Jansen, Rüdiger Reischuk (eds.) represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in Boston University Libraries.
This item is available to borrow from all library branches.
 Summary
 This book constitutes the thoroughly refereed proceedings of the 39th International Workshop on Graph Theoretic Concepts in Computer Science, WG 2013, held in Lübeck, Germany, in June 2013. The 34 revised full papers presented were carefully reviewed and selected from 61 submissions. The book also includes two abstracts. The papers cover a wide range of topics in graph theory related to computer science, such as structural graph theory with algorithmic or complexity applications; design and analysis of sequential, parallel, randomized, parameterized and distributed graph and network algorithms; computational complexity of graph and network problems; computational geometry; graph grammars, graph rewriting systems and graph modeling; graph drawing and layouts; random graphs and models of the web and scalefree networks; and support of these concepts by suitable implementations and applications
 Language
 eng
 Extent
 1 online resource (xx, 430 pages)
 Note
 Includes author index
 Contents

 TreeLike Structures in Graphs: A Metric Point of View
 Overview of New Approaches for Approximating TSP
 Linear RankWidth and Linear CliqueWidth of Trees
 ThresholdColoring and UnitCube Contact Representation of Graphs
 Rolling Upward Planarity Testing of Strongly Connected Graphs
 Towards a Provably Resilient Scheme for GraphBased Watermarking
 The Normal Graph Conjecture for Classes of Sparse Graphs
 On the Parameterized Complexity of Computing Graph Bisections
 FixedParameter Tractability and Characterizations of Small Special Treewidth
 The θ5Graph is a Spanner
 Graphs of EdgeIntersecting Nonsplitting Paths in a Tree: Towards Hole Representations (Extended Abstract)
 LinearTime Algorithms for Scattering Number and HamiltonConnectivity of Interval Graphs
 Equilateral LContact Graphs
 Parameterized and Approximation Algorithms for the MAF Problem in Multifurcating Trees
 Linear Separation of Total Dominating Sets in Graphs
 Sparse Square Roots
 Completing Colored Graphs to Meet a Target Property
 Colouring of Graphs with RamseyType Forbidden Subgraphs
 Lower and Upper Bounds for Long Induced Paths in 3Connected Planar Graphs
 Computing Minimum Cycle Bases in Weighted Partial 2Trees in Linear Time
 Thickness and Colorability of Geometric Graphs
 The Same Upper Bound for Both: The 2Page and the Rectilinear Crossing Numbers of the nCube
 FPT Is Characterized by Useful Obstruction Sets
 Excluding Graphs as Immersions in Surface Embedded
 OBDDBased Representation of Interval Graphs
 Tight Upper Bounds for Minimum Feedback Arc Sets of Regular
 A LinearTime Kernelization for the Rooted kLeaf Outbranching Problem
 On Retracts, Absolute Retracts, and Folds in Cographs
 Coloring TriangleFree Rectangular Frame Intersection Graphs with O(log log n) Colors
 On Finding Tucker Submatrices and LekkerkerkerBoland Subgraphs
 Certifying 3EdgeConnectivity
 Parameterized Algorithms for Max Colorable Induced Subgraph Problem on Perfect Graphs
 Characterizing and Computing the Structure of Clique Intersections in Strongly Chordal Graphs
 Beyond Knights and Knaves
 Drawing Graphs with Few Arcs
 Connecting Terminals and 2Disjoint Connected Subgraphs
 Isbn
 9783642450426
 Label
 Graphtheoretic concepts in computer science : 39th International Workshop, WG 2013, Lübeck, Germany, June 1921, 2013, Revised Papers
 Title
 Graphtheoretic concepts in computer science
 Title remainder
 39th International Workshop, WG 2013, Lübeck, Germany, June 1921, 2013, Revised Papers
 Statement of responsibility
 Andreas Brandstädt, Klaus Jansen, Rüdiger Reischuk (eds.)
 Title variation
 WG 2013
 Subject

 Computer Science
 Computer science
 Computer science  Congresses
 Computer science  Congresses
 Computer science  Congresses
 Computers  Congresses
 Computers  Congresses
 Conference proceedings
 Discrete Mathematics in Computer Science
 Electronic Data Processing  Congresses
 Electronic Data Processing  Congresses
 Electronic resources
 Geometry
 Graph theory  Data processing
 Graph theory  Data processing  Congresses
 Graph theory  Data processing  Congresses
 Graph theory  Data processing  Congresses
 Algorithm Analysis and Problem Complexity
 Language
 eng
 Summary
 This book constitutes the thoroughly refereed proceedings of the 39th International Workshop on Graph Theoretic Concepts in Computer Science, WG 2013, held in Lübeck, Germany, in June 2013. The 34 revised full papers presented were carefully reviewed and selected from 61 submissions. The book also includes two abstracts. The papers cover a wide range of topics in graph theory related to computer science, such as structural graph theory with algorithmic or complexity applications; design and analysis of sequential, parallel, randomized, parameterized and distributed graph and network algorithms; computational complexity of graph and network problems; computational geometry; graph grammars, graph rewriting systems and graph modeling; graph drawing and layouts; random graphs and models of the web and scalefree networks; and support of these concepts by suitable implementations and applications
 Cataloging source
 GW5XE
 Image bit depth
 0
 LC call number
 QA166
 LC item number
 .C66 2013
 Literary form
 non fiction
 http://bibfra.me/vocab/lite/meetingDate
 2013
 http://bibfra.me/vocab/lite/meetingName
 International Workshop WG
 Nature of contents
 dictionaries
 NLM call number
 QA 267.G47
 http://library.link/vocab/relatedWorkOrContributorName

 SpringerLink
 Brandstädt, Andreas
 Jansen, Klaus
 Reischuk, Rüdiger
 Series statement
 Lecture Notes in Computer Science,
 Series volume
 8165
 http://library.link/vocab/subjectName

 Graph theory
 Computer science
 Computers
 Electronic Data Processing
 Computer Science
 Discrete Mathematics in Computer Science
 Algorithm Analysis and Problem Complexity
 Geometry
 Computer science
 Graph theory
 Label
 Graphtheoretic concepts in computer science : 39th International Workshop, WG 2013, Lübeck, Germany, June 1921, 2013, Revised Papers, Andreas Brandstädt, Klaus Jansen, Rüdiger Reischuk (eds.)
 Note
 Includes author index
 Antecedent source
 mixed
 Carrier category
 online resource
 Carrier category code

 cr
 Carrier MARC source
 rdacarrier
 Color
 not applicable
 Content category
 text
 Content type code

 txt
 Content type MARC source
 rdacontent
 Contents
 TreeLike Structures in Graphs: A Metric Point of View  Overview of New Approaches for Approximating TSP  Linear RankWidth and Linear CliqueWidth of Trees  ThresholdColoring and UnitCube Contact Representation of Graphs  Rolling Upward Planarity Testing of Strongly Connected Graphs  Towards a Provably Resilient Scheme for GraphBased Watermarking  The Normal Graph Conjecture for Classes of Sparse Graphs  On the Parameterized Complexity of Computing Graph Bisections  FixedParameter Tractability and Characterizations of Small Special Treewidth  The θ5Graph is a Spanner  Graphs of EdgeIntersecting Nonsplitting Paths in a Tree: Towards Hole Representations (Extended Abstract)  LinearTime Algorithms for Scattering Number and HamiltonConnectivity of Interval Graphs  Equilateral LContact Graphs  Parameterized and Approximation Algorithms for the MAF Problem in Multifurcating Trees  Linear Separation of Total Dominating Sets in Graphs  Sparse Square Roots  Completing Colored Graphs to Meet a Target Property  Colouring of Graphs with RamseyType Forbidden Subgraphs  Lower and Upper Bounds for Long Induced Paths in 3Connected Planar Graphs  Computing Minimum Cycle Bases in Weighted Partial 2Trees in Linear Time  Thickness and Colorability of Geometric Graphs  The Same Upper Bound for Both: The 2Page and the Rectilinear Crossing Numbers of the nCube  FPT Is Characterized by Useful Obstruction Sets  Excluding Graphs as Immersions in Surface Embedded  OBDDBased Representation of Interval Graphs  Tight Upper Bounds for Minimum Feedback Arc Sets of Regular  A LinearTime Kernelization for the Rooted kLeaf Outbranching Problem  On Retracts, Absolute Retracts, and Folds in Cographs  Coloring TriangleFree Rectangular Frame Intersection Graphs with O(log log n) Colors  On Finding Tucker Submatrices and LekkerkerkerBoland Subgraphs  Certifying 3EdgeConnectivity  Parameterized Algorithms for Max Colorable Induced Subgraph Problem on Perfect Graphs  Characterizing and Computing the Structure of Clique Intersections in Strongly Chordal Graphs  Beyond Knights and Knaves  Drawing Graphs with Few Arcs  Connecting Terminals and 2Disjoint Connected Subgraphs
 Dimensions
 unknown
 Extent
 1 online resource (xx, 430 pages)
 File format
 multiple file formats
 Form of item

 online
 electronic
 Isbn
 9783642450426
 Level of compression
 uncompressed
 Media category
 computer
 Media MARC source
 rdamedia
 Media type code

 c
 Other control number
 10.1007/9783642450433
 Other physical details
 illustrations.
 Quality assurance targets
 absent
 Reformatting quality
 access
 Specific material designation
 remote
 System control number

 (OCoLC)867773812
 (OCoLC)ocn867773812
 Label
 Graphtheoretic concepts in computer science : 39th International Workshop, WG 2013, Lübeck, Germany, June 1921, 2013, Revised Papers, Andreas Brandstädt, Klaus Jansen, Rüdiger Reischuk (eds.)
 Note
 Includes author index
 Antecedent source
 mixed
 Carrier category
 online resource
 Carrier category code

 cr
 Carrier MARC source
 rdacarrier
 Color
 not applicable
 Content category
 text
 Content type code

 txt
 Content type MARC source
 rdacontent
 Contents
 TreeLike Structures in Graphs: A Metric Point of View  Overview of New Approaches for Approximating TSP  Linear RankWidth and Linear CliqueWidth of Trees  ThresholdColoring and UnitCube Contact Representation of Graphs  Rolling Upward Planarity Testing of Strongly Connected Graphs  Towards a Provably Resilient Scheme for GraphBased Watermarking  The Normal Graph Conjecture for Classes of Sparse Graphs  On the Parameterized Complexity of Computing Graph Bisections  FixedParameter Tractability and Characterizations of Small Special Treewidth  The θ5Graph is a Spanner  Graphs of EdgeIntersecting Nonsplitting Paths in a Tree: Towards Hole Representations (Extended Abstract)  LinearTime Algorithms for Scattering Number and HamiltonConnectivity of Interval Graphs  Equilateral LContact Graphs  Parameterized and Approximation Algorithms for the MAF Problem in Multifurcating Trees  Linear Separation of Total Dominating Sets in Graphs  Sparse Square Roots  Completing Colored Graphs to Meet a Target Property  Colouring of Graphs with RamseyType Forbidden Subgraphs  Lower and Upper Bounds for Long Induced Paths in 3Connected Planar Graphs  Computing Minimum Cycle Bases in Weighted Partial 2Trees in Linear Time  Thickness and Colorability of Geometric Graphs  The Same Upper Bound for Both: The 2Page and the Rectilinear Crossing Numbers of the nCube  FPT Is Characterized by Useful Obstruction Sets  Excluding Graphs as Immersions in Surface Embedded  OBDDBased Representation of Interval Graphs  Tight Upper Bounds for Minimum Feedback Arc Sets of Regular  A LinearTime Kernelization for the Rooted kLeaf Outbranching Problem  On Retracts, Absolute Retracts, and Folds in Cographs  Coloring TriangleFree Rectangular Frame Intersection Graphs with O(log log n) Colors  On Finding Tucker Submatrices and LekkerkerkerBoland Subgraphs  Certifying 3EdgeConnectivity  Parameterized Algorithms for Max Colorable Induced Subgraph Problem on Perfect Graphs  Characterizing and Computing the Structure of Clique Intersections in Strongly Chordal Graphs  Beyond Knights and Knaves  Drawing Graphs with Few Arcs  Connecting Terminals and 2Disjoint Connected Subgraphs
 Dimensions
 unknown
 Extent
 1 online resource (xx, 430 pages)
 File format
 multiple file formats
 Form of item

 online
 electronic
 Isbn
 9783642450426
 Level of compression
 uncompressed
 Media category
 computer
 Media MARC source
 rdamedia
 Media type code

 c
 Other control number
 10.1007/9783642450433
 Other physical details
 illustrations.
 Quality assurance targets
 absent
 Reformatting quality
 access
 Specific material designation
 remote
 System control number

 (OCoLC)867773812
 (OCoLC)ocn867773812
Subject
 Computer Science
 Computer science
 Computer science  Congresses
 Computer science  Congresses
 Computer science  Congresses
 Computers  Congresses
 Computers  Congresses
 Conference proceedings
 Discrete Mathematics in Computer Science
 Electronic Data Processing  Congresses
 Electronic Data Processing  Congresses
 Electronic resources
 Geometry
 Graph theory  Data processing
 Graph theory  Data processing  Congresses
 Graph theory  Data processing  Congresses
 Graph theory  Data processing  Congresses
 Algorithm Analysis and Problem Complexity
Genre
Member of
Library Locations

African Studies LibraryBorrow it771 Commonwealth Avenue, 6th Floor, Boston, MA, 02215, US42.350723 71.108227


Astronomy LibraryBorrow it725 Commonwealth Avenue, 6th Floor, Boston, MA, 02445, US42.350259 71.105717

Fineman and Pappas Law LibrariesBorrow it765 Commonwealth Avenue, Boston, MA, 02215, US42.350979 71.107023

Frederick S. Pardee Management LibraryBorrow it595 Commonwealth Avenue, Boston, MA, 02215, US42.349626 71.099547

Howard Gotlieb Archival Research CenterBorrow it771 Commonwealth Avenue, 5th Floor, Boston, MA, 02215, US42.350723 71.108227


Music LibraryBorrow it771 Commonwealth Avenue, 2nd Floor, Boston, MA, 02215, US42.350723 71.108227

Pikering Educational Resources LibraryBorrow it2 Silber Way, Boston, MA, 02215, US42.349804 71.101425

School of Theology LibraryBorrow it745 Commonwealth Avenue, 2nd Floor, Boston, MA, 02215, US42.350494 71.107235

Science & Engineering LibraryBorrow it38 Cummington Mall, Boston, MA, 02215, US42.348472 71.102257

Embed
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.bu.edu/portal/Graphtheoreticconceptsincomputerscience/myyqvdu15Q8/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.bu.edu/portal/Graphtheoreticconceptsincomputerscience/myyqvdu15Q8/">Graphtheoretic concepts in computer science : 39th International Workshop, WG 2013, Lübeck, Germany, June 1921, 2013, Revised Papers, Andreas Brandstädt, Klaus Jansen, Rüdiger Reischuk (eds.)</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.bu.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.bu.edu/">Boston University Libraries</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 : 39th International Workshop, WG 2013, Lübeck, Germany, June 1921, 2013, Revised Papers, Andreas Brandstädt, Klaus Jansen, Rüdiger Reischuk (eds.)
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.bu.edu/portal/Graphtheoreticconceptsincomputerscience/myyqvdu15Q8/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.bu.edu/portal/Graphtheoreticconceptsincomputerscience/myyqvdu15Q8/">Graphtheoretic concepts in computer science : 39th International Workshop, WG 2013, Lübeck, Germany, June 1921, 2013, Revised Papers, Andreas Brandstädt, Klaus Jansen, Rüdiger Reischuk (eds.)</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.bu.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.bu.edu/">Boston University Libraries</a></span></span></span></span></div>