Synopses & Reviews
The refereed proceedings of the 14th Annual International Computing and Combinatorics Conference, COCOON 2008, held in Dalian, China, in June 2008. The 66 revised full papers presented were carefully reviewed and selected from 172 submissions. The papers are organized in topical sections on algorithms and data structures, algorithmic game theory and online algorithms, automata, languages, logic, and computability, combinatorics related to algorithms and complexity, complexity theory, cryptography, reliability and security, and database theory, computational biology and bioinformatics, computational algebra, geometry, and number theory, graph drawing and information visualization, graph theory and algorithms, communication networks, and optimization, wireless network, network optimization, and scheduling problem.
Synopsis
The 14th Annual International Computing and Combinatorics Conference, CO- COON2008, tookplaceinDalian, China, June27-29,2008.PastCOCOONc- ferences were held in Xi'an (1995), Hong Kong (1996), Shanghai (1997), Taipei (1998), Tokyo (1999), Sydney (2000), Guilin (2001), Singapore (2002), Montana (2003), Jeju Island (2004), Kunming (2005), Taipei (2006), and Alberta (2007). COCOON 2008 provided a forum for researchers working in the areas of - gorithms, theory of computation, computational complexity, and combinatorics related to computing. The Program Committee received 172 submissions from 26 countries and regions: Canada, Australia, Austria, Brazil, China, Denmark, France, Germany, HongKong, Hungary, India, Iran, Israel, Japan, Korea, Mexico, Morocco, Netherlands, Pakistan, Singapore, Spain, Switzerland, Taiwan, Ukraine, the UK, and USA. With the help of 116 external referees, each submission was reviewed by at least two Program Committee members or external referees. Of the 172 subm- sions,66paperswereselectedforpresentationintheconferenceandareincluded in this volume. Some of these will be selected for publication in a special issue of Algorithmica and a special issue of the Journal of Combinatorial Optimization under the standard refereeing procedure. In addition to the selected papers, the conference also included two invited presentations by Der-Tsai Lee (Academia Sinica, Taiwan) and Takao Nishizeki (Tohoku University, Japan). The best paper awards were given for "Visual Cryptography on Graphs" to Lu, Manchala and Ostrovsky, and for "A Linear Programming Duality - proach to Analyzing Strictly Nonblocking d-ary Multilog Networks under G- eral Crosstalk Constraints" to Ngo, Wang and Le.