//]]>

Computing and Combinatorics (Record no. 13030)

000 -LEADER
fixed length control field 05690nam a22005295i 4500
003 - CONTROL NUMBER IDENTIFIER
control field OSt
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20140310144050.0
007 - PHYSICAL DESCRIPTION FIXED FIELD--GENERAL INFORMATION
fixed length control field cr nn 008mamaa
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 100628s2010 gw | s |||| 0|eng d
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9783642140310
978-3-642-14031-0
050 #4 - LIBRARY OF CONGRESS CALL NUMBER
Classification number QA76.9.A43
082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER
Classification number 005.1
Edition number 23
264 #1 -
-- Berlin, Heidelberg :
-- Springer Berlin Heidelberg,
-- 2010.
912 ## -
-- ZDB-2-SCS
-- ZDB-2-LNC
100 1# - MAIN ENTRY--PERSONAL NAME
Personal name Thai, My T.
Relator term editor.
245 10 - IMMEDIATE SOURCE OF ACQUISITION NOTE
Title Computing and Combinatorics
Medium [electronic resource] :
Remainder of title 16th Annual International Conference, COCOON 2010, Nha Trang, Vietnam, July 19-21, 2010. Proceedings /
Statement of responsibility, etc edited by My T. Thai, Sartaj Sahni.
300 ## - PHYSICAL DESCRIPTION
Extent 553p. 103 illus.
Other physical details online resource.
440 1# - SERIES STATEMENT/ADDED ENTRY--TITLE
Title Lecture Notes in Computer Science,
International Standard Serial Number 0302-9743 ;
Volume number/sequential designation 6196
505 0# - FORMATTED CONTENTS NOTE
Formatted contents note Invited 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.
520 ## - SUMMARY, ETC.
Summary, etc This book constitutes the proceedings of the 16th Annual International Conference on Computing and Combinatorics, held in Nha Trang, Vietnam, in July 2010.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Computer science.
Topical term or geographic name as entry element Computer Communication Networks.
Topical term or geographic name as entry element Computer software.
Topical term or geographic name as entry element Computational complexity.
Topical term or geographic name as entry element Artificial intelligence.
Topical term or geographic name as entry element Computer graphics.
Topical term or geographic name as entry element Computer Science.
Topical term or geographic name as entry element Algorithm Analysis and Problem Complexity.
Topical term or geographic name as entry element Discrete Mathematics in Computer Science.
Topical term or geographic name as entry element Computer Communication Networks.
Topical term or geographic name as entry element Computation by Abstract Devices.
Topical term or geographic name as entry element Computer Graphics.
Topical term or geographic name as entry element Artificial Intelligence (incl. Robotics).
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Sahni, Sartaj.
Relator term editor.
710 2# - ADDED ENTRY--CORPORATE NAME
Corporate name or jurisdiction name as entry element SpringerLink (Online service)
773 0# - HOST ITEM ENTRY
Title Springer eBooks
776 08 - ADDITIONAL PHYSICAL FORM ENTRY
Display text Printed edition:
International Standard Book Number 9783642140303
856 40 - ELECTRONIC LOCATION AND ACCESS
Uniform Resource Identifier http://dx.doi.org/10.1007/978-3-642-14031-0
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Source of classification or shelving scheme
Item type E-Book
Copies
Price effective from Permanent location Date last seen Not for loan Date acquired Source of classification or shelving scheme Koha item type Damaged status Lost status Withdrawn status Current location Full call number
2014-03-27AUM Main Library2014-03-27 2014-03-27 E-Book   AUM Main Library005.1
Languages: 
English |
العربية