| 000 -LEADER |
|---|
| fixed length control field |
04051nam a22005415i 4500 |
| 003 - CONTROL NUMBER IDENTIFIER |
|---|
| control field |
OSt |
| 005 - DATE AND TIME OF LATEST TRANSACTION |
|---|
| control field |
20140310144109.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 |
120813s2012 gw | s |||| 0|eng d |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER |
|---|
| International Standard Book Number |
9783642322419 |
|
978-3-642-32241-9 |
| 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 : |
| -- |
Imprint: Springer, |
| -- |
2012. |
| 912 ## - |
|---|
| -- |
ZDB-2-SCS |
|
|---|
| -- |
ZDB-2-LNC |
| 100 1# - MAIN ENTRY--PERSONAL NAME |
|---|
| Personal name |
Gudmundsson, Joachim. |
| Relator term |
editor. |
| 245 10 - IMMEDIATE SOURCE OF ACQUISITION NOTE |
|---|
| Title |
Computing and Combinatorics |
| Medium |
[electronic resource] : |
| Remainder of title |
18th Annual International Conference, COCOON 2012, Sydney, Australia, August 20-22, 2012. Proceedings / |
| Statement of responsibility, etc |
edited by Joachim Gudmundsson, Julián Mestre, Taso Viglas. |
| 300 ## - PHYSICAL DESCRIPTION |
|---|
| Extent |
XIV, 606 p. 116 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 |
7434 |
| 505 0# - FORMATTED CONTENTS NOTE |
|---|
| Formatted contents note |
A Linear Time Algorithm for Computing Minmax Regret 1-Median on a Tree -- A Simple D2-Sampling Based PTAS for k-Means and other Clustering Problems -- Speed Scaling for Maximum Lateness -- Induced Subgraph Isomorphism: Are Some Patterns Substantially -- Easier Than Others -- Minimum Single-Source-Multi-Sink Cuts in Weighted Planar Graphs -- Online Knapsack Problem with Removal Cost -- An Improved Exact Algorithm for TSP in Degree-4 Graphs -- Dynamic Programming for H-minor-free Graphs -- Restricted Max-Min Fair Allocations with Inclusion-Free Intervals -- An Improved Algorithm for Packing T-Paths in Inner Eulerian Networks -- Towards Optimal and Expressive Kernelization for d-Hitting Set.-Maximum Number of Minimal Feedback Vertex Sets in Chordal Graphs and Cographs -- A Local Algorithm for Finding Dense Bipartite-Like Subgraphs -- Algorithms for the Strong Chromatic Index of Halin Graphs, Distance-Hereditary Graphs and Maximal Outerplanar Graphs -- On the Minimum Degree Hypergraph Problem with Subset Size Two and the Red-Blue Set Cover Problem with the Consecutive Ones Property -- Rainbow Colouring of Split and Threshold -- Constant Time Enumeration of Bounded-Size Subtrees in Trees and Its Succinct Representations of Binary Trees for Range Minimum Queries. |
| 520 ## - SUMMARY, ETC. |
|---|
| Summary, etc |
This book constitutes the refereed proceedings of the 18th Annual International Conference on Computing and Combinatorics, held in Sydney, Australia, in August 2012. The 50 revised full papers presented were carefully reviewed and selected from 121 submissions. Topics covered are algorithms and data structures; algorithmic game theory and online algorithms; automata, languages, logic, and computability; combinatorics related to algorithms and complexity; complexity theory; computational learning theory and knowledge discovery; cryptography, reliability and security, and database theory; computational biology and bioinformatics; computational algebra, geometry, and number theory; graph drawing and information visualization; graph theory, communication networks, and optimization. |
| 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 |
Mestre, Julián. |
| Relator term |
editor. |
|
|---|
| Personal name |
Viglas, Taso. |
| 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 |
9783642322402 |
| 856 40 - ELECTRONIC LOCATION AND ACCESS |
|---|
| Uniform Resource Identifier |
http://dx.doi.org/10.1007/978-3-642-32241-9 |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) |
|---|
| Source of classification or shelving scheme |
|
| Item type |
E-Book |
