-
Alexander Zapryagaev: Presburger arithmetic and related theories
Speaker: Alexander Zapryagaev (University of Electronic Science and Technology of China) Time: 16:20-17:20 (Time in Beijing) April 12, 2024 (Friday) Venue: 518, Research Building 4 Abstract: The talk introduces Presburger arithmetic PrA, the theory of natural numbers with addition, and Büchi arithmetics BA_n, a series of algorithmically decidable extensions of PrA. The main logical and […]
-
Junqiang Peng: A Fast Algorithm for MaxSAT Above Half Number of Clauses
Speaker: Junqiang Peng (University of Electronic Science and Technology of China) Time: 16:20-17:20 (Time in Beijing) March 29, 2024 (Friday) Venue: 518, Research Building 4 Abstract: In the MaxSAT problem, given a CNF formula with clauses and an integer , we are asked whether there is a truth assignment that satisfies at least clauses of […]
-
Zihui Liang: Two new algorithms for solving Muller games and their applications
Speaker: Zihui Liang (University of Electronic Science and Technology of China) Time: 16:20-17:20 (Time in Beijing) March 22, 2024 (Friday) Venue: 518, Research Building 4 Abstract: Muller games form a well-established class of games for model checking and verification. These games are played on directed graphs $\mathcal G$ where Player 0 and Player 1 play […]
-
Lu Liu: A Fast Exact Solver with Theoretical Analysis for the Maximum Edge-Weighted Clique Problem
Speaker: Lu Liu (University of Electronic Science and Technology of China) Time: 16:20-17:20 (Time in Beijing) March 15, 2024 (Friday) Venue: 518, Research Building 4 Abstract: The maximum vertex-weighted clique problem (MVWCP) and the maximum edge-weighted clique problem (MEWCP) are two natural extensions of the fundamental maximum clique problem. In this paper, we systematically study […]
-
Yi Zhou: Recent advances in algorithms for k-plex problems
Speaker: Yi Zhou (University of Electronic Science and Technology of China) Time: 16:20-17:20 (Time in Beijing) March 8, 2024 (Friday) Venue: 518, Research Building 4 Abstract: In the field of graph mining, the k-plex is a well-known extension of the clique model. A k-plex is nearly a clique except that each vertex is allowed to […]
-
Zile Jiang: Computing Better Approximate Pure Nash Equilibria in Cut Games via Semidefinite Programming
Speaker: Zhile jiang (Aarhus University) Time: 16:20-17:20 (Time in Beijing) November 10, 2023 (Friday) Venue: 518, Research Building 4 Abstract: Cut games are among the most fundamental strategic games in algorithmic game theory. It is well-known that computing an exact pure Nash equilibrium in these games is PLS-hard, so research has focused on computing approximate […]
-
Zihui Liang: Connectivity in the presence of an opponent
Speaker: Zihui Liang (University of Electronic Science and Technology of China) Time: 16:20-17:20 (Time in Beijing) October 20, 2023 (Friday) Venue: 518, Research Building 4 Abstract: The paper introduces two player connectivity games played on finite bipartite graphs. Algorithms that solve these connectivity games can be used as subroutines for solving M\”uller games. M\”uller games […]
-
Kangyi Tian: Parameterized Algorithms for Cluster Vertex Deletion on Degree-4 Graphs and General Graphs
Speaker: Kangyi Tian (University of Electronic Science and Technology of China) Time: 16:20-17:20 (Time in Beijing) October 13, 2023 (Friday) Venue: 518, Research Building 4 Abstract: In the Cluster Vertex Deletion problem, we are given a graph G and an integer k, and the goal is to determine whether we can delete at most k […]
-
Haidong Yang: Topological network-control games
Speaker: Haidong Yang (University of Electronic Science and Technology of China) Time: 16:20-17:20 (Time in Beijing) September 22, 2023 (Friday) Venue: 518, Research Building 4 Abstract: The paper introduces new combinatorial games, called topological network-control games, played on graphs. These games model the influence of competing two parties aiming to control a given network. In […]
-
Pengpeng Wang: 基于树割映射的网络健壮性增强算法
Speaker: Pengpeng Wang(Henan University of Technology) Time: 16:20-17:20 (Time in Beijing) September 15, 2023 (Friday) Venue: 518, Research Building 4 Abstract: 在大型稀疏网络中,少数几条边的随机故障可能导致网络断开,为了提高网络健壮性,可以选择性的保护特定边从而使整个网络的连通性保持到一定水平,然而资源总是有限的,不可能保护所有的边。我们设计了一种快速的算法,即通过深度遍历树快速定位到较小的割,并对这些割的边进行有选择性的保护,从而提高网络健壮性,传统算法利用线性规划,时间较慢,并且不能适用于大型网络,实验表明我们的算法能够抵御 99.99%的随机故障,有较好的加速效果。 Speaker Bio: 汪鹏鹏现就读于河南工业大学信息科学与工程学院,研究方向为最小割,网络健壮性,稀疏割算法等。