LEADER 05601nam 2200589 a 450 001 9910484793103321 005 20200520144314.0 010 $a3-540-36926-0 024 7 $a10.1007/11809678 035 $a(CKB)1000000000236491 035 $a(SSID)ssj0000316943 035 $a(PQKBManifestationID)11238022 035 $a(PQKBTitleCode)TC0000316943 035 $a(PQKBWorkID)10287265 035 $a(PQKB)11556206 035 $a(DE-He213)978-3-540-36926-4 035 $a(MiAaPQ)EBC3068055 035 $a(PPN)123137101 035 $a(EXLCZ)991000000000236491 100 $a20060623d2006 uy 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aComputing and combinatorics $e12th annual international conference, COCOON 2006, Taipei, Taiwan, August 15-18, 2006 : proceedings /$fDanny Z. Chen, D.T. Lee (eds.) 205 $a1st ed. 2006. 210 $aBerlin $cSpringer$d2006 215 $a1 online resource (XIV, 530 p.) 225 1 $aLecture notes in computer science,$x0302-9743 ;$v4112 225 1 $aLNCS sublibrary. SL 1, Theoretical computer science and general issues 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-36925-2 320 $aIncludes bibliographical references and index. 327 $aInvited Talks -- The Unpredictable Deviousness of Models -- Security Issues in Collaborative Computing -- Session A -- A Simplicial Approach for Discrete Fixed Point Theorems -- On Incentive Compatible Competitive Selection Protocol -- Edge Pricing of Multicommodity Networks for Selfish Users with Elastic Demands -- Aggregating Strategy for Online Auctions -- On Indecomposability Preserving Elimination Sequences -- Improved Algorithms for the Minmax Regret 1-Median Problem -- Partitioning a Multi-weighted Graph to Connected Subgraphs of Almost Uniform Size -- Characterizations and Linear Time Recognition of Helly Circular-Arc Graphs -- Varieties Generated by Certain Models of Reversible Finite Automata -- Iterated TGR Languages: Membership Problem and Effective Closure Properties -- On the Negation-Limited Circuit Complexity of Sorting and Inverting k-tonic Sequences -- Robust Quantum Algorithms with ?-Biased Oracles -- The Complexity of Black-Box Ring Problems -- Lower Bounds and Parameterized Approach for Longest Common Subsequence -- Finding Patterns with Variable Length Gaps or Don?t Cares -- The Matrix Orthogonal Decomposition Problem in Intensity-Modulated Radiation Therapy -- A Polynomial-Time Approximation Algorithm for a Geometric Dispersion Problem -- A PTAS for Cutting Out Polygons with Lines -- On Unfolding Lattice Polygons/Trees and Diameter-4 Trees -- Restricted Mesh Simplification Using Edge Contractions -- Enumerating Non-crossing Minimally Rigid Frameworks -- Sequences Characterizing k-Trees -- On the Threshold of Having a Linear Treewidth in Random Graphs -- Reconciling Gene Trees with Apparent Polytomies -- Lower Bounds on the Approximation of the Exemplar Conserved Interval Distance Problem of Genomes -- Computing Maximum-Scoring Segments in Almost Linear Time -- Session B -- Enumerate and Expand: New Runtime Bounds for Vertex Cover Variants -- A Detachment Algorithm for Inferring a Graph from Path Frequency -- The d-Identifying Codes Problem for Vertex Identification in Graphs: Probabilistic Analysis and an Approximation Algorithm -- Reconstructing Evolution of Natural Languages: Complexity and Parameterized Algorithms -- On Dynamic Bin Packing: An Improved Lower Bound and Resource Augmentation Analysis -- Improved On-Line Broadcast Scheduling with Deadlines -- A Tight Analysis of Most-Requested-First for On-Demand Data Broadcast -- On Lazy Bin Covering and Packing Problems -- Creation and Growth of Components in a Random Hypergraph Process -- Optimal Acyclic Edge Colouring of Grid Like Graphs -- An Edge Ordering Problem of Regular Hypergraphs -- Efficient Partially Blind Signature Scheme with Provable Security -- A Rigorous Analysis for Set-Up Time Models ? A Metric Perspective -- Geometric Representation of Graphs in Low Dimension -- The On-Line Heilbronn?s Triangle Problem in d Dimensions -- Counting d-Dimensional Polycubes and Nonrectangular Planar Polyominoes -- Approximating Min-Max (Regret) Versions of Some Polynomial Problems -- The Class Constrained Bin Packing Problem with Applications to Video-on-Demand -- MAX-SNP Hardness and Approximation of Selected-Internal Steiner Trees -- Minimum Clique Partition Problem with Constrained Weight for Interval Graphs -- Overlap-Free Regular Languages -- On the Combinatorial Representation of Information -- Finding Small OBDDs for Incompletely Specified Truth Tables Is Hard -- Bimodal Crossing Minimization -- Fixed Linear Crossing Minimization by Reduction to the Maximum Cut Problem -- On the Effectiveness of the Linear Programming Relaxation of the 0-1 Multi-commodity Minimum Cost Network Flow Problem. 410 0$aLecture notes in computer science ;$v4112. 410 0$aLNCS sublibrary.$nSL 1,$pTheoretical computer science and general issues. 517 3 $aCOCOON 2006 606 $aComputer science$vCongresses 606 $aCombinatorial analysis$vCongresses 615 0$aComputer science 615 0$aCombinatorial analysis 676 $a004 701 $aChen$b Danny Z$01750603 701 $aLee$b Der-Tsai$01750602 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910484793103321 996 $aComputing and combinatorics$94193607 997 $aUNINA