Computing and Combinatorics 14th International Conference, COCOON 2008 Dalian, China, June 2729, 2008, Proceedings
The refereed proceedings of the 14th Annual International Computing and Combinatorics Conference, COCOON 2008, held in Dalian, China, in June 2008. The 66 revised full papers presented were carefully reviewed and selected from 172 submissions. The papers are organized in topical sections on algorith...
Other Authors:  , 

Format:  eBook 
Language:  English 
Published: 
Berlin, Heidelberg
Springer Berlin Heidelberg
2008, 2008

Edition:  1st ed. 2008 
Series:  Theoretical Computer Science and General Issues

Subjects:  
Online Access:  
Collection:  Springer eBooks 2005  Collection details see MPG.ReNa 
Table of Contents:
 Graph Theory and Algorithms
 A New Characterization of P 6Free Graphs
 Maximum Connected Domatic Partition of Directed Path Graphs with Single Junction
 Efficient Algorithms for the k Smallest Cuts Enumeration
 Covering Directed Graphs by InTrees
 On Listing, Sampling, and Counting the Chordal Graphs with Edge Constraints
 Probe Ptolemaic Graphs
 Communication Networks and Optimization
 Diagnosability of TwoMatching Composition Networks
 The Iterated Restricted Immediate Snapshot Model
 Finding Frequent Items in a Turnstile Data Stream
 A Linear Programming Duality Approach to Analyzing Strictly Nonblocking dary Multilog Networks under General Crosstalk Constraints
 Optimal Tree Structures for Group Key Tree Management ConsideringInsertion and Deletion Cost
 Wireless Network
 Throughput Maximization with Traffic Profile in Wireless Mesh Network
 Algorithms and Data Structures
 Efficient Compression of Web Graphs
 Damaged BZip Files Are Difficult to Repair
 Isoperimetric Problem and Metafibonacci Sequences
 Algorithmic Game Theory and Online Algorithms
 On the Complexity of Equilibria Problems in AngelDaemon Games
 AverageCase Competitive Analyses for OneWay Trading
 On the Monotonicity of Weak Searching
 Automata, Languages, Logic, and Computability
 VC Dimension Bounds for Analytic Algebraic Computations
 Resource Bounded Frequency Computations with Three Errors
 A Sublinear Time Randomized Algorithm for Coset Enumeration in the Black Box Model
 Smallest Formulas for Parity of 2 k Variables Are Essentially Unique
 Combinatorics Related to Algorithms and Complexity
 Counting Polycubes without the Dimensionality Curse
 Polychromatic Colorings of nDimensional GuillotinePartitions
 The Computational Complexity of Link Building
 Joint Topology Control and Power Conservation for Wireless Sensor Networks Using Transmit Power Adjustment
 (6?+??)Approximation for Minimum Weight Dominating Set in Unit Disk Graphs
 Spectrum Bidding in Wireless Networks and Related
 Network Optimization
 (1?+??)Approximation for SelectedInternal Steiner Minimum Tree
 Computing Maximum Flows in Undirected Planar Networks with Both Edge and Vertex Capacities
 Spreading Messages
 On Some City Guarding Problems
 Optimal Insertion of a Segment Highway in a City Metric
 Approximating the Generalized Capacitated TreeRouting Problem
 Column Generation Algorithms for the Capacitated mRingStar Problem
 Scheduling Problem
 TwoAgent Scheduling with Linear Deteriorating Jobs on a Single Machine
 A TwoStage Flexible Flowshop Problem with Deterioration
 A Lower Bound for the OnLine Preemptive Machine Scheduling with ? p Norm
 The Coordination of Two Parallel Machines Scheduling and Batch Deliveries
 Improved Parameterized Algorithms for Weighted 3Set Packing
 Structural Identifiability in LowRank Matrix Factorization
 Complexity of Counting the Optimal Solutions
 Complexity Theory
 The Orbit Problem Is in the GapL Hierarchy
 Quantum Separation of Local Search and Fixed Point Computation
 Multiparty Quantum Communication Complexity with Routed Messages
 Monotone DNF Formula That Has a Minimal or Maximal Number of Satisfying Assignments
 Approximating Alternative Solutions
 Dimensions of Points in Selfsimilar Fractals
 Cryptography, Reliability and Security, and Database Theory
 Visual Cryptography on Graphs
 Algebraic Cryptanalysis of CTRU Cryptosystem
 Computational Biology and Bioinformatics – Model
 Detecting Community Structure by Network Vectorization
 Quasibicliques: Complexity and Binding Pairs
 Complexity of a CollisionAware StringPartition Problem and Its Relation to Oligo Design for Gene Synthesis
 Genome Halving under DCJ Revisited
 Haplotype Inferring Via GalledTree Networks Is NPComplete
 Computational Biology and Bioinformatics – Algorithms
 Adjacent Swaps on Strings
 Efficient Algorithms for SNP Haplotype Block Selection Problems
 Sequence Alignment Algorithms for RunLengthEncoded Strings
 A 2.25Approximation Algorithm for CutandPaste Sorting of Unsigned Circular Permutations
 A Practical Exact Algorithm for the Individual Haplotyping Problem MEC/GI
 Computational Algebra, Geometry, and Number Theory
 Voronoi Diagram of Polygonal Chains under the Discrete Fréchet Distance
 On Center Regions and Balls Containing Many Points
 On Unfolding 3D Lattice Polygons and 2D Orthogonal Trees
 New Algorithms for Online Rectangle Filling with kLookahead
 Geometric Spanner of Objects under L 1 Distance
 Graph Drawing and Information Visualization
 StarShaped Drawings of Graphs with Fixed Embedding and Concave Corner Constraints