COCOON' 2009 - The 15th International Computing and Combinatorics Conference (COCOON'2009)
Topics/Call fo Papers
The 15th International Computing and Combinatorics Conference (COCOON'2009) will be held in the city of Niagara Falls, New York, U.S.A., July 13--15, 2009. The conference venue is a few steps away from Niagara Falls, the most famous water Falls in the world. The venue is also within 20 minutes of the State University of New York at Buffalo (SUNY Buffalo). SUNY Buffalo¡¯s Computer Science and Engineering department is a sponsor.
Original research papers in the areas of algorithms, theory of computation, computational complexity, and combinatorics related to computing are solicited. In addition to theoretical studies, submissions that report on experimental and applied research of general algorithmic interest are also encouraged.
Topics of interest include, but are not limited to, the following:
Algorithms and data structures
Algorithmic game theory
Automata, languages, logic, and computability
Combinatorics related to algorithms and complexity
Complexity theory
Computational learning theory and knowledge discovery
Cryptography, reliability and security
Database theory
Computational biology and bioinformatics
Computational algebra, geometry, and number theory
Graph drawing and information visualization
Graph theory, communication networks, and optimization
Parallel and distributed computing.
COCOON will only accept electronic submissions in PDF format. A submission should start with the title of the paper, each author's name, affiliation, and e-mail address, and a one-paragraph summary of the results. This should be followed by a scholarly exposition of the ideas, techniques, and a full description of the results achieved. A clear indication of the motivation and comparison with prior or related work should be presented. The paper should not exceed 10 pages, excluding bibliography and appendices, on letter-size paper using 11 point or larger font.
The proceedings of conference will be published by Springer-Verlag in the Lecture Notes in Computer Science (LNCS) series. High quality papers will be invited to a special issue in Algorithmica and/or Journal of Combinatorial Optimization.
Technical Program Committee
Srinivas Aluru (Iowa State)
Vikraman Arvind (Inst. Math. Sci., India)
James Aspnes (Yale)
Mikhail Atallah (Purdue)
Gill Barequet (Technion, Israel)
Michael Brudno (Univ. Toronto)
Jianer Chen (Texas A&M)
Francis Chin (Univ. Hong Kong)
Bhaskar DasGupta (Univ. Illinois at Chicago)
Anupam Gupta (CMU)
Lane A. Hemaspaandra (Univ. Rochester)
Kazuo Iwama (Kyoto Univ.)
Xiang-Yang Li (Illinois Inst. Tech.)
Avner Magen (Univ. Toronto)
Peter Bro Miltersen (Univ. Aarhus, Denmark)
Hung Q. Ngo (SUNY Buffalo, Chair)
Mohamad Salavatipour (Univ. Alberta)
Alan Selman (SUNY Buffalo)
Maria Serna (Politecnica de Catalunya, Spain)
Hans Ulrich Simon (Ruhr-Univ. Bochum, Ger.)
Daniel Stefankovic (Univ. Rochester)
Chaitanya Swamy (Univ. Waterloo)
My T. Thai (Univ. Florida)
Original research papers in the areas of algorithms, theory of computation, computational complexity, and combinatorics related to computing are solicited. In addition to theoretical studies, submissions that report on experimental and applied research of general algorithmic interest are also encouraged.
Topics of interest include, but are not limited to, the following:
Algorithms and data structures
Algorithmic game theory
Automata, languages, logic, and computability
Combinatorics related to algorithms and complexity
Complexity theory
Computational learning theory and knowledge discovery
Cryptography, reliability and security
Database theory
Computational biology and bioinformatics
Computational algebra, geometry, and number theory
Graph drawing and information visualization
Graph theory, communication networks, and optimization
Parallel and distributed computing.
COCOON will only accept electronic submissions in PDF format. A submission should start with the title of the paper, each author's name, affiliation, and e-mail address, and a one-paragraph summary of the results. This should be followed by a scholarly exposition of the ideas, techniques, and a full description of the results achieved. A clear indication of the motivation and comparison with prior or related work should be presented. The paper should not exceed 10 pages, excluding bibliography and appendices, on letter-size paper using 11 point or larger font.
The proceedings of conference will be published by Springer-Verlag in the Lecture Notes in Computer Science (LNCS) series. High quality papers will be invited to a special issue in Algorithmica and/or Journal of Combinatorial Optimization.
Technical Program Committee
Srinivas Aluru (Iowa State)
Vikraman Arvind (Inst. Math. Sci., India)
James Aspnes (Yale)
Mikhail Atallah (Purdue)
Gill Barequet (Technion, Israel)
Michael Brudno (Univ. Toronto)
Jianer Chen (Texas A&M)
Francis Chin (Univ. Hong Kong)
Bhaskar DasGupta (Univ. Illinois at Chicago)
Anupam Gupta (CMU)
Lane A. Hemaspaandra (Univ. Rochester)
Kazuo Iwama (Kyoto Univ.)
Xiang-Yang Li (Illinois Inst. Tech.)
Avner Magen (Univ. Toronto)
Peter Bro Miltersen (Univ. Aarhus, Denmark)
Hung Q. Ngo (SUNY Buffalo, Chair)
Mohamad Salavatipour (Univ. Alberta)
Alan Selman (SUNY Buffalo)
Maria Serna (Politecnica de Catalunya, Spain)
Hans Ulrich Simon (Ruhr-Univ. Bochum, Ger.)
Daniel Stefankovic (Univ. Rochester)
Chaitanya Swamy (Univ. Waterloo)
My T. Thai (Univ. Florida)
Other CFPs
- 29th International Cryptology ConferenceCRYPTO 2009
- The Fifth International Conference on Intelligent Information Hiding and Multimedia Signal Processing(IIH-MSP 2009 )
- 7th ACIS International Conference on Software Engineering Research, Management and Applications (SERA2009)
- 2013 IEEE Systems and Information Engineering Design Symposium (SIEDS)
- The International Conference on Multiple Comparison Procedures(MCP2009)
Last modified: 2010-06-04 19:32:22