CALL FOR PAPERS
WALCOM 2023
The 17th International Conference and Workshops on Algorithms and Computation
March 22-24, 2023
Hsinchu, Taiwan & Virtual Conference
https://www.walcom2023.conf.nycu.edu.tw/
Submission Deadline: September 23, 2022 (EXTENDED)
--------------------------------------------------------------------
The 17th International Conference and Workshops on Algorithms and
Computation (WALCOM 2023) will be held in Hsinchu, Taiwan during March
22-24, 2023.
To provide an international forum for researchers working in the areas
of algorithms and computation, the first Workshop on Algorithms and
Computation (WALCOM 2007) was held on February 12, 2007 in Dhaka,
Bangladesh and was organized by Bangladesh Academy of Sciences. WALCOM
2008, 2010, 2012, 2015, and 2018 were held in Bangladesh. WALCOM 2009,
2011, 2013, 2014, and 2019 were held in India. WALCOM 2016 was held in
Nepal. WALCOM 2017 was held in Taiwan. WALCOM 2020 was held in
Singapore. WALCOM 2021 was held in Myanmar. WALCOM 2022 was held in
Indonesia. The name of this conference has been changed as Conference
and Workshops on Algorithms and Computation since WALCOM 2017. The
proceedings will be published by Lecture Notes in Computer Science
(LNCS). Special issues dedicated to WALCOM 2023 will be published at
Journal of Graph Algorithms and Applications, Theoretical Computer
Science, and Algorithmica. WALCOM 2023 is organized in cooperation
with IEICE Technical Committee on Theoretical Foundations of Computing
(COMP) and the Special Interest Group for ALgorithms (SIGAL) of the
Information Processing Society of Japan (IPSJ).
*** Scope ***
The range of topics within the scope of the conference and workshops
of algorithms and computation includes (but is not limited to):
* Approximation Algorithms
* Algorithmic Data Science
* Algorithm Engineering and Experimental Algorithms
* Algorithmic Graph Theory and Combinatorics
* Combinatorial Algorithms
* Combinatorial Optimization
* Computational Biology
* Computational Complexity
* Computational Geometry
* Computational Network Science
* Cryptographic Algorithm
* Data Compression Algorithms
* Discrete Geometry
* Data Structures
* Enumeration Algorithms
* Graph Algorithms
* Graph Drawing
* Graph Labeling
* Parallel and Distributed Algorithms
* Parameterized Algorithms
* Parameterized Complexity
* Network Optimization
* Online Algorithms
* Randomized Algorithms
* String Algorithms
* Visualization Algorithms
*** Important Dates ***
Paper Submission: September 23, 2022 (strict deadline)
Notification of Acceptance: November 28, 2022
Camera-ready Version: December 10, 2022
Conference: March 22-23, 2023
*** TPC Co-chairs ***
Bertrand M. T. Lin (Co-Chair) National Yang Ming Chiao Tung University, Taiwan
Chun-Cheng Lin (Co-Chair) National Yang Ming Chiao Tung University, Taiwan
Giuseppe Liotta (Co-Chair) University of Perugia, Italy
*** Keynote Speakers ***
Jan Kratochvil, Charles University, Prague, Czech Republic
Michael Kaufmann, Universität Tübingen, Germany
*** Conference Proceedings ***
Lecture Notes in Computer Science
*** Special Issues ***
Selected papers will be invited to submit their extended versions to
the following journals:
* Algorithmica
* Journal of Graph Algorithms and Applications
* Theoretical Computer Science
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Posts
