Call for participation

 

18th Annual International Computing and Combinatorics Conference (COCOON 2012)
August 20-22, 2012
Novotel Sydney on Darling Harbour, Sydney, Australia

Registration is open:

Everyone attending the conference must pay a registration fee. Early registration and student registration discounts end on July 20. For more details on the registration process, see the registration page

Important dates:

  • Early registration ends: July 20, 2012
  • Student registration ends: July 20, 2012
  • Conference: August 20-22, 2012

Invited speakers

  • Kamal Jain, Ebay
  • Joseph Mitchell, SUNY at Stony Brook
  • Janos Pach, EPFL

Student grants:

There is a limited number of student grants consisting in free registration. These grants will be given based on the merits of the applicants. Priority will be given to students presenting a paper at the meeting. More information for the application process for these grants is available from the student grants page.

Final Paper Submission

 

The deadline for submitting the final version is May 12. Your final submission must include:

  • All the source files and a pdf version of the final submission
  • A scanned image file of a completed and signed copyright form

All files should be compressed into a single zip file and uploaded into easychair.

Guidelines for preparing the final version of your paper.

The proceedings of COCOON 2012 will be published in Springer-Verlag Lecture Note in Computer Science series. Read carefully Springer's instructions on preparing the manuscript. We request that you use LaTeX with the llncs.cls style file. Keep in mind that the length of your paper should not exceed 12 pages in LNCS style.

Guidelines for preparing the copyright form

One author of each accepted paper must sign Springer's copyright form. Please include the following information when filling the form:

  • Title of the Book or Conference Name: 18th Annual International Computing and Combinatorics Conference
  • Volume Editor(s): J. Gudmundsson, J. Mestre and A. Viglas

Submission instructions

 

Authors are invited to submit an extended abstract of original research on Computing and Combinatorics. Submissions must contain 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. Simultaneous submission to a journal or another conference with refereed proceedings is not allowed.

Submissions must adhere to the following guidelines:

  • Papers must be formatted using the LNCS style file without altering margins or the font point.
  • The maximum length of the paper (including references, but excluding the optional appendix) is 12 pages.
  • Proofs omitted due to space constraints must be placed in an appendix to be read by the program committee members at their discretion.

Papers that deviate from these guidelines risk being rejected without consideration of their merits.

Papers should be submitted electronically via EasyChair. The submission deadline is February 18, 2012 February 28, 2012 (Anywhere on Earth).

pdf

Call for Papers

 

The 18th International Computing and Combinatorics Conference (COCOON'2012) will be held in the city of Sydney, Australia, in August 20--22, 2012.

Original research papers in the areas of algorithms, theory of computation, computational complexity, and combinatorics related to computing are solicited. In addition to theoretical results, we are particularly interested in submissions that report on experimental and applied research of general algorithmic interest. Special consideration will be given to research that is motivated by real-world problems. Experimental and applied papers are expected to show convincingly the usefulness and efficiency of the algorithms discussed in a practical setting. Typical, but not exclusive, topics of interest include:

  • 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
  • Parallel and Distributed Computing

The conference proceedings will be published by Springer-Verlag in the Lecture Notes in Computer Science series. High quality papers will be invited to a special issue in Algorithmica.