The 27th International Computing and Combinatorics Conference
October 24--26, 2021, National Cheng Kung University, Tainan, Taiwan
https://algorithm.csie.ncku.edu.tw/conference/cocoon2021/
The 27th International Computing and Combinatorics Conference
(COCOON 2021) will be held in National Cheng Kung University, Tainan, Taiwan during October 24-26, 2021.
Original research papers in the areas of algorithms, theory of
computation, computational complexity, and combinatorics related to
computing are solicited. In addition to theoretical results, we are
also interested in submissions that report on experimental and
applied research of general algorithmic interest. Special
consideration will be given to research that is motivated by
real-world problems. Experimental and applied papers are expected to
show convincingly the usefulness and efficiency of the algorithms
discussed in a practical setting.
The venue of the conference will be National Cheng Kung University.
All the papers will be published to the symposium in Springer-Verlag's
Lecture Notes in Computer Science.
Papers of high quality will be invited to special issues of
Algorithmica, Theoretical Computer Science (TCS), Journal of Combinatorial
Optimization (JOCO),
and International Journal of Computer Mathematics: Computer Systems Theory
(IJCM:CST), respectively.
The topics of interest include (but are not limited to) the following:
Algorithms and Data Structures
Algorithmic Game Theory
Approximation Algorithms and Online Algorithms
Automata, Languages, Logic, and Computability
Complexity Theory
Computational Learning Theory and Knowledge Discovery
Cryptography, Reliability and Security, and Database Theory
Computational Biology and Bioinformatics
Computational Algebra, Geometry, and Number Theory
Graph Drawing and Information Visualization
Graph Theory, Communication Networks, and Optimization
Parallel and Distributed Computing
================
Important dates:
================
Paper Submission Due: June 30, 2021
Notification of Acceptance: August 15, 2021
Camera-ready and Registration: August 31, 2021
Conference Dates: October 24-26, 2021
========================
Submission instructions:
========================
Authors are invited to submit an extended abstract of original research on
Computing and Combinatorics.
Submissions must contain a scholarly exposition of the ideas, techniques,
and a full description of the results achieved. A clear indication of the
motivation and
comparison with prior related work should be presented.
Simultaneous submission to a journal or another conference with refereed
proceedings is not allowed.
Submissions must adhere to the following guidelines.
Papers must be formatted using the LNCS style file without altering margins
or the font point.
The maximum length of the paper (including references, but excluding the
optional appendix) is 12 pages.
Proofs omitted due to space constraints must be placed in an appendix to be
read by
the program committee members at their discretion. Papers that deviate from
these guidelines risk
being rejected without consideration of their merits. Submission is through
the EasyChair conference system.
The submission process requires registration to create an EasyChair account
prior to submission.
Submission page: https://easychair.org/conferences/?conf=cocoon2021.
=======================
Invited speakers:
=======================
Ding-Zhu Du (University of Texas at Dallas, USA)
Ralf Klasing (CNRS and University of Bordeaux, France)
Tony Q.S. Quek (Singapore University of Technology and Design, Singapore)
===================
Program committee:
===================
Zhipeng Cai (Georgia State University, USA)
Jou-Ming Chang (National Taipei University of Business, Taiwan)
Ho-Lin Chen (National Taiwan University, Taiwan)
Eddie Cheng (Oakland University, USA)
Kai-Min Chung (Academia Sinica, Taiwan)
Henning Fernau (Universitaet Trier, Germany)
Travis Gagie (Dalhousie University, Canada)
Arnab Ganguly (University of Wisconsin, Whitewater, USA)
Hong Gao (Harbin Institute of Technology, China)
Wing-Kai Hon (National Tsing-Hua University, Taiwan)
Sun-Yuan Hsieh (National Cheng Kung University, Taiwan)
Ling-Ju Hung (National Taipei University of Business, Taiwan)
Mong-Jen Kao (National Chung Cheng University, Taiwan)
Ralf Klasing (Universite de Bordeaux, France)
Dominik Koeppl (Kyushu University, Japan)
Van Bang Le (University of Rostock, Germany)
Chia-Wei Lee (National Tatung University, Taiwan)
Chung-Shou Liao (National Tsing Hua University, Taiwan)
Limei Lin (Fujian Normal University, China)
Hsiang-Hsuan Liu (Utrecht University, The Netherlands)
Rolf Niedermeier (TU Berlin, Germany)
Martin Noellenburg (TU Wien, Austria)
Vangelis Paschos (Paris Dauphine University, France)
M. Sohel Rahman (Bangladesh University of Engineering and Technology,
Bangladesh)
C. Pandu Rangan (Indian Institute of Technology Madras, India)
Peter Rossmanith (RWTH Aachen University, Germany)
Kunihiko Sadakane (The University of Tokyo, Japan)
Rahul Shah (Louisiana State University, USA)
Sharma V. Thankachan (University of Central Florida, USA)
Takeshi Tokuyama (Tohoku University, Japan)
Meng-Tsung Tsai (Academia Sinica, Taiwan)
Shi-Chun Tsai (National Chiao Tung University, Taiwan)
Hung-Lung Wang (National Taiwan Normal University, Taiwan)
Weili Wu (University of Texas at Dallas, USA)
Prudence Wong (University of Liverpool, UK)
Hsu-Chun Yen (National Taiwan University, Taiwan)
Siu-Ming Yiu (University of Hong Kong, China)
Christos Zaroliagis (University of Patras, Greece)
Guochuan Zhang (Zhejiang University, China)
Louxin Zhang (National University of Singapore, Singapore)
**********************************************************
*
* 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/
*
**********************************************************