LEADER 05715nam 22008175 450 001 9910483655503321 005 20230406070532.0 010 $a1-280-39061-1 010 $a9786613568533 010 $a3-642-17514-7 024 7 $a10.1007/978-3-642-17514-5 035 $a(CKB)2670000000064712 035 $a(SSID)ssj0000475851 035 $a(PQKBManifestationID)11320117 035 $a(PQKBTitleCode)TC0000475851 035 $a(PQKBWorkID)10479063 035 $a(PQKB)10815977 035 $a(DE-He213)978-3-642-17514-5 035 $a(MiAaPQ)EBC3066207 035 $a(PPN)149893574 035 $a(EXLCZ)992670000000064712 100 $a20101203d2010 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aAlgorithms and Computation $e21st International Symposium, ISAAC 2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part II /$fedited by Otfried Cheong, Kyung-Yong Chwa, Kunsoo Park 205 $a1st ed. 2010. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2010. 215 $a1 online resource (XVIII, 474 p. 96 illus.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v6507 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-642-17513-9 320 $aIncludes bibliographical references and index. 327 $aSession 6A. Data Structure and Algorithm II -- D2-Tree: A New Overlay with Deterministic Bounds -- Efficient Indexes for the Positional Pattern Matching Problem and Two Related Problems over Small Alphabets -- Dynamic Range Reporting in External Memory -- A Cache-Oblivious Implicit Dictionary with the Working Set Property -- Session 6B. Graph Algorithm II -- The (p,q)-total Labeling Problem for Trees -- Drawing a Tree as a Minimum Spanning Tree Approximation -- k-cyclic Orientations of Graphs -- Improved Bounds on the Planar Branchwidth with Respect to the Largest Grid Minor Size -- Session 7A. Computational Geometry II -- Maximum Overlap of Convex Polytopes under Translation -- Approximate Shortest Homotopic Paths in Weighted Regions -- Spanning Ratio and Maximum Detour of Rectilinear Paths in the L 1 Plane -- Session 7B. Graph Coloring II -- Approximation and Hardness Results for the Maximum Edge q-coloring Problem -- 3-Colouring AT-Free Graphs in Polynomial Time -- On Coloring Graphs without Induced Forests -- Session 8A. Approximation Algorithm II -- On the Approximability of the Maximum Interval Constrained Coloring Problem -- Approximability of Constrained LCS -- Approximation Algorithms for the Multi-Vehicle Scheduling Problem -- On Greedy Algorithms for Decision Trees -- Session 8B. Online Algorithm -- Single and Multiple Device DSA Problem, Complexities and Online Algorithms -- The Onion Diagram: A Voronoi-Like Tessellation of a Planar Line Space and Its Applications -- Improved Online Algorithms for 1-Space Bounded 2-Dimensional Bin Packing -- On the Continuous CNN Problem -- Session 9A. Scheduling -- Policies for Periodic Packet Routing -- Increasing Speed Scheduling and Flow Scheduling -- A Tighter Analysis of Work Stealing -- Approximating the Traveling Tournament Problem with Maximum Tour Length 2 -- Session 9B. Data Structure and Algorithm III -- Alphabet Partitioning for Compressed Rank/Select and Applications -- Entropy-Bounded Representation of Point Grids -- Identifying Approximate Palindromes in Run-Length Encoded Strings -- Session 10A. Graph Algorithm III -- Minimum Cost Partitions of Trees with Supply and Demand -- Computing the (t,k)-Diagnosability of Component-Composition Graphs and Its Application -- Why Depth-First Search Efficiently Identifies Two and Three-Connected Graphs -- Beyond Good Shapes: Diffusion-Based Graph Partitioning Is Relaxed Cut Optimization -- Induced Subgraph Isomorphism on Interval and Proper Interval Graphs -- Session 10B. Computational Geometry III -- Testing Simultaneous Planarity When the Common Graph Is 2-Connected -- Computing the Discrete Fréchet Distance with Imprecise Input -- Connectivity Graphs of Uncertainty Regions -- ?/2-Angle Yao Graphs Are Spanners -- Identifying Shapes Using Self-assembly. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v6507 606 $aComputer programming 606 $aAlgorithms 606 $aComputer science?Mathematics 606 $aDiscrete mathematics 606 $aComputer networks 606 $aComputer graphics 606 $aArtificial intelligence?Data processing 606 $aProgramming Techniques 606 $aAlgorithms 606 $aDiscrete Mathematics in Computer Science 606 $aComputer Communication Networks 606 $aComputer Graphics 606 $aData Science 615 0$aComputer programming. 615 0$aAlgorithms. 615 0$aComputer science?Mathematics. 615 0$aDiscrete mathematics. 615 0$aComputer networks. 615 0$aComputer graphics. 615 0$aArtificial intelligence?Data processing. 615 14$aProgramming Techniques. 615 24$aAlgorithms. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aComputer Communication Networks. 615 24$aComputer Graphics. 615 24$aData Science. 676 $a005.11 702 $aCheong$b Otfried$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aChwa$b Kyung-Yong$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aPark$b Kunsoo$4edt$4http://id.loc.gov/vocabulary/relators/edt 906 $aBOOK 912 $a9910483655503321 996 $aAlgorithms and Computation$9771857 997 $aUNINA