LEADER 06461nam 22007815 450 001 9910144921303321 005 20200705204436.0 010 $a3-540-69422-6 024 7 $a10.1007/3-540-63307-3 035 $a(CKB)1000000000234687 035 $a(SSID)ssj0000321219 035 $a(PQKBManifestationID)11256253 035 $a(PQKBTitleCode)TC0000321219 035 $a(PQKBWorkID)10276827 035 $a(PQKB)10951895 035 $a(DE-He213)978-3-540-69422-9 035 $a(PPN)155179713 035 $a(EXLCZ)991000000000234687 100 $a20121227d1997 u| 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aAlgorithms and Data Structures$b[electronic resource] $e5th International Workshop, WADS '97, Halifax, Nova Scotia, Canada, August 6-8, 1997. Proceedings /$fedited by Frank Dehne, Andrew Rau-Chaplin, Jörg-Rüdiger Sack, Roberto Tamassia 205 $a1st ed. 1997. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d1997. 215 $a1 online resource (XI, 481 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v1272 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-63307-3 327 $aDiscrepancy theory and computational geometry -- Dynamic motion planning in low obstacle density environments -- Visibility-based pursuit-evasion in a polygonal environment -- Maintaining the extent of a moving point set -- Finding cores of limited length -- On bipartite crossings, largest biplanar subgraphs, and the linear arrangement problem -- Approximation algorithms for a genetic diagnostics problem -- Cartographic line simplication and polygon CSG formulae in O(n log* n) time -- Constrained TSP and low-power computing -- On-line load balancing for related machines -- A linear-time algorithm for the 1-mismatch problem -- On some geometric optimization problems in layered manufacturing -- New TSP construction heuristics and their relationships to the 2-opt -- Pattern matching in hypertext -- Multiple approximate string matching -- Applied computational geometry ? Abstract -- Checking the convexity of polytopes and the planarity of subdivisions (extended abstract) -- Voronoi diagrams for polygon-offset distance functions -- Randomized algorithms for that ancient scheduling problem -- Optimal parallel algorithms for proximate points, with applications -- An efficient algorithm for shortest paths in vertical and horizontal segments -- On geometric path query problems -- On-line scheduling with hard deadlines -- Load balanced mapping of data structures in parallel memory modules for fast and conflict-free templates access -- Parallel vs. parametric complexity -- Position-independent near optimal searching and on-line recognition in star polygons -- Dynamic data structures for fat objects and their applications -- Intractability of assembly sequencing: Unit disks in the plane -- On hamiltonian triangulations in simple polygons (Extended Abstract) -- Computing orthogonal drawings with the minimum number of bends -- On a simple depth-first search strategy for exploring unknown graphs -- Orthogonal drawing of high degree graphs with small area and few bends -- A centroid labelling technique and its application to path selection in trees -- Offset-polygon annulus placement problems -- Computing constrained minimum-width annuli of point sets -- Geometric Applications of Posets -- Constructing pairwise disjoint paths with few links -- Trans-dichotomous algorithms without multiplication ? some upper and lower bounds -- An approximation algorithm for stacking up bins from a conveyer onto pallets -- Relaxed balance through standard rotations -- Efficient breakout routing in printed circuit boards -- Planarity, revisited (extended abstract). 330 $aThis book constitutes the refereed proceedings of the 5th International Workshop on Algorithms and Data Structures, WADS'97, held in Nova Scotia, Halifax, Canada, in August 1997. The 37 revised full papers presented were carefully selected from a total of 81 submissions. Also included are four abstracts and one full contribution corresponding to the invited talks. Among the topics covered are data structures and algorithmic aspects in a variety of areas like computational geometry, graph theory, networking, load balancing, optimization, approximation, sorting, pattern matching, etc. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v1272 606 $aComputers 606 $aComputer programming 606 $aAlgorithms 606 $aData structures (Computer science) 606 $aComputer science?Mathematics 606 $aComputer graphics 606 $aTheory of Computation$3https://scigraph.springernature.com/ontologies/product-market-codes/I16005 606 $aProgramming Techniques$3https://scigraph.springernature.com/ontologies/product-market-codes/I14010 606 $aAlgorithm Analysis and Problem Complexity$3https://scigraph.springernature.com/ontologies/product-market-codes/I16021 606 $aData Structures$3https://scigraph.springernature.com/ontologies/product-market-codes/I15017 606 $aDiscrete Mathematics in Computer Science$3https://scigraph.springernature.com/ontologies/product-market-codes/I17028 606 $aComputer Graphics$3https://scigraph.springernature.com/ontologies/product-market-codes/I22013 615 0$aComputers. 615 0$aComputer programming. 615 0$aAlgorithms. 615 0$aData structures (Computer science). 615 0$aComputer science?Mathematics. 615 0$aComputer graphics. 615 14$aTheory of Computation. 615 24$aProgramming Techniques. 615 24$aAlgorithm Analysis and Problem Complexity. 615 24$aData Structures. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aComputer Graphics. 676 $a005.1 702 $aDehne$b Frank$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aRau-Chaplin$b Andrew$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aSack$b Jörg-Rüdiger$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aTamassia$b Roberto$4edt$4http://id.loc.gov/vocabulary/relators/edt 712 12$aWADS '97 906 $aBOOK 912 $a9910144921303321 996 $aAlgorithms and Data Structures$9772001 997 $aUNINA