國立虎尾科技大學 |

Algorithms and Data Structures = 14th International Symposium, WADS 2015, Victoria, BC, Canada, August 5-7, 2015. Proceedings /

Record Type:	Language materials, printed : Monograph/item
Title/Author:	Algorithms and Data Structures/ edited by Frank Dehne, Jörg-Rüdiger Sack, Ulrike Stege.
Reminder of title:	14th International Symposium, WADS 2015, Victoria, BC, Canada, August 5-7, 2015. Proceedings /
other author:	Dehne, Frank.
Description:	XIII, 646 p. 125 illus.online resource. :
Contained By:	Springer Nature eBook
Subject:	Algorithms. -
Online resource:	https://doi.org/10.1007/978-3-319-21840-3
ISBN:	9783319218403

Algorithms and Data Structures = 14th International Symposium, WADS 2015, Victoria, BC, Canada, August 5-7, 2015. Proceedings /
Algorithms and Data Structures14th International Symposium, WADS 2015, Victoria, BC, Canada, August 5-7, 2015. Proceedings /[electronic resource] :edited by Frank Dehne, Jörg-Rüdiger Sack, Ulrike Stege. - 1st ed. 2015. - XIII, 646 p. 125 illus.online resource. - Theoretical Computer Science and General Issues ;9214. - Theoretical Computer Science and General Issues ;9163.

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 Worst-Case Time -- On Coct-Free Multi-Coloring -- Semi-dynamic connectivity in the plane -- Interval Selection in the Streaming Model -- On the Bounded-Hop 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 4-Variables 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 -- Cache-Oblivious Iterated Predecessor Queries via Range Coalescing -- Polylogarithmic Fully Retroactive Priority Queues -- On the Minimum Eccentricity Shortest Path Problem -- Convex polygons in geometric triangulations -- Straight-line Drawability of a Planar Graph Plus an Edge -- Solving Problems on Graphs of High Rank-Width -- The Parametric Closure Problem -- Rooted Cycle Bases -- On the Chain Pair Simplification Problem -- Finding Articulation Points of Large Graphs in Linear Time -- LP-based Approximation Algorithms for Facility Location in Buy-at-Bulk 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 -- Time-Space Trade-of is for Triangulations and Voronoi Diagrams -- A 2k-Vertex Kernel for Maximum Internal Spanning Tree -- Reconfiguration on sparse graphs -- Smoothed Analysis of Local Search Algorithms -- Optimal Shue Code with Permutation Instructions -- Non-Preemptive 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.

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.

ISBN: 9783319218403

Standard No.: 10.1007/978-3-319-21840-3doiSubjects--Topical Terms:

527865
Algorithms.

LC Class. No.: QA76.9.A43

Dewey Class. No.: 005.1

Algorithms and Data Structures = 14th International Symposium, WADS 2015, Victoria, BC, Canada, August 5-7, 2015. Proceedings /
LDR:05179nam a22004095i 4500 001 963851
003 DE-He213
005 20200630120120.0
007 cr nn 008mamaa
008 201211s2015 gw | s |||| 0|eng d
020 $a 9783319218403 $9 978-3-319-21840-3
024 7 $a 10.1007/978-3-319-21840-3 $2 doi
035 $a 978-3-319-21840-3
050 4 $a QA76.9.A43
072 7 $a UMB $2 bicssc
072 7 $a COM051300 $2 bisacsh
072 7 $a UMB $2 thema
082 0 4 $a 005.1 $2 23
245 1 0 $a Algorithms and Data Structures $h [electronic resource] : $b 14th International Symposium, WADS 2015, Victoria, BC, Canada, August 5-7, 2015. Proceedings / $c edited by Frank Dehne, Jörg-Rüdiger Sack, Ulrike Stege.
250 $a 1st ed. 2015.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2015.
300 $a XIII, 646 p. 125 illus. $b online resource.
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
347 $a text file $b PDF $2 rda
490 1 $a Theoretical Computer Science and General Issues ; $v 9214
505 0 $a 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 Worst-Case Time -- On Coct-Free Multi-Coloring -- Semi-dynamic connectivity in the plane -- Interval Selection in the Streaming Model -- On the Bounded-Hop 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 4-Variables 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 -- Cache-Oblivious Iterated Predecessor Queries via Range Coalescing -- Polylogarithmic Fully Retroactive Priority Queues -- On the Minimum Eccentricity Shortest Path Problem -- Convex polygons in geometric triangulations -- Straight-line Drawability of a Planar Graph Plus an Edge -- Solving Problems on Graphs of High Rank-Width -- The Parametric Closure Problem -- Rooted Cycle Bases -- On the Chain Pair Simplification Problem -- Finding Articulation Points of Large Graphs in Linear Time -- LP-based Approximation Algorithms for Facility Location in Buy-at-Bulk 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 -- Time-Space Trade-of is for Triangulations and Voronoi Diagrams -- A 2k-Vertex Kernel for Maximum Internal Spanning Tree -- Reconfiguration on sparse graphs -- Smoothed Analysis of Local Search Algorithms -- Optimal Shue Code with Permutation Instructions -- Non-Preemptive 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.
520 $a 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.
650 0 $a Algorithms. $3 527865
650 0 $a Data structures (Computer science). $3 680370
650 0 $a Computer science—Mathematics. $3 1253519
650 0 $a Computer graphics. $3 561602
650 0 $a Numerical analysis. $3 527939
650 0 $a Computer communication systems. $3 1115394
650 1 4 $a Algorithm Analysis and Problem Complexity. $3 593923
650 2 4 $a Data Structures. $3 669824
650 2 4 $a Discrete Mathematics in Computer Science. $3 670123
650 2 4 $a Computer Graphics. $3 669895
650 2 4 $a Numeric Computing. $3 669943
650 2 4 $a Computer Communication Networks. $3 669310
700 1 $a Dehne, Frank. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 675385
700 1 $a Sack, Jörg-Rüdiger. $e editor. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1258919
700 1 $a Stege, Ulrike. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1067075
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783319218410
776 0 8 $i Printed edition: $z 9783319218397
830 0 $a Theoretical Computer Science and General Issues ; $v 9163 $3 1253524
856 4 0 $u https://doi.org/10.1007/978-3-319-21840-3
912 $a ZDB-2-SCS
912 $a ZDB-2-SXCS
912 $a ZDB-2-LNC
950 $a Computer Science (SpringerNature-11645)
950 $a Computer Science (R0) (SpringerNature-43710)