Difference between revisions of "WALCOM 2008"
Jump to navigation
Jump to search
(modified through wikirestore by Th) |
(modified through wikirestore by orapi) |
||
| Line 1: | Line 1: | ||
{{Event | {{Event | ||
| + | | Acronym = WALCOM 2008 | ||
| + | | Title = Workshop on Algorithms and Computation | ||
| + | | Type = Workshop | ||
| + | | Series = | ||
| Field = Algorithms | | Field = Algorithms | ||
| + | | Homepage = teacher.buet.ac.bd/saidurrahman/walcom2008 | ||
| + | | Start date = Feb 7, 2008 | ||
| + | | End date = Feb 8, 2008 | ||
| + | | City= Dhaka | ||
| + | | State = | ||
| + | | Country = Bangladesh | ||
| Abstract deadline = | | Abstract deadline = | ||
| Submission deadline = Sep 10, 2007 | | Submission deadline = Sep 10, 2007 | ||
| Notification = Oct 25, 2007 | | Notification = Oct 25, 2007 | ||
| − | | Camera ready = | + | | Camera ready = |
| − | + | |wikicfpId=1564}} | |
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
<pre> | <pre> | ||
Revision as of 16:05, 3 November 2021
Event Rating
| median | worst |
|---|---|
List of all ratings can be found at WALCOM 2008/rating
| WALCOM 2008 | |
|---|---|
Workshop on Algorithms and Computation
| |
| Dates | Feb 7, 2008 (iCal) - Feb 8, 2008 |
| Homepage: | teacher.buet.ac.bd/saidurrahman/walcom2008 |
| Location | |
| Location: | Dhaka, Bangladesh |
| Important dates | |
| Submissions: | Sep 10, 2007 |
| Notification: | Oct 25, 2007 |
| Table of Contents | |
The Workshop on Algorithms and Computation (WALCOM) is intended to provide an international forum for researchers working in the areas of algorithms and computation. WALCOM 2008 will be held on February 7-8 at Dhaka, Bangladesh.
SCOPE
The range of topics within the scope of the workshop of algorithms and computation includes (but is not limited to):
Algorithm and Data Structures
Graph Algorithms
Graph Drawing
Combinatorial Algorithms
Computational Geometry
Graphs in Bioinformatics
String Algorithms
Computational Biology
Parallel and Distributed Algorithms
Approximation Algorithms
Network Optimization
Online Algorithms
CALL FOR PAPERS
Authors are invited to submit papers (extended abstract) 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. 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.
PROCEEDINGS
Accepted submissions will be published in the conference proceedings, which will be included in the Springer-Verlag series Lecture Notes in Computer Science.
VENUE
The workshop will be held in Bangladesh University of Engineering and Technology (BUET), Dhaka. The workshop will be organized by the Bangladesh Academy of Sciences and the Department of Computer Science and Engineering, BUET.
SUBMISSION DEADLINE
Paper Submission: September 10, 2007
Notification of Acceptance/Rejection: October 25, 2007
Cameraready version due: November 5, 2007
Workshop : February 7- 8, 2008
PROGRAM COMMITTEE
Satoshi Fujita (Hiroshima University, Japan)
Stanley P. Y. Fung (University of Leicester, UK)
Michael Juenger (University of Cologne, Germany)
Subir Kumar Ghosh (TIFR, India)
Seok-Hee Hong (NICTA, Australia)
Giuseppe Liotta (University of Perugia, Italy)
Md. Abul Kashem (BUET, Bangladesh)
Naoki Katoh (Kyoto University, Japan)
Alejandro Lopez-Ortiz (University of Waterloo, Canada)
M. Manzur Murshed (Monash University, Australia)
Shin-ichi Nakano (Gunma University, Japan) Co-chair
Subhas Chandra Nandy (Indian Statistical Institute, Kolkata, India)
Md. Saidur Rahman (BUET, Bangladesh) Co-chair
William F. Smyth (McMaster University, Canada)
Ryuhei Uehara (JAIST, Japan)
Sue Whitesides (McGill University, Canada)
Hsu-Chun Yen (National Taiwan University, Taiwan)
This CfP was obtained from WikiCFP