https://isaac2025.csie.ncku.edu.tw/
The International Symposium on Algorithms and Computation (ISAAC) is an annual conference dedicated to research in algorithms and theoretical computer science. Since 1990, it has served as a forum for presenting and discussing original research in all aspects of algorithm design, analysis, and related areas. This year, the symposium will be held in Tainan, a city in southern Taiwan known for its many historic sites and cultural landmarks.
Immediately preceding ISAAC, a satellite workshop titled Frontiers of Algorithms and Computation will take place in Taipei, a city conveniently located near the international airport. While attending this workshop is optional, we warmly encourage participants to join, as it will feature several invited speakers and offer an excellent opportunity for early networking and academic exchange. Transportation from Taipei to Tainan will be provided after the workshop.
IMPORTANT DATES
* Paper submission deadline: 30 June, 23:59 AoE
(https://isaac25.hotcrp.com/)
* Notification: Aug 30
* Camera-ready: Sep 14
* Workshop: Dec 7
* Conference: Dec 8-10
CALL FOR PAPERS
The symposium serves as a platform for researchers in algorithms and theoretical computer science. We welcome submissions of original research in these areas, as well as contributions from relevant applied domains. Papers must be formatted using the LIPIcs style and may not exceed 12 pages, excluding the title page, references, and an optional appendix. All submissions will be reviewed under a double-blind process. Awards may be presented for the Best Paper and the Best Student Paper. Topics of interest include, but are not limited to:
* Algorithmic game theory
* Algorithms and data structures
* Approximation algorithms
* Combinatorial optimization
* Computational biology
* Computational complexity
* Computational geometry
* Cryptography
* Experimental algorithms
* Graph algorithms
* Graph drawing
* Internet algorithms
* Online algorithms
* Parallel and distributed algorithms
* Quantum computing
* Randomized algorithms
* Streaming algorithms
KEYNOTE SPEAKERS
Dec 7:
* Yossi Azar, Tel-Aviv University
* Danny Chen, University of Notre Dame
* Shanghua Teng, University of Southern California
Dec 8-10:
* Piotr Indyk, Massachusetts Institute of Technology
* Mikkel Thorup, University of Copenhagen
PROGRAM COMMITTEE
* Ruben Becker, Ca' Foscari University of Venice
* T H Hubert Chan, The University of Hong Kong
* Hsien-Chih Chang, Dartmouth College
* Yi-Jun Chang, National University of Singapore
* Ho-Lin Chen, National Taiwan University (co-chair)
* Li Chen, Meta
* Lin Chen, Zhejiang University
* Siu-Wing Cheng, The Hong Kong University of Science and Technology
* Nai-Hui Chia, Rice University
* Rajesh Chitnis, University of Birmingham
* Ran Duan, Tsinghua University
* Leah Epstein, University of Haifa
* Thomas Erlebach, Durham University
* Henning Fernau, Trier University
* Arnab Ganguly, University of Wisconsin at Whitewater
* Prantar Ghosh, Tennessee Technological University
* Daniel Gibney, University of Texas at Dallas
* Mayank Goswami, City University of New York
* Meng He, Dalhousie University
* Shuichi Hirahara, National Institute of Informatics
* Wing-Kai Hon, National Tsing Hua University (co-chair)
* Seok Hee Hong, University of Sydney
* Chien-Chung Huang, ENS Ulm
* Shang-En Huang, National Taiwan University
* Shih-Han Hung, National Taiwan University
* Seungbum Jo, Chungnam National University
* Mong-Jen Kao, National Yang-Ming Chiao-Tung University
* Ralf Klasing, CNRS and University of Bordeaux
* Dominiki Koeppl, University of Yamanashi
* Yi Li, Nanyang Technological University
* Han-Hsuan Lin, National Tsing Hua University
* Hsiang-Hsuan Liu, Utrecht University
* Miguel A. Mosteiro, Pace University
* Prajakta Nimbhorkar, Chennai Mathematical Institute
* Thomas Nowak, ENS Paris-Saclay
* Eunjin Oh, Pohang University of Science and Technology
* Peter Rossmanith, RWTH Aachen University
* Kunihiko Sadakane, The University of Tokyo
* Saket Saurabh, Institute of Mathematical Sciences
* Tetsuo Shibuya, The University of Tokyo
* Hsin-Hao Su, Boston College
* Yuichi Sudo, Hosei University
* Meng-Tsung Tsai, Academia Sinica (co-chair)
* Seeun William Umboh, The University of Melbourne
* Hoa Vu, San Diego State University
* Hung-Lung Wang, National Taiwan Normal University
* Yitong Yin, Nanjing University
* Fang-Yi Yu, George Mason University
* Viktor Zamaraev, University of Liverpool
* Louxin Zhang, National University of 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/
*
**********************************************************
Posts
