rdf-syntax-grammar
mods:
  schema location: http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-2.xsd
  title info:
    title: Algorithms and Data Structures
    sub title: 5th International Workshop, WADS '97, Halifax, Nova Scotia, Canada, August 6-8, 1997. Proceedings
  name:
    name part: Dehne, Frank.
    role:
      role term: editor.
    role:
      role term: edt
    role:
      role term: http://id.loc.gov/vocabulary/relators/edt
  name:
    name part: Rau-Chaplin, Andrew.
    role:
      role term: editor.
    role:
      role term: edt
    role:
      role term: http://id.loc.gov/vocabulary/relators/edt
  name:
    name part: Sack, Jörg-Rüdiger.
    role:
      role term: editor.
    role:
      role term: edt
    role:
      role term: http://id.loc.gov/vocabulary/relators/edt
  name:
    name part: Tamassia, Roberto.
    role:
      role term: editor.
    role:
      role term: edt
    role:
      role term: http://id.loc.gov/vocabulary/relators/edt
  name:
    name part: SpringerLink (Online service)
  type of resource: text
  origin info:
    place:
      place term: gw
    date issued: 1997
    edition: 1st ed. 1997.
    issuance: monographic
  language:
    language term: eng
  physical description:
    form: electronic
    form: electronic resource
    reformatting quality: access
    form: remote
    extent: XI, 481 p. online resource.
  abstract: This 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.
  table of contents: Discrepancy 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 centroi…
  note: edited by Frank Dehne, Andrew Rau-Chaplin, Jörg-Rüdiger Sack, Roberto Tamassia.
  subject:
    topic: Computers
  subject:
    topic: Computer programming
  subject:
    topic: Algorithms
  subject:
    topic: Data structures (Computer science)
  subject:
    topic: Computer science-Mathematics
  subject:
    topic: Computer graphics
  subject:
    topic: Theory of Computation
  subject:
    topic: Programming Techniques
  subject:
    topic: Algorithm Analysis and Problem Complexity
  subject:
    topic: Data Structures
  subject:
    topic: Discrete Mathematics in Computer Science
  subject:
    topic: Computer Graphics
  classification: QA75.5-76.95
  classification: QA76.63
  classification: 004.0151
  related item:
    title info:
      title: Springer eBooks
  related item:
    title info:
      title: Lecture Notes in Computer Science, 1272
  identifier: 9783540694229
  identifier: https://doi.org/10.1007/3-540-63307-3
  record info:
    record creation date: 121227
    record change date: 20191028182452.0
    record identifier: 978-3-540-69422-9