Conference
ACTIVE
Last updated: 10th July, 2026
WALCOM 2027
The 21st International Conference and Workshops on Algorithms and Computation
On March 24, 2027, the academic community will gather for WALCOM 2027 in Taipei, Taiwan. The conference covers research topics in Computer Science & Software Engineering, algorithms and computational complexity. The upcoming submission deadline is scheduled for September 21, 2026.
Submission Deadline:
21st September, 2026
— 72 days remaining
About the WALCOM 2027 Call For Paper
The International Conference and Workshop on Algorithms and Computation (WALCOM) provides an international forum for researchers working in the areas of algorithms and computation. WALCOM 2027 will be held from March 24th to March 26th, 2027, in Taipei, Taiwan.
The range of topics within the scope of WALCOM includes but is not limited to:
Approximation Algorithms
Algorithmic Graph Theory and Combinatorics
Combinatorial Algorithms
Combinatorial Optimization
Combinatorial Reconfiguration
Computational Biology
Computational Complexity
Computational Geometry
Discrete Geometry
Data Structures
Experimental Algorithm Methodologies
Graph Algorithms
Graph Drawing
Parallel and Distributed Algorithms
Parameterized Algorithms
Parametrized Complexity
Network Optimization
Online Algorithms
Randomized Algorithms
String Algorithms
Program Committee
---
Reyan Ahmed, University of Arizona, USA
Sang Won Bae, Kyonggi University, Korea
Sujoy Bhore, Indian Institute of Technology Bombay, India
Hans Bodlaender, Utrecht University, Netherlands
Tiziana Calamoneri, Sapienza University of Rome, Italy
Marek Chrobak, University of California, USA
Stephane Durocher, University of Manitoba, Canada
Jittat Fakcharoenphol, Kasetsart University, Thailand
Arijit Ghosh, ISI, Kolkata, India
Emilio Di Giacomo, University of Perugia, Italy
Shang-En Huang, National Taiwan University, Taiwan
Wing-Kai Hon, National Tsing Hua University, Taiwan
Philipp Kindermann, Trier University, Germany
Ralf Klasing, CNRS and University of Bordeaux, France
Chun-Cheng Lin, National Yang Ming Chiao Tung University, Taiwan (co-chair)
Giuseppe Liotta, University of Perugia, Italy
Debajyoti Mondal, University of Saskatchewan, Canada
Shin-ichi Nakano, Gunma University, Japan
Subhas Nandy, Indian Statistical Institute, India
Rahnuma Islam Nishat, Brock University, Canada
Yoshio Okamoto, University of Electro-Communications, Japan
Md. Saidur Rahman, Bangladesh University of Engineering and Technology, Bangladesh (co-chair)
Peter Rossmanith, RWTH Aachen University, Germany
Toshiki Saitoh, Kyushu Institute of Technology, Japan
Akira Suzuki, Thohoku University, Japan
Meng-Tsung Tsai, Academia Sinica, Taiwan
Ryuhei Uehara, Japan Advanced Institute of Science and Technology, Japan
Hung-Lung Wang, National Taiwan Normal University, Taiwan (co-chair)
Mingyu Xiao, University of Electronic Science and Technology of China, China
Organizing Committee
---
Ling-Ju Hung, National Taipei University of Business, Taiwan (chair)
Chia-Wei Lee, University of Taipei, Taiwan
Hung-Lung Wang, National Taiwan Normal University, Taiwan
The range of topics within the scope of WALCOM includes but is not limited to:
Approximation Algorithms
Algorithmic Graph Theory and Combinatorics
Combinatorial Algorithms
Combinatorial Optimization
Combinatorial Reconfiguration
Computational Biology
Computational Complexity
Computational Geometry
Discrete Geometry
Data Structures
Experimental Algorithm Methodologies
Graph Algorithms
Graph Drawing
Parallel and Distributed Algorithms
Parameterized Algorithms
Parametrized Complexity
Network Optimization
Online Algorithms
Randomized Algorithms
String Algorithms
Program Committee
---
Reyan Ahmed, University of Arizona, USA
Sang Won Bae, Kyonggi University, Korea
Sujoy Bhore, Indian Institute of Technology Bombay, India
Hans Bodlaender, Utrecht University, Netherlands
Tiziana Calamoneri, Sapienza University of Rome, Italy
Marek Chrobak, University of California, USA
Stephane Durocher, University of Manitoba, Canada
Jittat Fakcharoenphol, Kasetsart University, Thailand
Arijit Ghosh, ISI, Kolkata, India
Emilio Di Giacomo, University of Perugia, Italy
Shang-En Huang, National Taiwan University, Taiwan
Wing-Kai Hon, National Tsing Hua University, Taiwan
Philipp Kindermann, Trier University, Germany
Ralf Klasing, CNRS and University of Bordeaux, France
Chun-Cheng Lin, National Yang Ming Chiao Tung University, Taiwan (co-chair)
Giuseppe Liotta, University of Perugia, Italy
Debajyoti Mondal, University of Saskatchewan, Canada
Shin-ichi Nakano, Gunma University, Japan
Subhas Nandy, Indian Statistical Institute, India
Rahnuma Islam Nishat, Brock University, Canada
Yoshio Okamoto, University of Electro-Communications, Japan
Md. Saidur Rahman, Bangladesh University of Engineering and Technology, Bangladesh (co-chair)
Peter Rossmanith, RWTH Aachen University, Germany
Toshiki Saitoh, Kyushu Institute of Technology, Japan
Akira Suzuki, Thohoku University, Japan
Meng-Tsung Tsai, Academia Sinica, Taiwan
Ryuhei Uehara, Japan Advanced Institute of Science and Technology, Japan
Hung-Lung Wang, National Taiwan Normal University, Taiwan (co-chair)
Mingyu Xiao, University of Electronic Science and Technology of China, China
Organizing Committee
---
Ling-Ju Hung, National Taipei University of Business, Taiwan (chair)
Chia-Wei Lee, University of Taipei, Taiwan
Hung-Lung Wang, National Taiwan Normal University, Taiwan
Topics of Interest
5 topicsResearch papers are invited in, but not limited to, the following areas:
- Computer Science & Software Engineering
-
algorithms
-
computational complexity
-
combinatorial optimization
-
algorithmic graph theory
Venue Information
Taipei, Taiwan
Special conference rates often available near the venue.
Comments
Share context, clarifications, or discussion about this CFP.
Please sign in to leave a comment. Sign in
No comments yet. Be the first to start the discussion.