LEADER 05370oam 2200553 450 001 9910143464603321 005 20210804121135.0 010 $a3-540-49381-6 024 7 $a10.1007/3-540-49381-6 035 $a(CKB)1000000000211032 035 $a(SSID)ssj0000321212 035 $a(PQKBManifestationID)11212661 035 $a(PQKBTitleCode)TC0000321212 035 $a(PQKBWorkID)10263723 035 $a(PQKB)10715600 035 $a(DE-He213)978-3-540-49381-5 035 $a(MiAaPQ)EBC3072483 035 $a(MiAaPQ)EBC6495039 035 $a(PPN)155183192 035 $a(EXLCZ)991000000000211032 100 $a20210804d1998 uy 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 00$aAlgorithms and computation $e9th International Symposium, ISAAC'98, Taejon, Korea, December 14-16, 1998, proceedings /$fedited by Oscar H. Ibarra; Kyung-Yong Chwa 205 $a1st ed. 1998. 210 1$aBerlin, Germany ;$aNew York, New York :$cSpringer,$d[1998] 210 4$d©1998 215 $a1 online resource (D, 486 p.) 225 1 $aLecture notes in computer science ;$vVolume 1533 300 $aIncludes index. 311 $a3-540-65385-6 320 $aIncludes bibliographical references and index. 327 $aInvited 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 Result-Correctness Efficiently While Concealing It -- Graph Drawing -- Two-Layer Planarization in Graph Drawing -- Computing Orthogonal Drawings in a Variable Embedding Setting -- Dynamic Grid Embedding with Few Bends and Changes -- On-Line Algorithm and Scheduling -- Two New Families of List Update Algorithms -- An Optimal Algorithm for On-Line Palletizing at Delivery Industry -- On-Line 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 -- k-Edge and 3-Vertex Connectivity Augmentation in an Arbitrary Multigraph -- Polyhedral Structure of Submodular and Posi-modular Systems -- Maximizing the number of Connections in Optical Tree Networks -- Best Paper Presentation -- Selecting the k Largest Elements with Parity Tests -- Randomized Algorithm -- Randomized K-Dimensional 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 Distance-Hereditary 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 Self-Approaching Curves -- The Steiner Tree Problem in ?4-geometry Plane -- Computational Biology -- Approximation and Exact Algorithms for RNA Secondary Structure Prediction and Recognition of Stochastic Context-Free 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 -- Space-Efficient 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 Edge-Disjoint Paths Problem is NP-Complete for Partial k-Trees -- Inapproximability Results for Guarding Polygons without Holes -- The Inapproximability of Non NP-hard Optimization Problems -- Parallel and Distributed Algorithm -- An Efficient NC Algorithm for a Sparse k-Edge-Connectivity Certificate -- A Parallel Algorithm for Sampling Matchings from an Almost Uniform Distribution -- Optimal Approximate Agreement with Omission Faults. 410 0$aLecture notes in computer science ;$vVolume 1533. 606 $aComputer algorithms$vCongresses 615 0$aComputer algorithms 676 $a004.015118 702 $aChwa$b Kyung-Yong$f1946- 702 $aIbarra$b Oscar H. 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bUtOrBLW 906 $aBOOK 912 $a9910143464603321 996 $aAlgorithms and Computation$9771857 997 $aUNINA