TY  - BOOK
AU  - Gudmundsson,Joachim
AU  - Mestre,Julián
AU  - Viglas,Taso
TI  - Computing and Combinatorics: 18th Annual International Conference, COCOON 2012, Sydney, Australia, August 20-22, 2012. Proceedings 
SN  - 9783642322419
PY  - 2012///
CY  - Berlin, Heidelberg
PB  - Springer Berlin Heidelberg
KW  - Computer science
KW  - Computer communication systems
KW  - Computers
KW  - Algorithms
KW  - Mathematics
KW  - Artificial intelligence
KW  - Computer graphics
N1  - 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
UR  - http://dx.doi.org/10.1007/978-3-642-32241-9
ER  -