(TAMC 2025: http://www.maths.sdnu.edu.cn/TAMC2025.htm)
TAMC 2025 aims at bringing together a wide range of researchers with interest in computational theory, information theory and applications.
The main themes of the conference are computability, complexity, algorithms, information theory and their extensions to machine learning theory, and foundations of artificial intelligence.
The topics of interest include (but are not limited to) the following:
| Manindra Agrawal | (Indian Institute of Technology, India) |
| Jin-Yi Cai | (University of Wisconsin - Madison, USA) |
| John Hopcroft | (Cornell University, USA) |
| Angsheng Li | (Beihang University, China) |
| Zhiyong Liu | (Institute of Computing Technology, Chinese Academy of Sciences, China) |
| Donglei Du | (University of New Brunswick, Canada) |
| Xiaodi Li | (Shandong Normal University, China) |
| Min Li | (Shandong Normal University, Jinan, China) |
| Mingji Xia | (Institute of Software, Chinese Academy of Sciences, Beijing, China) |
| Peng Zhang | (Shandong University, Jinan, China) |
| Xiang Liu | (Southeast University, China) |
| Yang Zhou | (Shandong Normal University, Jinan, China) |
| Qian Liu | (Shandong Normal University, Jinan, China) |
| Xia Zhang | (Shandong Normal University, Jinan, China) |
| Qiang Zhao | (Shandong Normal University, Jinan, China) |
| Zhaojie Zhou | (Shandong Normal University, Jinan, China) |
| Yixin Cao | (Hong Kong Polytechnic University, China) |
| Jianer Chen | (Texas A&M University, USA) |
| Xujin Chen | (Academy of Mathematics and Systems Science, Chinese Academy of Sciences, China) |
| Yukun Cheng | (Jiangnan University, China) |
| Yongxi Cheng | ( Xi'an Jiaotong University, China) |
| Vincent Chau | (Southeast University, China) |
| Ke Chen | (Pennsylvania State University, USA) |
| Dingzhu Du | (The University of Texas at Dallas, USA) |
| Donglei Du | (University of New Brunswick, Canada) |
| Hu Ding | (University of Science and Technology of China, China) |
| Yi Deng | (Institute of Information Engineering, Chinese Academy of Sciences, China) |
| Thomas Erlebach | (University of Leicester, UK) |
| Qilong Feng | (Central South University, China) |
| Lu Han | (Beijing University of Posts and Telecommunications, China) |
| Jianfeng Hou | (Fuzhou University, China) |
| Jianping Li | (Yunnan University, China) |
| Jianfeng Hou | (Fuzhou University, China) |
| Min Li | (Shandong Normal University, China) |
| Minming Li | (City University of Hong Kong, China) |
| Xianyue Li | (Lanzhou University, China) |
| Qian Liu | (Shandong Normal University, China) |
| Wanwei Liu | (National University of Defense Technology, China) |
| Xiang Liu | (Southeast University, China) |
| Anil Seth | (Indian Institute of Technology Kanpur, India) |
| Zhongzheng Tang | (Beijing University of Posts and Telecommunications, China) |
| Chenhao Wang | (Beijing Normal University at Zhuhai, China) |
| Guanghui Wang | (Shandong University, China) |
| Chenchen Wu | (Tianjin University of Technology, China) |
| Zijun Wu | (Hefei University of Technology, China) |
| Ge Xia | (Lafayette College, USA) |
| Mingji Xia | (Institute of Software, Chinese Academy of Sciences, China) |
| Dachuan Xu | (Beijing University of Technology, China) |
| Jinhui Xu | (University at Buffalo, the State University of New York, USA) |
| Yicheng Xu | (Shenzhen Institutes of Advanced Technology, Chinese Academy of Sciences, China) |
| Gexin Yu | (College of William & Mary, USA) |
| Huaming Zhang | (The University of Alabama in Huntsville, USA) |
| Peng Zhang | (Shandong University, China) |
| Xin Zhang | (Xidian University, China) |
| Zhao Zhang | (Zhejiang Normal University, China) |
| Yang Zhou | (Shandong Normal University, China) |
| Xiangqian Zhou | (Wright State University, USA) |
| Martin Ziegler | (KAIST, South Korea) |
Biography
Yijia Chen is a professor of Computer Science at Shanghai Jiao Tong University. He received his PhD degree in computer science from Shanghai Jiao Tong University and PhD degree in mathematics from University of Freiburg. He mainly works in logic in computer science, computational complexity, and algorithmic graph theory. He serves at the editorial board of Logic Methods in Computer Science and of Theory of Computing Systems.
Title
Understand Uncolored CFI-graphs
Abstract
The CFI-graphs, named after Cai, Fuerer, and Immerman, are central to the study of the graph isomorphism testing and of first-order logic with counting. They are often colored graphs, and the coloring plays a key role in many of their applications. As usual, it is not hard to remove the coloring by some extra graph gadgets, but at the cost of blowing up the size of the graphs and changing some key parameters of the graphs as well. This might lead to suboptimal combinatorial bounds important to their applications. In this talk, I will give a detailed account of the CFI-graphs, both colored and uncolored, and show they serve the same purposes for most applications. This is joint work with Joerg Flum and Mingjun Liu.
Biography
He Sun is a Full Professor, and Director of Center for Algorithms and Learning Theory, Shenzhen Institute of Advanced Technology, Chinese Academy of Sciences. He received his PhD from Fudan University in 2010, and worked at the Max Planck Institute for Informatics, UC Berkeley, University of Bristol, and University of Edinburgh. His research areas include algorithms, machine learning, spectral graph theory, and applied probability. He has written over 60 papers and has solved several long-standing open problems in algorithms. He received the President's Medal of Fudan University (2004), Shanghai Outstanding PhD Thesis Award (2010), Simons-Berkeley Research Fellowship (2014), Turing Fellowship (2018), and EPSRC Fellowship (2020). He is a recipient of the Chinese High-Level Talent Recruitment Program for Overseas Experts and is a fellow selected under the CAS 100 Talents Program (Category A). He has so far received research grants of more than 4.5 million pounds from different research foundations and industrial partners and develops the first C++ based open-source library for spectral graph algorithms (STAG).
Title
Dynamic Spectral Clustering with Provable Approximation Guarantee
Abstract
Spectral clustering is one of the most fundamental clustering algorithms in machine learning and has comprehensive applications in many fields of computer science. In this talk I will introduce the basics of spectral clustering, starting with its roots in spectral graph theory and its connection to eigenvalues and eigenvectors of graph Laplacians. I will further present a spectral clustering algorithm in dynamic settings and the techniques for analysing its performance. Several open problems will be discussed at the end of the talk. This is based on joint work with Steinar Laenen from the University of Edinburgh, and the work appeared at ICML 2024.
The 19th Annual Conference on Theory and Applications of Models of Computation (TAMC 2025) will be held on 19-21 September, 2025 in Jinan, China. TAMC 2025 aims at bringing together a wide range of researchers with interest in computational theory, information theory and applications. The main themes of the conference are computability, complexity, algorithms, information theory and their extensions to machine learning theory, and foundations of artificial intelligence. The topics of interest include (but are not limited to) the following:
The submission should contain scholarly exposition of ideas, techniques, and results, including the motivation and a clear comparison with related work. The length of the submission should not exceed 12 pages in LNCS style (including references, but excluding the optional appendix). Appendices should be placed at the end of the main body (after references, in the same file). For code and data, authors can provide anonymous download links or refer to an anonymized GitHub repository. The Program Committee (PC) will review the content in the appendices and links at their discretion. The submitted papers will be reviewed in a double-blind peer review manner. Please delete the author information on your manuscript. All submissions must be submitted electronically through Easychair. This is the submission link.
LNCS Style:https://www.springer.com/cn/computer-science/lncs
The proceedings of the Conference will be published by Springer-Verlag in the Lecture Notes in Computer Science (LNCS) series. Selected high quality papers will be invited to Theoretical Computer Science, Journal of Combinatorial Optimization and Journal of Computer and System Sciences. Previous TAMC proceedings were also published by Springer, which can be found from the link: https://link.springer.com/conference/tamc
Awards will be given to the best paper and the best student paper. To be eligible for the best student paper award, all authors must be full-time students at the time of submission. Please indicate in the final line of the abstract that the paper is being considered for the best student paper award. The program committee reserves the right to withhold these awards or to split them between multiple recipients.
Note
| Category | Early Registration (On or Before Aug. 31, 2025) |
Late/On-Site Registration (After Aug. 31, 2025) |
|---|---|---|
| Full Registration | USD $500 | USD $550 |
| PC Member or Student Registration | USD $250 | USD $300 |
Registration Form: You can first pay the registration fee and then finish the registration form here.
| 类别 | 早鸟注册 (2025年8月31日或之前) |
现场/普通注册 (2025年8月31日之后) |
|---|---|---|
| 全额注册 | 人民币 3600元 | 人民币 4000元 |
| PC委员或者学生注册 | 人民币 1800元 | 人民币 2000元 |
请通过微信扫码缴费 并点此完成注册。
Shandong News Hotel(山东新闻大厦), No. 6 Luoyuan Street, Lixia District, Jinan, China
Shandong News Mansion Hotel is conveniently located in Lixia District, Jinan, adjacent to multiple bus routes, making it easy to reach all major areas of the city. The hotel is 6.2 kilometers away from Jinan Railway Station and 13 kilometers away from Jinan West Railway Station. It takes a 16-minute drive to directly reach the Shandong Provincial Museum. Famous scenic spots in Jinan are just around the corner, with Heihu Spring only 0.5 kilometers away, which can be reached on foot in about 8 minutes, and Quancheng Square only 1.5 kilometers away, a 15-minute walk. In addition, popular attractions such as Qianfo Mountain, Baotu Spring, and Daming Lake are about two kilometers away from the hotel and can be reached on foot in 30 minutes.
To the Venue: around 27 kilometers (16.78 miles), from 80 minutes to 100 minutes.
To the Venue: around 13 kilometers (8.078 miles), from 60 minutes to 80 minutes.
To the Venue: around 19 kilometers (11.81 miles), from 60 minutes to 80 minutes.
To the Venue: around 6.2 kilometers (3.85 miles), from 20 minutes to 60 minutes.
To the Venue: around 4 kilometers (2.485 miles), from 20 minutes to 50 minutes.
The conference will be held at Shandong News Mansion Hotel (山东新闻大厦酒店)
Jinan, the capital of Shandong Province, is also known as the "City of Springs" due to its numerous natural springs. Located in the central-western part of Shandong, at the northern foot of Mount Tai and south of the Yellow River, it covers an area of 10,244 square kilometers with a population of approximately 9.2 million. With a long history, Jinan is a nationally renowned historical and cultural city, boasting abundant natural and cultural attractions。
China's Standard Time (CST) or UTC/GMT +8 hours
During the conference, the temperature in Jinan will be about 27-35°C and appropriate clothes should be prepared.
Foreign nationals visiting China generally need to acquire a visa before entering the country, except for special circumstances allowing for visa-free entry. Not sure whether you should apply a visa or not? Click Here
Here are two options:
You can easily apply for a visa. Click Here and you will navigate through the process. If you have more questions, please contact the Embassy or Consulate in your region for specific instructions.
Other informationThe currency used in China is Chinese yuan (CNY), which is also denoted by RMB or ¥. Check the real-time exchange rate Here. Service points located in both airports.
In China, the common power voltage is 220 Volt 50 Hz AC. You can use two types of attaching plugs in China with voltage 220V -- the type D and type J as shown in the picture blow. Power adapter should be prepared as needed.