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 Algorithms and Computation : 9th International Symposium, ISAAC’98 Taejon, Korea, December 14–16, 1998 Proceedings, edited by KyungYong Chwa, Oscar H. Ibarra, (electronic resource)
Algorithms and Computation : 9th International Symposium, ISAAC’98 Taejon, Korea, December 14–16, 1998 Proceedings, edited by KyungYong Chwa, Oscar H. Ibarra, (electronic resource)
Resource Information
The item Algorithms and Computation : 9th International Symposium, ISAAC’98 Taejon, Korea, December 14–16, 1998 Proceedings, edited by KyungYong Chwa, Oscar H. Ibarra, (electronic resource) 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 Algorithms and Computation : 9th International Symposium, ISAAC’98 Taejon, Korea, December 14–16, 1998 Proceedings, edited by KyungYong Chwa, Oscar H. Ibarra, (electronic resource) 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 refereed proceedings of the 9th International Symposium on Algorithms and Computation, ISAAC'98, held in Taejon, Korea, in December 1998. The 47 revised full papers presented were carefully reviewed and selected from a total of 102 submissions. The book is divided in topical sections on computational geometry, complexity, graph drawing, online algorithms and scheduling, CAD/CAM and graphics, graph algorithms, randomized algorithms, combinatorial problems, computational biology, approximation algorithms, and parallel and distributed algorithms
 Language
 eng
 Extent
 D, 486 p.
 Contents

 Invited Presentation
 The Discrepancy Method
 Implementing Algorithms and Data Structures: An Educational and Research Perspective
 Geometry I
 L? Voronoi Diagrams and Applications to VLSI Layout and Manufacturing
 Facility Location on Terrains
 Computing Weighted Rectilinear Median and Center Set in the Presence of Obstacles
 Complexity I
 Maximizing Agreement with a Classification by Bounded or Unbounded number of Associated Words
 Disjunctions of Horn Theories and Their Cores
 Checking Programs Discreetly: Demonstrating ResultCorrectness Efficiently While Concealing It
 Graph Drawing
 TwoLayer Planarization in Graph Drawing
 Computing Orthogonal Drawings in a Variable Embedding Setting
 Dynamic Grid Embedding with Few Bends and Changes
 OnLine Algorithm and Scheduling
 Two New Families of List Update Algorithms
 An Optimal Algorithm for OnLine Palletizing at Delivery Industry
 OnLine Scheduling of Parallel Jobs with Runtime Restrictions
 CAD/CAM and Graphics
 Testing the Quality of Manufactured Disks and Cylinders
 Casting with Skewed Ejection Direction
 Repairing Flaws in a Picture Based on a Geometric Representation of a Digital Image
 Graph Algorithm I
 kEdge and 3Vertex Connectivity Augmentation in an Arbitrary Multigraph
 Polyhedral Structure of Submodular and Posimodular Systems
 Maximizing the number of Connections in Optical Tree Networks
 Best Paper Presentation
 Selecting the k Largest Elements with Parity Tests
 Randomized Algorithm
 Randomized KDimensional Binary Search Trees
 Randomized O(log log n)Round Leader Election Protocols in Packet Radio Networks
 Random Regular Graphs with Edge Faults: Expansion through Cores
 Complexity II
 A Quantum Polynomial Time Algorithm in Worst Case for Simon’s Problem
 Generalized Graph Colorability and Compressibility of Boolean Formulae
 On the Complexity of Free Monoid Morphisms
 Graph Algorithm II
 Characterization of Efficiently Solvable Problems on DistanceHereditary Graphs
 Fast Algorithms for Independent Domination and Efficient Domination in Trapezoid Graphs
 Finding Planar Geometric Automorphisms in Planar Graphs
 Combinatorial Problem
 New Approach for Speeding Up Enumeration Algorithms
 Hamiltonian Decomposition of Recursive Circulants
 Convertibility among Grid Filling Curves
 Geometry II
 Generalized SelfApproaching Curves
 The Steiner Tree Problem in ?4geometry Plane
 Computational Biology
 Approximation and Exact Algorithms for RNA Secondary Structure Prediction and Recognition of Stochastic ContextFree Languages
 On the Multiple Gene Duplication Problem
 Geometry III
 Visibility Queries in Simple Polygons and Applications
 Quadtree Decomposition, Steiner Triangulation, and Ray Shooting
 Optimality and Integer Programming Formulations of Triangulations in General Dimension
 Approximation Algorithm
 SpaceEfficient Approximation Algorithms for MAXCUT and COLORING Semidefinite Programs
 A Capacitated Vehicle Routing Problem on a Tree
 Approximation Algorithms for Some Optimum Communication Spanning Tree Problems
 Complexity III
 The EdgeDisjoint Paths Problem is NPComplete for Partial kTrees
 Inapproximability Results for Guarding Polygons without Holes
 The Inapproximability of Non NPhard Optimization Problems
 Parallel and Distributed Algorithm
 An Efficient NC Algorithm for a Sparse kEdgeConnectivity Certificate
 A Parallel Algorithm for Sampling Matchings from an Almost Uniform Distribution
 Optimal Approximate Agreement with Omission Faults
 Isbn
 9783540493815
 Label
 Algorithms and Computation : 9th International Symposium, ISAAC’98 Taejon, Korea, December 14–16, 1998 Proceedings
 Title
 Algorithms and Computation
 Title remainder
 9th International Symposium, ISAAC’98 Taejon, Korea, December 14–16, 1998 Proceedings
 Statement of responsibility
 edited by KyungYong Chwa, Oscar H. Ibarra
 Subject

 Computation by Abstract Devices
 Computational complexity
 Computer software
 Computer science
 Computer science
 Algorithm Analysis and Problem Complexity
 Computer Science
 Computational complexity
 Computer Science
 Discrete Mathematics in Computer Science
 Computer science  Mathematics
 Computer software
 Electronic resources
 Computer software
 Computer Communication Networks
 Computer science  Mathematics
 Computational Mathematics and Numerical Analysis
 Computer Science
 Computer science
 Language
 eng
 Summary
 This book constitutes the refereed proceedings of the 9th International Symposium on Algorithms and Computation, ISAAC'98, held in Taejon, Korea, in December 1998. The 47 revised full papers presented were carefully reviewed and selected from a total of 102 submissions. The book is divided in topical sections on computational geometry, complexity, graph drawing, online algorithms and scheduling, CAD/CAM and graphics, graph algorithms, randomized algorithms, combinatorial problems, computational biology, approximation algorithms, and parallel and distributed algorithms
 http://library.link/vocab/creatorName
 Chwa, KyungYong
 Image bit depth
 0
 LC call number
 QA76.9.A43
 Literary form
 non fiction
 http://library.link/vocab/relatedWorkOrContributorName

 Ibarra, Oscar H.
 SpringerLink
 Series statement
 Lecture Notes in Computer Science,
 Series volume
 1533
 http://library.link/vocab/subjectName

 Computer science
 Computer Communication Networks
 Computer software
 Computational complexity
 Computer science
 Computer Science
 Algorithm Analysis and Problem Complexity
 Discrete Mathematics in Computer Science
 Computation by Abstract Devices
 Computer Communication Networks
 Computational Mathematics and Numerical Analysis
 Label
 Algorithms and Computation : 9th International Symposium, ISAAC’98 Taejon, Korea, December 14–16, 1998 Proceedings, edited by KyungYong Chwa, Oscar H. Ibarra, (electronic resource)
 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
 Invited Presentation  The Discrepancy Method  Implementing Algorithms and Data Structures: An Educational and Research Perspective  Geometry I  L? Voronoi Diagrams and Applications to VLSI Layout and Manufacturing  Facility Location on Terrains  Computing Weighted Rectilinear Median and Center Set in the Presence of Obstacles  Complexity I  Maximizing Agreement with a Classification by Bounded or Unbounded number of Associated Words  Disjunctions of Horn Theories and Their Cores  Checking Programs Discreetly: Demonstrating ResultCorrectness Efficiently While Concealing It  Graph Drawing  TwoLayer Planarization in Graph Drawing  Computing Orthogonal Drawings in a Variable Embedding Setting  Dynamic Grid Embedding with Few Bends and Changes  OnLine Algorithm and Scheduling  Two New Families of List Update Algorithms  An Optimal Algorithm for OnLine Palletizing at Delivery Industry  OnLine Scheduling of Parallel Jobs with Runtime Restrictions  CAD/CAM and Graphics  Testing the Quality of Manufactured Disks and Cylinders  Casting with Skewed Ejection Direction  Repairing Flaws in a Picture Based on a Geometric Representation of a Digital Image  Graph Algorithm I  kEdge and 3Vertex Connectivity Augmentation in an Arbitrary Multigraph  Polyhedral Structure of Submodular and Posimodular Systems  Maximizing the number of Connections in Optical Tree Networks  Best Paper Presentation  Selecting the k Largest Elements with Parity Tests  Randomized Algorithm  Randomized KDimensional Binary Search Trees  Randomized O(log log n)Round Leader Election Protocols in Packet Radio Networks  Random Regular Graphs with Edge Faults: Expansion through Cores  Complexity II  A Quantum Polynomial Time Algorithm in Worst Case for Simon’s Problem  Generalized Graph Colorability and Compressibility of Boolean Formulae  On the Complexity of Free Monoid Morphisms  Graph Algorithm II  Characterization of Efficiently Solvable Problems on DistanceHereditary Graphs  Fast Algorithms for Independent Domination and Efficient Domination in Trapezoid Graphs  Finding Planar Geometric Automorphisms in Planar Graphs  Combinatorial Problem  New Approach for Speeding Up Enumeration Algorithms  Hamiltonian Decomposition of Recursive Circulants  Convertibility among Grid Filling Curves  Geometry II  Generalized SelfApproaching Curves  The Steiner Tree Problem in ?4geometry Plane  Computational Biology  Approximation and Exact Algorithms for RNA Secondary Structure Prediction and Recognition of Stochastic ContextFree Languages  On the Multiple Gene Duplication Problem  Geometry III  Visibility Queries in Simple Polygons and Applications  Quadtree Decomposition, Steiner Triangulation, and Ray Shooting  Optimality and Integer Programming Formulations of Triangulations in General Dimension  Approximation Algorithm  SpaceEfficient Approximation Algorithms for MAXCUT and COLORING Semidefinite Programs  A Capacitated Vehicle Routing Problem on a Tree  Approximation Algorithms for Some Optimum Communication Spanning Tree Problems  Complexity III  The EdgeDisjoint Paths Problem is NPComplete for Partial kTrees  Inapproximability Results for Guarding Polygons without Holes  The Inapproximability of Non NPhard Optimization Problems  Parallel and Distributed Algorithm  An Efficient NC Algorithm for a Sparse kEdgeConnectivity Certificate  A Parallel Algorithm for Sampling Matchings from an Almost Uniform Distribution  Optimal Approximate Agreement with Omission Faults
 Dimensions
 unknown
 Extent
 D, 486 p.
 File format
 multiple file formats
 Form of item
 electronic
 Isbn
 9783540493815
 Level of compression
 uncompressed
 Media category
 computer
 Media MARC source
 rdamedia
 Media type code
 c
 Other control number
 10.1007/3540493816
 Other physical details
 online resource.
 Quality assurance targets
 absent
 Reformatting quality
 access
 Specific material designation
 remote
 System control number
 (DEHe213)9783540493815
 Label
 Algorithms and Computation : 9th International Symposium, ISAAC’98 Taejon, Korea, December 14–16, 1998 Proceedings, edited by KyungYong Chwa, Oscar H. Ibarra, (electronic resource)
 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
 Invited Presentation  The Discrepancy Method  Implementing Algorithms and Data Structures: An Educational and Research Perspective  Geometry I  L? Voronoi Diagrams and Applications to VLSI Layout and Manufacturing  Facility Location on Terrains  Computing Weighted Rectilinear Median and Center Set in the Presence of Obstacles  Complexity I  Maximizing Agreement with a Classification by Bounded or Unbounded number of Associated Words  Disjunctions of Horn Theories and Their Cores  Checking Programs Discreetly: Demonstrating ResultCorrectness Efficiently While Concealing It  Graph Drawing  TwoLayer Planarization in Graph Drawing  Computing Orthogonal Drawings in a Variable Embedding Setting  Dynamic Grid Embedding with Few Bends and Changes  OnLine Algorithm and Scheduling  Two New Families of List Update Algorithms  An Optimal Algorithm for OnLine Palletizing at Delivery Industry  OnLine Scheduling of Parallel Jobs with Runtime Restrictions  CAD/CAM and Graphics  Testing the Quality of Manufactured Disks and Cylinders  Casting with Skewed Ejection Direction  Repairing Flaws in a Picture Based on a Geometric Representation of a Digital Image  Graph Algorithm I  kEdge and 3Vertex Connectivity Augmentation in an Arbitrary Multigraph  Polyhedral Structure of Submodular and Posimodular Systems  Maximizing the number of Connections in Optical Tree Networks  Best Paper Presentation  Selecting the k Largest Elements with Parity Tests  Randomized Algorithm  Randomized KDimensional Binary Search Trees  Randomized O(log log n)Round Leader Election Protocols in Packet Radio Networks  Random Regular Graphs with Edge Faults: Expansion through Cores  Complexity II  A Quantum Polynomial Time Algorithm in Worst Case for Simon’s Problem  Generalized Graph Colorability and Compressibility of Boolean Formulae  On the Complexity of Free Monoid Morphisms  Graph Algorithm II  Characterization of Efficiently Solvable Problems on DistanceHereditary Graphs  Fast Algorithms for Independent Domination and Efficient Domination in Trapezoid Graphs  Finding Planar Geometric Automorphisms in Planar Graphs  Combinatorial Problem  New Approach for Speeding Up Enumeration Algorithms  Hamiltonian Decomposition of Recursive Circulants  Convertibility among Grid Filling Curves  Geometry II  Generalized SelfApproaching Curves  The Steiner Tree Problem in ?4geometry Plane  Computational Biology  Approximation and Exact Algorithms for RNA Secondary Structure Prediction and Recognition of Stochastic ContextFree Languages  On the Multiple Gene Duplication Problem  Geometry III  Visibility Queries in Simple Polygons and Applications  Quadtree Decomposition, Steiner Triangulation, and Ray Shooting  Optimality and Integer Programming Formulations of Triangulations in General Dimension  Approximation Algorithm  SpaceEfficient Approximation Algorithms for MAXCUT and COLORING Semidefinite Programs  A Capacitated Vehicle Routing Problem on a Tree  Approximation Algorithms for Some Optimum Communication Spanning Tree Problems  Complexity III  The EdgeDisjoint Paths Problem is NPComplete for Partial kTrees  Inapproximability Results for Guarding Polygons without Holes  The Inapproximability of Non NPhard Optimization Problems  Parallel and Distributed Algorithm  An Efficient NC Algorithm for a Sparse kEdgeConnectivity Certificate  A Parallel Algorithm for Sampling Matchings from an Almost Uniform Distribution  Optimal Approximate Agreement with Omission Faults
 Dimensions
 unknown
 Extent
 D, 486 p.
 File format
 multiple file formats
 Form of item
 electronic
 Isbn
 9783540493815
 Level of compression
 uncompressed
 Media category
 computer
 Media MARC source
 rdamedia
 Media type code
 c
 Other control number
 10.1007/3540493816
 Other physical details
 online resource.
 Quality assurance targets
 absent
 Reformatting quality
 access
 Specific material designation
 remote
 System control number
 (DEHe213)9783540493815
Subject
 Algorithm Analysis and Problem Complexity
 Computation by Abstract Devices
 Computational Mathematics and Numerical Analysis
 Computational complexity
 Computational complexity
 Computer Communication Networks
 Computer Science
 Computer Science
 Computer Science
 Computer science
 Computer science
 Computer science
 Computer science  Mathematics
 Computer science  Mathematics
 Computer software
 Computer software
 Computer software
 Discrete Mathematics in Computer Science
 Electronic resources
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 (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.bu.edu/portal/AlgorithmsandComputation9thInternational/EazA4sXFqYM/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.bu.edu/portal/AlgorithmsandComputation9thInternational/EazA4sXFqYM/">Algorithms and Computation : 9th International Symposium, ISAAC’98 Taejon, Korea, December 14–16, 1998 Proceedings, edited by KyungYong Chwa, Oscar H. Ibarra, (electronic resource)</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 Algorithms and Computation : 9th International Symposium, ISAAC’98 Taejon, Korea, December 14–16, 1998 Proceedings, edited by KyungYong Chwa, Oscar H. Ibarra, (electronic resource)
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/AlgorithmsandComputation9thInternational/EazA4sXFqYM/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.bu.edu/portal/AlgorithmsandComputation9thInternational/EazA4sXFqYM/">Algorithms and Computation : 9th International Symposium, ISAAC’98 Taejon, Korea, December 14–16, 1998 Proceedings, edited by KyungYong Chwa, Oscar H. Ibarra, (electronic resource)</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>