Computing and Combinatorics: 16th Annual International Conference, COCOON 2010, Nha Trang, Vietnam, July 19-21, 2010 Proceedings
My T. Thai, Sartaj Sahni
Springer Science & Business Media, Jul 5, 2010 - Computers - 553 pages
The papers in this volume were selected for presentation at the 16th Annual InternationalComputing and CombinatoricsConference (COCOON 2010), held duringJuly19-21,2010inNhaTrang,Vietnam.Previousmeetingsofthisconf- encewereheldinSingapore(2002),BigSky(2003),JejuIsland(2004),Kunming (2005), Taipei (2006), Alberta (2007), Dalian (2008) and New York (2009). COCOON 2010 provided a forum for researchers working in the areas of - gorithms, theory of computation, computational complexity, and combinatorics related to computing. In all, 133 papers were submitted from 40 countries and regions, of which 54 were accepted. Authors of the submitted papers were from Australia (10), Bangladesh (11), Belgium (1), Canada (23), Chile (1), China (20), Colombia (1), Czech Republic (6), Denmark (1), France (25), France(1), Germany (13), Greece (2), Hong Kong (7), Hungary (2), India (18), Indonesia (8),IslamicRepublicofIran(2),Ireland(1),Israel(6),Italy(6),Japan(31),- publicofKorea(4),Malaysia(1),TheNetherlands(2),NewZealand(2),Norway (3), Pakistan (1), Poland (1), Portugal (1), Russian Federation (3), Singapore (6), Slovakia (1), Spain (7), Sweden (2), Taiwan (19), Thailand (2), UK (2), USA (44), and Vietnam (15). The submitted papers wereevaluated by an internationalTechnical Program Committee (TPC). Each paper was evaluated by at least three TPC members, with possible assistance of the external referees, as indicated by the referee list found in the proceedings. Some of these 54 accepted papers will be selected for publication in a special issue of Algorithmica, Journal of Combinatorial - timization,and Discrete Mathematics, Algorithms, and Application under the standard refereeing procedure. In addition to the selected papers, the conf- ence also included two invited presentations by Manuel Blum (Carnegie Mellon University) and Oscar H. Ibarra (University of California Santa Barbara).
What people are saying - Write a review
We haven't found any reviews in the usual places.
Other editions - View all
2-matching adjacent approximation algorithm Berlin Heidelberg 2010 biclique binary bipartite graph broadcast called Cartesian product CCPP cluster complete graph complexity Computer Science conﬁguration consider constraint contains context-free languages convex cycle decomposition deﬁne Deﬁnition denote deterministic diﬀerent dmax edges eﬃcient Fibonacci heaps ﬁnd ﬁnding ﬁnite ﬁrst ﬁxed function gates given graph G grid Heidelberg hypergraph input instance integer intersection interval graph Lemma length line-segment linear LNCS lower bound M.T. Thai maximal maximum minimum monomers neighbors node NP-complete NP-hard obtain optimal output pair parameter partition path permutation pessimistic estimators points polynomial polytopes poset problem Proof protocol prove randomized algorithm rectangles rectilinear result Sahni Eds satisﬁes segments sequence solution spanners Springer string subgraph subset subtree tatami Theorem tilings tour tree tsol upper bound upward planar variables vector vertex cover vertices weighted