Please help us by posting the call for papers. Click here for a Call for Papers which is suitable for posting.
The series of IWOCA conferences grew out of a 17 year history of AWOCA- Australasian Workshops on Combinatorial Algorithms. Previous AWOCA and IWOCA meetings have been held in Australia, Indonesia, Korea, Japan and Czech Republic. IWOCA 2012 continues the long and well-established tradition of encouraging high-quality research in theoretical computer science and bringing together specialists and young researchers working in the area. The scientific program will include invited lectures covering the areas of main interest, accepted contributed talks, posters, and a problem session.
The topics of the workshop include (but are not restricted to)
Algorithms and Data Structures
Applications (including Bioinformatics, Networking, etc.)
Combinatorics of Words and Strings
Decompositions and Combinatorial Designs
Complexity Theory (Structural and Computational)
Discrete and Computational Geometry (including Graph Drawing)
Databases (Security, Compression and Information Retrieval)
Graph Theory and Combinatorics
The paper submission must not exceed 12 pages in Springer-Verlag LNCS LaTeX style. A clearly marked appendix that will be read at the discretion of the program committee may be added. Simultaneous submission of papers to any other conference with published proceedings or submitting previously published papers is not allowed. Only electronic submissions in postscript or pdf formats are accepted. Those who wish to present a poster should submit a copy of the poster or a two-page summary of its content.
Click here to access Easy Chair for your submissions.
The conference proceedings will be published after the conference as a volume of Springer-Verlag Lecture Notes in Computer Science.