Authors are invited to submit papers describing original research of theoretical or practical significance to algorithms and computation. Papers should not exceed 12 pages for long papers and 6 pages for short papers in LNCS style. Papers must be labeled as either long or short and prepared using LaTeX/LaTeX2e. For paper submission, visit Submission Link. If the authors feel that more details are essential to substantiate the main claim of the paper, they may include a clearly marked appendix that will be read at the discretion of the program committee. Only electronic submission will be allowed. Submitted papers must describe work not previously published. They must not be submitted simultaneously to another conference with refereed proceedings or to a journal.
The range of topics within the scope of WALCOM 2013 includes (but is not limited to):
Approximation Algorithms | Combinatorial Algorithms | Combinatorial
Optimization |
Computational Biology | Computational Complexity | Computational
Geometry | Data Structures | Discrete Geometry | Experimental
Algorithm Methodologies |
Graph Algorithms | Graph Drawing | Parallel and Distributed
Algorithms | Parameterized Complexity | Network Optimization |
Online Algorithms | Randomized Algorithms | String Algorithms.
The proceedings of accepted papers is published in the Lecture Notes in Computer Science by Springer-Verlag: LNCS volume 7748. Special issues on WALCOM 2013 will be published in Theoretical Computer Science and in Journal of Graph Algorithms and Applications.