The Resource Algorithms and Data Structures : 14th International Symposium, WADS 2015, Victoria, BC, Canada, August 57, 2015. Proceedings, edited by Frank Dehne, JörgRüdiger Sack, Ulrike Stege, (electronic book)
Algorithms and Data Structures : 14th International Symposium, WADS 2015, Victoria, BC, Canada, August 57, 2015. Proceedings, edited by Frank Dehne, JörgRüdiger Sack, Ulrike Stege, (electronic book)
Resource Information
The item Algorithms and Data Structures : 14th International Symposium, WADS 2015, Victoria, BC, Canada, August 57, 2015. Proceedings, edited by Frank Dehne, JörgRüdiger Sack, Ulrike Stege, (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 Algorithms and Data Structures : 14th International Symposium, WADS 2015, Victoria, BC, Canada, August 57, 2015. Proceedings, edited by Frank Dehne, JörgRüdiger Sack, Ulrike Stege, (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 the refereed proceedings of the 14th Algorithms and Data Structures Symposium, WADS 2015, held in Victoria, BC, Canada, August 2015. The 54 revised full papers presented in this volume were carefully reviewed and selected from 148 submissions. The Algorithms and Data Structures Symposium  WADS (formerly Workshop on Algorithms And Data Structures), which alternates with the Scandinavian Workshop on Algorithm Theory, is intended as a forum for researchers in the area of design and analysis of algorithms and data structures. WADS includes papers presenting original research on algorithms and data structures in all areas, including bioinformatics, combinatorics, computational geometry, databases, graphics, and parallel and distributed computing
 Language
 eng
 Extent
 XIII, 646 p. 125 illus.
 Contents

 Contact Graphs of Circular Arcs
 Contact Representations of Graphs in 3D
 Minimizing the Aggregate Movements for Interval Coverage
 Online Bin Packing with Advice of Small Size
 On the Approximability of Orthogonal Order Preserving Layout Adjustment
 An Optimal Algorithm for Plane Matchings in Multipartite Geometric Graphs
 Generation of Colourings and Distinguishing Colourings of Graphs
 Strictly Implicit Priority Queues: On the Number of Moves and WorstCase Time
 On CoctFree MultiColoring
 Semidynamic connectivity in the plane
 Interval Selection in the Streaming Model
 On the BoundedHop Range Assignment Problem
 Greedy Is an Almost Optimal Deque
 A New Approach for Contact Graph Representations and Its Applications
 Communication and Dynamic Networks
 Dealing With 4Variables by Resolution: An Improved MaxSAT Algorithm
 Select with Groups of 3 or 4 Approximating Nearest Neighbor Distances
 Linearity is Strictly More Powerful than Contiguity for Encoding Graphs
 On the Complexity of an Unregulated Traffic Crossing
 Finding Pairwise Intersections Inside a Query Range
 CacheOblivious Iterated Predecessor Queries via Range Coalescing
 Polylogarithmic Fully Retroactive Priority Queues
 On the Minimum Eccentricity Shortest Path Problem
 Convex polygons in geometric triangulations
 Straightline Drawability of a Planar Graph Plus an Edge
 Solving Problems on Graphs of High RankWidth
 The Parametric Closure Problem
 Rooted Cycle Bases
 On the Chain Pair Simplification Problem
 Finding Articulation Points of Large Graphs in Linear Time
 LPbased Approximation Algorithms for Facility Location in BuyatBulk Network Design
 Universal Reconstruction of a String
 The complexity of dominating set reconfiguration
 Editing Graphs into Few Cliques: Complexity, Approximation, and Kernelization Schemes
 Competitive Diffusion on Weighted Graphs
 Sorting and Selection with Equality Comparisons
 Polynomial Delay Algorithm for Listing Minimal Edge Dominating sets in Graphs
 Fast and simple connectivity in graph timelines
 Dynamic Set Intersection
 TimeSpace Tradeof is for Triangulations and Voronoi Diagrams
 A 2kVertex Kernel for Maximum Internal Spanning Tree
 Reconfiguration on sparse graphs
 Smoothed Analysis of Local Search Algorithms
 Optimal Shue Code with Permutation Instructions
 NonPreemptive Scheduling on Machines with Setup Times
 A Moderately Exponential Time Algorithm for k IBDD Satisfiability
 On the Parameterized Complexity of Girth and Connectivity Problems on Linear Matroids
 Inferring People's Social Behavior by Exploiting Their Spatiotemporal Location Data
 lastic Geometric Shape Matching for Point Sets under Translations
 Constant Time Enumeration by Amortization
 Computing the Center of Uncertain Points on Tree Networks
 Swapping Colored Tokens on Graphs
 Isbn
 9783319218403
 Label
 Algorithms and Data Structures : 14th International Symposium, WADS 2015, Victoria, BC, Canada, August 57, 2015. Proceedings
 Title
 Algorithms and Data Structures
 Title remainder
 14th International Symposium, WADS 2015, Victoria, BC, Canada, August 57, 2015. Proceedings
 Statement of responsibility
 edited by Frank Dehne, JörgRüdiger Sack, Ulrike Stege
 Language
 eng
 Summary
 This book constitutes the refereed proceedings of the 14th Algorithms and Data Structures Symposium, WADS 2015, held in Victoria, BC, Canada, August 2015. The 54 revised full papers presented in this volume were carefully reviewed and selected from 148 submissions. The Algorithms and Data Structures Symposium  WADS (formerly Workshop on Algorithms And Data Structures), which alternates with the Scandinavian Workshop on Algorithm Theory, is intended as a forum for researchers in the area of design and analysis of algorithms and data structures. WADS includes papers presenting original research on algorithms and data structures in all areas, including bioinformatics, combinatorics, computational geometry, databases, graphics, and parallel and distributed computing
 Dewey number
 005.1
 Image bit depth
 0
 LC call number
 QA76.9.A43
 Literary form
 non fiction
 http://library.link/vocab/relatedWorkOrContributorName

 Dehne, Frank.
 Sack, JörgRüdiger.
 Stege, Ulrike.
 Series statement
 Lecture Notes in Computer Science,
 Series volume
 9214
 http://library.link/vocab/subjectName

 Computer science
 Computer Communication Networks
 Data structures (Computer science)
 Computer software
 Electronic data processing
 Computational complexity
 Computer graphics
 Label
 Algorithms and Data Structures : 14th International Symposium, WADS 2015, Victoria, BC, Canada, August 57, 2015. Proceedings, edited by Frank Dehne, JörgRüdiger Sack, Ulrike Stege, (electronic book)
 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
 Contact Graphs of Circular Arcs  Contact Representations of Graphs in 3D  Minimizing the Aggregate Movements for Interval Coverage  Online Bin Packing with Advice of Small Size  On the Approximability of Orthogonal Order Preserving Layout Adjustment  An Optimal Algorithm for Plane Matchings in Multipartite Geometric Graphs  Generation of Colourings and Distinguishing Colourings of Graphs  Strictly Implicit Priority Queues: On the Number of Moves and WorstCase Time  On CoctFree MultiColoring  Semidynamic connectivity in the plane  Interval Selection in the Streaming Model  On the BoundedHop Range Assignment Problem  Greedy Is an Almost Optimal Deque  A New Approach for Contact Graph Representations and Its Applications  Communication and Dynamic Networks  Dealing With 4Variables by Resolution: An Improved MaxSAT Algorithm  Select with Groups of 3 or 4 Approximating Nearest Neighbor Distances  Linearity is Strictly More Powerful than Contiguity for Encoding Graphs  On the Complexity of an Unregulated Traffic Crossing  Finding Pairwise Intersections Inside a Query Range  CacheOblivious Iterated Predecessor Queries via Range Coalescing  Polylogarithmic Fully Retroactive Priority Queues  On the Minimum Eccentricity Shortest Path Problem  Convex polygons in geometric triangulations  Straightline Drawability of a Planar Graph Plus an Edge  Solving Problems on Graphs of High RankWidth  The Parametric Closure Problem  Rooted Cycle Bases  On the Chain Pair Simplification Problem  Finding Articulation Points of Large Graphs in Linear Time  LPbased Approximation Algorithms for Facility Location in BuyatBulk Network Design  Universal Reconstruction of a String  The complexity of dominating set reconfiguration  Editing Graphs into Few Cliques: Complexity, Approximation, and Kernelization Schemes  Competitive Diffusion on Weighted Graphs  Sorting and Selection with Equality Comparisons  Polynomial Delay Algorithm for Listing Minimal Edge Dominating sets in Graphs  Fast and simple connectivity in graph timelines  Dynamic Set Intersection  TimeSpace Tradeof is for Triangulations and Voronoi Diagrams  A 2kVertex Kernel for Maximum Internal Spanning Tree  Reconfiguration on sparse graphs  Smoothed Analysis of Local Search Algorithms  Optimal Shue Code with Permutation Instructions  NonPreemptive Scheduling on Machines with Setup Times  A Moderately Exponential Time Algorithm for k IBDD Satisfiability  On the Parameterized Complexity of Girth and Connectivity Problems on Linear Matroids  Inferring People's Social Behavior by Exploiting Their Spatiotemporal Location Data  lastic Geometric Shape Matching for Point Sets under Translations  Constant Time Enumeration by Amortization  Computing the Center of Uncertain Points on Tree Networks  Swapping Colored Tokens on Graphs
 Control code
 9783319218403
 Dimensions
 unknown
 Extent
 XIII, 646 p. 125 illus.
 File format
 multiple file formats
 Form of item
 electronic
 Isbn
 9783319218403
 Level of compression
 uncompressed
 Media category
 computer
 Media MARC source
 rdamedia
 Media type code
 c
 Other control number
 10.1007/9783319218403
 Other physical details
 online resource.
 Quality assurance targets
 absent
 Reformatting quality
 access
 Reproduction note
 Electronic resource.
 Specific material designation
 remote
 Label
 Algorithms and Data Structures : 14th International Symposium, WADS 2015, Victoria, BC, Canada, August 57, 2015. Proceedings, edited by Frank Dehne, JörgRüdiger Sack, Ulrike Stege, (electronic book)
 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
 Contact Graphs of Circular Arcs  Contact Representations of Graphs in 3D  Minimizing the Aggregate Movements for Interval Coverage  Online Bin Packing with Advice of Small Size  On the Approximability of Orthogonal Order Preserving Layout Adjustment  An Optimal Algorithm for Plane Matchings in Multipartite Geometric Graphs  Generation of Colourings and Distinguishing Colourings of Graphs  Strictly Implicit Priority Queues: On the Number of Moves and WorstCase Time  On CoctFree MultiColoring  Semidynamic connectivity in the plane  Interval Selection in the Streaming Model  On the BoundedHop Range Assignment Problem  Greedy Is an Almost Optimal Deque  A New Approach for Contact Graph Representations and Its Applications  Communication and Dynamic Networks  Dealing With 4Variables by Resolution: An Improved MaxSAT Algorithm  Select with Groups of 3 or 4 Approximating Nearest Neighbor Distances  Linearity is Strictly More Powerful than Contiguity for Encoding Graphs  On the Complexity of an Unregulated Traffic Crossing  Finding Pairwise Intersections Inside a Query Range  CacheOblivious Iterated Predecessor Queries via Range Coalescing  Polylogarithmic Fully Retroactive Priority Queues  On the Minimum Eccentricity Shortest Path Problem  Convex polygons in geometric triangulations  Straightline Drawability of a Planar Graph Plus an Edge  Solving Problems on Graphs of High RankWidth  The Parametric Closure Problem  Rooted Cycle Bases  On the Chain Pair Simplification Problem  Finding Articulation Points of Large Graphs in Linear Time  LPbased Approximation Algorithms for Facility Location in BuyatBulk Network Design  Universal Reconstruction of a String  The complexity of dominating set reconfiguration  Editing Graphs into Few Cliques: Complexity, Approximation, and Kernelization Schemes  Competitive Diffusion on Weighted Graphs  Sorting and Selection with Equality Comparisons  Polynomial Delay Algorithm for Listing Minimal Edge Dominating sets in Graphs  Fast and simple connectivity in graph timelines  Dynamic Set Intersection  TimeSpace Tradeof is for Triangulations and Voronoi Diagrams  A 2kVertex Kernel for Maximum Internal Spanning Tree  Reconfiguration on sparse graphs  Smoothed Analysis of Local Search Algorithms  Optimal Shue Code with Permutation Instructions  NonPreemptive Scheduling on Machines with Setup Times  A Moderately Exponential Time Algorithm for k IBDD Satisfiability  On the Parameterized Complexity of Girth and Connectivity Problems on Linear Matroids  Inferring People's Social Behavior by Exploiting Their Spatiotemporal Location Data  lastic Geometric Shape Matching for Point Sets under Translations  Constant Time Enumeration by Amortization  Computing the Center of Uncertain Points on Tree Networks  Swapping Colored Tokens on Graphs
 Control code
 9783319218403
 Dimensions
 unknown
 Extent
 XIII, 646 p. 125 illus.
 File format
 multiple file formats
 Form of item
 electronic
 Isbn
 9783319218403
 Level of compression
 uncompressed
 Media category
 computer
 Media MARC source
 rdamedia
 Media type code
 c
 Other control number
 10.1007/9783319218403
 Other physical details
 online resource.
 Quality assurance targets
 absent
 Reformatting quality
 access
 Reproduction note
 Electronic resource.
 Specific material designation
 remote
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/AlgorithmsandDataStructures14th/gLb53MPf0XY/" 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/AlgorithmsandDataStructures14th/gLb53MPf0XY/">Algorithms and Data Structures : 14th International Symposium, WADS 2015, Victoria, BC, Canada, August 57, 2015. Proceedings, edited by Frank Dehne, JörgRüdiger Sack, Ulrike Stege, (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 Algorithms and Data Structures : 14th International Symposium, WADS 2015, Victoria, BC, Canada, August 57, 2015. Proceedings, edited by Frank Dehne, JörgRüdiger Sack, Ulrike Stege, (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/AlgorithmsandDataStructures14th/gLb53MPf0XY/" 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/AlgorithmsandDataStructures14th/gLb53MPf0XY/">Algorithms and Data Structures : 14th International Symposium, WADS 2015, Victoria, BC, Canada, August 57, 2015. Proceedings, edited by Frank Dehne, JörgRüdiger Sack, Ulrike Stege, (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>