000 06057nam a22006255i 4500
001 978-3-540-36926-4
003 DE-He213
005 20240730185156.0
007 cr nn 008mamaa
008 100301s2006 gw | s |||| 0|eng d
020 _a9783540369264
_9978-3-540-36926-4
024 7 _a10.1007/11809678
_2doi
050 4 _aQA75.5-76.95
072 7 _aUYA
_2bicssc
072 7 _aCOM014000
_2bisacsh
072 7 _aUYA
_2thema
082 0 4 _a004.0151
_223
245 1 0 _aComputing and Combinatorics
_h[electronic resource] :
_b12th Annual International Conference, COCOON 2006, Taipei, Taiwan, August 15-18, 2006, Proceedings /
_cedited by Danny Z. Chen, D.T. Lee.
250 _a1st ed. 2006.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2006.
300 _aXIV, 530 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v4112
505 0 _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.
650 0 _aComputer science.
_99832
650 0 _aAlgorithms.
_93390
650 0 _aComputer science
_xMathematics.
_93866
650 0 _aDiscrete mathematics.
_912873
650 0 _aComputer networks .
_931572
650 0 _aArtificial intelligence
_xData processing.
_921787
650 0 _aComputer graphics.
_94088
650 1 4 _aTheory of Computation.
_9138197
650 2 4 _aAlgorithms.
_93390
650 2 4 _aDiscrete Mathematics in Computer Science.
_931837
650 2 4 _aComputer Communication Networks.
_9138198
650 2 4 _aData Science.
_934092
650 2 4 _aComputer Graphics.
_94088
700 1 _aChen, Danny Z.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9138199
700 1 _aLee, D.T.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9138200
710 2 _aSpringerLink (Online service)
_9138201
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540369257
776 0 8 _iPrinted edition:
_z9783540827337
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v4112
_9138202
856 4 0 _uhttps://doi.org/10.1007/11809678
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c92682
_d92682