IWOCA 2014 - International Workshop on Combinatorial Algorithms
Topics/Call fo Papers
The series of IWOCA conferences grew out of over 20 years history of AWOCA - Australasian Workshops on Combinatorial Algorithms. Previous AWOCA and IWOCA meetings have been held in Australia, Canada, Czech Republic, England, France, Indonesia, Korea, and Japan.
IWOCA 2014 continues the long and well-established tradition of encouraging high-quality research in theoretical computer science and providing an opportunity to bring together specialists and young researchers working in the area. The scientific program will include invited lectures covering the areas of main interest, accepted contributing talks, posters, and a problem session.
The topics include (but are not restricted to)
Algorithms and Data Structures (including sequential, parallel, distributed, approximation, graph, network, number theory, and on-line algorithms)
Applications (Bioinformatics, Music Analysis, Networking, and others)
Combinatorial Enumeration
Combinatorial Optimization
Complexity Theory (Structural and Computational)
Computational Biology
Databases (Security, Compression and Information Retrieval)
Decompositions and Combinatorial Designs
Discrete and Computational Geometry (including Graph Drawing)
Graph Theory and Combinatorics
Submissions
The submission must not exceed 12 pages in Springer-Verlag Lecture Notes 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.
Proceedings
Invited papers and accepted contributions will be published in the conference proceedings in Lecture Notes in Computer Science, Springer-Verlag. These will be distributed after the conference.
IWOCA 2014 continues the long and well-established tradition of encouraging high-quality research in theoretical computer science and providing an opportunity to bring together specialists and young researchers working in the area. The scientific program will include invited lectures covering the areas of main interest, accepted contributing talks, posters, and a problem session.
The topics include (but are not restricted to)
Algorithms and Data Structures (including sequential, parallel, distributed, approximation, graph, network, number theory, and on-line algorithms)
Applications (Bioinformatics, Music Analysis, Networking, and others)
Combinatorial Enumeration
Combinatorial Optimization
Complexity Theory (Structural and Computational)
Computational Biology
Databases (Security, Compression and Information Retrieval)
Decompositions and Combinatorial Designs
Discrete and Computational Geometry (including Graph Drawing)
Graph Theory and Combinatorics
Submissions
The submission must not exceed 12 pages in Springer-Verlag Lecture Notes 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.
Proceedings
Invited papers and accepted contributions will be published in the conference proceedings in Lecture Notes in Computer Science, Springer-Verlag. These will be distributed after the conference.
Other CFPs
- 2nd Workshop on View-Based, Aspect-Oriented and Orthographic Software Modelling
- Call for Book Chapters: Intelligent Approaches for Control and Synchronization of Chaotic Systems
- Workshop on Statistical Relational Artificial Intelligence (StarAI)
- Madrid Summer School on Advanced Statistics and Data Mining
- Fourth International Conference on Innovative Computing Technology
Last modified: 2014-03-26 22:20:57