Speaker: Yi Zhou (University of Electronic Science and Technology of China) Host: Management School in Northwestern Polytechnical University Time: 19:00 (Time in Beijing) June 2, 2022 (Thursday) Venue: Online, Tencent Meeting: 969 244 436 Abstract: 松弛团指的是近似完全图的图结构，是图论和组合优化领域的经典模型。松弛团模型在数据挖掘，人工智能领域有着重要的应用，而如何从大规模的图中挖掘大型松弛团则是这类应用均需解决共性问题。在本次报告中，我们将从算法工程的角度来介绍松弛团挖掘问题的分析和求解。具体来说，我们将介绍松弛团问题的背景、应用并重点介绍基于分支算法的松弛团问题理论及实践。我们还将以k-plex，最密子图等松弛团为例，介绍这类问题的当前最新的优化结果。

Host: HCP (Workshop on Hard Computational Problems: Theory , Algorithms and Applications) Time: 13:00-19:00 (Time in Beijing) May 27, 2022 (Friday) Venue: Online, Tencent Meeting (ID: 267-356-071) Agenda: Title Authors Optimizing Binary Decision Diagrams with MaxSAT for  classification Hao Hu, Mohamed Siala, Marie-José Huguet Encoding Multi-valued Decision Diagram Constraints  as Binary Constraint Trees Ruiwei Wang, […]

Speaker: 王祖玲(杭州师范大学硕士研究生) Time: 19:30 – 20:30 (Time in Beijing) December 3, 2021 (Friday) Venue: 报告形式：线上会议 报告平台：腾讯会议（会议ID：335-281-241） Abstract: How to effectively solve the global optimization problem is always an inevitable problem in scientific research and engineering practice. Evolutionary algorithm is a random search algorithm based on population and independent of derivative, which can effectively solve complex […]

Speaker: 蔡少伟(中科院软件所研究员) Time: 2021年12月2日 15:00-16:30 – 09:15 – 16:40 (Time in Beijing) – December 2, 2021 (Thursday) Venue: 报告形式：线上会议 报告平台：腾讯会议（会议ID：169 500 126） Abstract: 命题逻辑可满足性问题（简称SAT）是第一个被证明为NP完全的问题，也是计算机科学的一个核心问题。SAT求解器在包括EDA，密码学，资源分配等多个实际场景中有重要应用。求解SAT的主要方法包括基于冲突学习的完备算法和基于局部搜索的不完备算法。SAT领域一个挑战就是如何结合两者优势设计高效混合算法。本报告将回顾作者在此方向的一些探索和结果。

Speaker: Yuqing Kong(Peking University) Bo Li(Peking University) Boyu Zhang(Beijing Normal University) Qi Qi(Renmin University of China) Jianwei Huang(The Chinese University of Hong Kong, Shenzhen) Xiao Liu(Tsinghua University) Zhiyi Huang(The University of Hong Kong) Time: 09:15 – 16:40 (Time in Beijing) November 13, 2021 (Saturday) Venue: Registration is required to participate in the online conference. Link: […]

Speaker: Chuming Li(Huazhong University of Science and Technology) Host: HCP Time: 19:00 – 21:00 (Time in Beijing) November 10, 2021 (Wednesday) Venue: 腾讯会议 ID: 148 668 344 Abstract Branch and Bound (BnB) is a powerful technique that has been successfully used to solve many combinatorial optimization problems. However, MaxSAT is a notorious exception because BnB […]

Speaker: Xuding Zhu(Zhejiang Normal University) Host: Shanghai Center For Mathematical Science Time: 14:00 – 16:00 (Time in Beijing) September 13, 2021 (Monday) Venue: Zoom meeting ID: 818 0564 1942 Password: 121323 Link: https://zoom.com.cn/j/81805641942 Abstract: The well-known 1-2-3 conjecture asserts that any graph with no isolated edges has an edge-weighting vertex colouring using weights 1,2 and […]

Speaker: Zdenek Dvorák(Charles University) Time: 14:00 – 15:00 (Time in Beijing) June 24, 2021 (Thursday) Venue: Zoom meeting ID: 878 5040 3141 Password: 121323 Link: https://zoom.com.cn/j/87850403141 Abstract: Weak and strong coloring numbers are a generalization of the notion of graph degeneracy to longer distances. We survey some interesting results and applications of these concepts. Download […]

Speaker: Mingyu Xiao (University of Electronic and Science Technology of China) Time: 9:00-12:00 May 29, 2021 (Saturday) VooVmeeting: ZOOM Conference ID: 748 677 4340 Venue: Lotus Room, Orient Hotel Xi’an Abstract: In a score aggregation system, several agents give scores to a set of candidates independently, and we are going to combine the individual scores […]

Speaker: Bingkai Lin(Nanjing University) Time: 10:00-11:00 (Time in Beijing) April 20, 2021 (Tuesday) VooVmeeting: ZOOM ID: 467 156 1455 Password: 图灵机被提出的年份（4位） Bilibili Live: http://live.bilibili.com/22528138 Abstract: Deciding whether a graph contains a ‍‍-Clique is a well-known NP‍‍-hard problem. One approach to dealing with NP‍‍-hard problem is approximation algorithm. However, assuming NP P ‍‍, no polynomial time […]