posted by user: sheunghungpoon || 3216 views || tracked by 3 users: [display]

WALCOM 2017 : 11th International Conference and Workshops on Algorithms & Computation

FacebookTwitterLinkedInGoogle


Conference Series : Workshop on Algorithms and Computation
 
Link: http://walcom2017.nctu.edu.tw/
 
When Mar 29, 2017 - Mar 31, 2017
Where National Chiao Tung Uni, Hsinchu, Taiwan
Submission Deadline Oct 7, 2016
Notification Due Nov 26, 2016
Final Version Due Dec 10, 2016
 

Call For Papers

Call for Papers
---------------

International Conference and Workshops on Algorithms and Computation (WALCOM)
is intended to provide an international forum for researchers working in the areas of
algorithms and computation. WALCOM 2017 will be held during March 29- 31, 2017
at Hsinchu, Taiwan.

Poster of Call for Papers can be accessed at the following link:
http://walcom2017.nctu.edu.tw/img/CFP-WALCOM2017.pdf

SCOPE

The range of topics within the scope of the workshop on algorithms and
computation includes (but is not limited to): Approximation Algorithms,
Algorithmic Graph Theory and Combinatorics, Combinatorial
Algorithms, Combinatorial Optimization, Computational Biology,
Computational Complexity, Computational Geometry, Discrete Geometry,
Data Structures, Experimental Algorithm Methodologies, Graph Algorithms,
Graph Drawing, Parallel and Distributed Algorithms,
Parameterized Complexity, Network Optimization, Online
Algorithms, Randomized Algorithms, String Algorithms.

AUTHOR INSTRUCTIONS

Authors are invited to submit papers (extended abstracts) describing
original research of theoretical or practical significance to algorithms
and computation. Papers should not exceed 12 pages in Springer LNCS
style. Papers significantly shorter than 12 pages are also welcome.
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.

PAPER SUBMISSION PAGE

The submission page at conference server is now open for submissions.
Please submit your original contributions electronically at the following link:
https://easychair.org/conferences/?conf=walcom2017

PROCEEDINGS & SPECIAL ISSUES

Accepted papers in the conference will be published in the conference proceedings
which will be included in the Springer- Verlag Lecture Notes in Computer Science
(LNCS) series. Moreover, selected papers will be published in special issues of
“Theoretical Computer Science (TCS) ” and “Journal of Graph Algorithms and
Applications (JGAA) ”.

VENUE AND TIME

The conference will be held at the National Chiao Tung University (NCTU),
Hsinchu, Taiwan, during March 29- 31, 2017.

IMPORTANT DATES

Paper Submission Deadline: Oct. 7, 2016 (paper modification: Oct. 12, 2016) Anywhere on Earth
Acceptance Notification: November 26, 2016
Camera Ready Version Due: December 10, 2016
Conference Dates: March 29 (Wed.) – 31 (Fri.), 2017

PROGRAM COMMITTEE

Sang Won Bae, Kyonggi University, Korea
Tiziana Calamoneri, University La Sapienza, Italy
Subhas Chandra Nandy, ISI, India
Kun-Mao Chao, National Taiwan University, Taiwan
Jianer Chen, Texas A&M University, USA
Yijia Chen, Fudan University, China
Mordecai Golin , Hong Kong University of Science and Technology, Hong Kong
Seok-Hee Hong, University of Sydney, Australia
Md. Rezaul Karim, University of Dhaka, Bangladesh
Naoki Katoh, Kwansei Gakuin University, Japan
Mohammad Kaykobad, BUET, Bangladesh
Marc van Kreveld, Utrecht University, The Netherlands
Amit Kumar, IIT Delhi, India
Van Bang Le, University of Rostock, Germany
Minming Li, City University of Hong Kong, Hong Kong
Chun-Cheng Lin, National Chiao Tung University, Taiwan
Giuseppe Liotta, University of Perugia, Italy
Jerome Monnot, University Paris-Dauphine, France
David Mount, University of Maryland, USA
Petra Mutzel, Technical University of Dortmund, Germany
Shin-ichi Nakano, Gunma University, Japan
Rolf Niedermeier, Technical University of Belin, Germany
Martin Nollenburg, Technical University of Vienna, Austria
Nadia Pisanti, University of Pisa, Italy
Sheung Hung Poon (Co-Chair), Universiti Teknologi Brunei, Brunei Darussalam
Md Saidur Rahman (Co-Chair), BUET, Bangladesh
C. Pandu Rangan, IIT Madras, India
Kunihiko Sadakane, The University of Tokyo, Japan
Takeshi Tokuyama, Tohoku University, Japan
Antoine Vigneron, Ulsan National Institute of Science and Technology, Korea
Sue Whitesides, University of Vitoria, Canada
Prudence Wong, University of Liverpool, UK
Chee K. Yap, New York University, USA
Hsu-Chun Yen (Co-Chair), National Taiwan University, Taiwan
Siu-Ming Yiu, The University of Hong Kong, Hong Kong
Guochuan Zhang, Zhejiang University, China

CONTACT ADDRESSES

Sheung Hung Poon, Universiti Teknologi Brunei, Brunei Darussalam
Md Saidur Rahman, BUET, Bangladesh
Hsu-Chun Yen, National Taiwan University, Taiwan
Chun-Cheng Lin, NCTU, Taiwan

Related Resources

ISAAC 2024   35th International Symposium on Algorithms and Computation
SwarmEvo 2024   Special Issue: Peak and Bad-Case Performance of Swarm and Evolutionary Optimization Algorithms
ECTA 2024   16th International Conference on Evolutionary Computation Theory and Applications
IEEE-Ei/Scopus-ACEPE 2024   2024 IEEE Asia Conference on Advances in Electrical and Power Engineering (ACEPE 2024) -Ei Compendex
DSIT 2024   2024 7th International Conference on Data Science and Information Technology (DSIT 2024)
TRS 2025   Transportation Research Symposium
CCBDIOT 2024   2024 3rd International Conference on Computing, Big Data and Internet of Things (CCBDIOT 2024)
ACM-EI/Scopus-ARAEML 2024   2024 International Conference on Advanced Robotics, Automation Engineering and Machine Learning (ARAEML 2024) -EI Compendex
GECCO 2024   Genetic and Evolutionary Computation Conference
Social Sustainability 2025   Twenty-first International Conference on Environmental, Cultural, Economic & Social Sustainability