LEADER 06479nam 22008175 450 001 996465859403316 005 20230221152014.0 010 $a1-280-38756-4 010 $a9786613565488 010 $a3-642-14031-9 024 7 $a10.1007/978-3-642-14031-0 035 $a(CKB)2670000000028933 035 $a(SSID)ssj0000446386 035 $a(PQKBManifestationID)11297670 035 $a(PQKBTitleCode)TC0000446386 035 $a(PQKBWorkID)10496066 035 $a(PQKB)10643613 035 $a(DE-He213)978-3-642-14031-0 035 $a(MiAaPQ)EBC3065479 035 $a(PPN)149064233 035 $a(EXLCZ)992670000000028933 100 $a20100628d2010 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aComputing and Combinatorics$b[electronic resource] $e16th Annual International Conference, COCOON 2010, Nha Trang, Vietnam, July 19-21, 2010 Proceedings /$fedited by My T. Thai, Sartaj Sahni 205 $a1st ed. 2010. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2010. 215 $a1 online resource (553 p. 103 illus.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v6196 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-642-14030-0 320 $aIncludes bibliographical references and index. 327 $aInvited Talks -- Understanding and Inductive Inference -- Computing with Cells: Membrane Systems -- Complexity and Inapproximability -- Boxicity and Poset Dimension -- On the Hardness against Constant-Depth Linear-Size Circuits -- A K-Provers Parallel Repetition Theorem for a Version of No-Signaling Model -- The Curse of Connectivity: t-Total Vertex (Edge) Cover -- Counting Paths in VPA Is Complete for #NC 1 -- Depth-Independent Lower Bounds on the Communication Complexity of Read-Once Boolean Formulas -- Approximation Algorithms -- Multiplying Pessimistic Estimators: Deterministic Approximation of Max TSP and Maximum Triangle Packing -- Clustering with or without the Approximation -- A Self-stabilizing 3-Approximation for the Maximum Leaf Spanning Tree Problem in Arbitrary Networks -- Approximate Weighted Farthest Neighbors and Minimum Dilation Stars -- Approximated Distributed Minimum Vertex Cover Algorithms for Bounded Degree Graphs -- Graph Theory and Algorithms -- Maximum Upward Planar Subgraph of a Single-Source Embedded Digraph -- Triangle-Free 2-Matchings Revisited -- The Cover Time of Deterministic Random Walks -- Finding Maximum Edge Bicliques in Convex Bipartite Graphs -- A Note on Vertex Cover in Graphs with Maximum Degree 3 -- Computing Graph Spanners in Small Memory: Fault-Tolerance and Streaming -- Factorization of Cartesian Products of Hypergraphs -- Graph Drawing and Coloring -- Minimum-Segment Convex Drawings of 3-Connected Cubic Plane Graphs -- On Three Parameters of Invisibility Graphs -- Imbalance Is Fixed Parameter Tractable -- The Ramsey Number for a Linear Forest versus Two Identical Copies of Complete Graphs -- Computational Geometry -- Optimal Binary Space Partitions in the Plane -- Exact and Approximation Algorithms for Geometric and Capacitated Set Cover Problems -- Effect of Corner Information in Simultaneous Placement of K Rectangles and Tableaux -- Detecting Areas Visited Regularly -- Tile-Packing Tomography Is -hard -- The Rectilinear k-Bends TSP -- Tracking a Generator by Persistence -- Auspicious Tatami Mat Arrangements -- Automata, Logic, Algebra and Number Theory -- Faster Generation of Shorthand Universal Cycles for Permutations -- The Complexity of Word Circuits -- On the Density of Regular and Context-Free Languages -- Extensions of the Minimum Cost Homomorphism Problem -- The Longest Almost-Increasing Subsequence -- Universal Test Sets for Reversible Circuits -- Approximate Counting with a Floating-Point Counter -- Network Optimization and Scheduling Algorithm -- Broadcasting in Heterogeneous Tree Networks -- Contention Resolution in Multiple-Access Channels: k-Selection in Radio Networks -- Online Preemptive Scheduling with Immediate Decision or Notification and Penalties -- Computational Biology and Bioinformatics -- Discovering Pairwise Compatibility Graphs -- Near Optimal Solutions for Maximum Quasi-bicliques -- Fast Coupled Path Planning: From Pseudo-Polynomial to Polynomial -- Constant Time Approximation Scheme for Largest Well Predicted Subset -- On Sorting Permutations by Double-Cut-and-Joins -- A Three-String Approach to the Closest String Problem -- A 2k Kernel for the Cluster Editing Problem -- Data Structure and Sampling Theory -- On the Computation of 3D Visibility Skeletons -- The Violation Heap: A Relaxed Fibonacci-Like Heap -- Threshold Rules for Online Sample Selection -- Heterogeneous Subset Sampling -- Cryptography, Security, Coding and Game Theory -- Identity-Based Authenticated Asymmetric Group Key Agreement Protocol -- Zero-Knowledge Argument for Simultaneous Discrete Logarithms -- Directed Figure Codes: Decidability Frontier. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v6196 606 $aAlgorithms 606 $aComputer science?Mathematics 606 $aDiscrete mathematics 606 $aComputer networks 606 $aComputer science 606 $aComputer graphics 606 $aArtificial intelligence 606 $aAlgorithms 606 $aDiscrete Mathematics in Computer Science 606 $aComputer Communication Networks 606 $aTheory of Computation 606 $aComputer Graphics 606 $aArtificial Intelligence 615 0$aAlgorithms. 615 0$aComputer science?Mathematics. 615 0$aDiscrete mathematics. 615 0$aComputer networks. 615 0$aComputer science. 615 0$aComputer graphics. 615 0$aArtificial intelligence. 615 14$aAlgorithms. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aComputer Communication Networks. 615 24$aTheory of Computation. 615 24$aComputer Graphics. 615 24$aArtificial Intelligence. 676 $a511/.6 702 $aThai$b My T$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aSahni$b Sartaj$4edt$4http://id.loc.gov/vocabulary/relators/edt 712 12$aCOCOON 2010 906 $aBOOK 912 $a996465859403316 996 $aComputing and Combinatorics$9772278 997 $aUNISA