LEADER 04974nam  22008175  450 
001 996465283703316
005 20230220154447.0
010   $a3-642-32241-7
024 7 $a10.1007/978-3-642-32241-9
035   $a(CKB)3400000000085728
035   $a(SSID)ssj0000745881
035   $a(PQKBManifestationID)11411478
035   $a(PQKBTitleCode)TC0000745881
035   $a(PQKBWorkID)10859624
035   $a(PQKB)10315127
035   $a(DE-He213)978-3-642-32241-9
035   $a(MiAaPQ)EBC3070282
035   $a(PPN)16832136X
035   $a(EXLCZ)993400000000085728
100   $a20120813d2012      u|             0
101 0 $aeng
135   $aurnn|008mamaa
181   $ctxt
182   $cc
183   $acr
200 10$aComputing and Combinatorics$b[electronic resource] $e18th Annual International Conference, COCOON 2012, Sydney, Australia, August 20-22, 2012, Proceedings /$fedited by Joachim Gudmundsson, Julián Mestre, Taso Viglas
205   $a1st ed. 2012.
210  1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2012.
215   $a1 online resource (XIV, 606 p. 116 illus.) 
225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v7434
300   $aInternational conference proceedings.
311   $a3-642-32240-9 
320   $aIncludes bibliographical references and author index.
327   $aA 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.
330   $aThis 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.
410  0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v7434
606   $aAlgorithms
606   $aComputer science?Mathematics
606   $aDiscrete mathematics
606   $aComputer networks
606   $aComputer science
606   $aComputer graphics
606   $aArtificial intelligence
606   $aAlgorithms
606   $aDiscrete Mathematics in Computer Science
606   $aComputer Communication Networks
606   $aTheory of Computation
606   $aComputer Graphics
606   $aArtificial Intelligence
615  0$aAlgorithms.
615  0$aComputer science?Mathematics.
615  0$aDiscrete mathematics.
615  0$aComputer networks.
615  0$aComputer science.
615  0$aComputer graphics.
615  0$aArtificial intelligence.
615 14$aAlgorithms.
615 24$aDiscrete Mathematics in Computer Science.
615 24$aComputer Communication Networks.
615 24$aTheory of Computation.
615 24$aComputer Graphics.
615 24$aArtificial Intelligence.
676   $a005.1
702   $aGudmundsson$b Joachim$4edt$4http://id.loc.gov/vocabulary/relators/edt
702   $aMestre$b Julián$4edt$4http://id.loc.gov/vocabulary/relators/edt
702   $aViglas$b Taso$4edt$4http://id.loc.gov/vocabulary/relators/edt
712 12$aCOCOON (Conference)
906   $aBOOK
912   $a996465283703316
996   $aComputing and Combinatorics$9772278
997   $aUNISA