-
USER: Unsupervised Structural Entropy-based Robust Graph Neural Network
Speaker: Yifei Wang (Ph.D. student, the University of Auckland) Time: 16:20-17:20 (Time in Beijing) 21:20-22:20 (Time in Auckland) April 29, 2022 (Friday) Venue: B1-518B, Research Building 4 Abstract: Today graph neural networks (GNN) are widely used for processing complex graph data. However, GNN models are vulnerable in real-world scenarios as the input graphs are prone […]
-
Value iteration for probabilistic verification of stochastic games
Speaker: Toru Takisaka (Postdoc Professor in University of Electronic Science and Technology of China) Time: 16:20-17:20 (Time in Beijing) 21:20-22:20 (Time in Auckland) April 22, 2022 (Friday) Venue: B1-518B, Research Building 4 Abstract: I give a talk about value iteration (VI) for stochastic games, which is one of the most widely used techniques in probabilistic […]
-
Approximation Algorithms for the Capacitated Vehicle Routing Problem
Speaker: Jingyang Zhao (Ph.D. student in University of Electronic Science and Technology of China) Time: 16:20-17:20 (Time in Beijing) 21:20-22:20 (Time in Auckland) April 15, 2022 (Friday) Venue: B1-518B, Research Building 4 Abstract: In the Capacitated Vehicle Routing Problem (CVRP), we are given an undirected complete graph with metric nonnegative edge weights, where there are […]
-
Automatic structures: Open questions
Speaker: Bakhadyr Khoussainov (Professor in University of Electronic Science and Technology of China) Time: 16:20-17:20 (Time in Beijing) 21:20-22:20 (Time in Auckland) April 8, 2022 (Friday) Venue: B1-518B, Research Building 4 Abstract: This talk will give an introduction to the theory of automatic structures, a cutting-edge research topic in logic in computer science and computation. […]
-
Listing Maximal k-Plexes in Large Real-World Graphs
Speaker: Zhengren Wang (Undergraduate student in University of Electronic Science and Technology of China) Time: 16:20-17:20 (Time in Beijing) 21:20-22:20 (Time in Auckland) April 1, 2022 (Friday) Venue: B1-518B, Research Building 4 Abstract: This talk is a report of our paper Listing Maximal k-Plexes in Large Real-World Graphs on WWW’2022. K-plexes often serve as a […]
-
Automated Generation of Branching Rules
Speaker: Kangyi Tian (Undergraduate student in University of Electronic Science and Technology of China) Time: 16:20-17:20 (Time in Beijing) 21:20-22:20 (Time in Auckland) March 25, 2022 (Friday) Venue: B1-518B, Research Building 4 Abstract: This talk is about Automated Generation of Branching Rules, which helps avoid tedious case distinctions in the design of parameterized algorithms using […]
-
Combinatorial games on networks
Speaker: Zihui Liang (Ph.D. student in University of Electronic Science and Technology of China) Time: 16:20-17:20 (Time in Beijing) 21:20-22:20 (Time in Auckland) March 18, 2022 (Friday) Venue: B1-518B, Research Building 4 Abstract: We introduce new combinatorial games played on graphs that we call network-control games. These games model the influence of competing two parties […]
-
Facility location with entrance fees
Speaker: Mengfan Ma (Ph.D. student in University of Electronic Science and Technology of China) Time: 16:20-17:20 (Time in Beijing) 21:20-22:20 (Time in Auckland) March 11, 2022 (Friday) Venue: B1-518B, Research Building 4 Abstract: In mechanism design, the facility location game is an extensively studied problem. In the classical model, the cost of each agent is […]
-
Minimum violation vertex maps and their applications to cut problems
Speaker: Chao Xu (Assistant Professor in University of Electronic Science and Technology of China) Time: 16:20-17:20 (Time in Beijing) 21:20-22:20 (Time in Auckland) March 4, 2022 (Friday) Venue: B1-518B, Research Building 4 Abstract: The minimum violation problem asks for a vertex map from a digraph to a pattern digraph that minimizes violation, the total weight […]
-
Reachability and Büchi games
Speaker: Yu Cong (undergraduate student in University of Electronic Science and Technology of China) Time: 10:00-11:00 (Time in Beijing) 15:00-16:00 (Time in Auckland) January 7, 2022 (Friday) Venue: B1-518B, Research Building 4 Abstract: Reachability and Buchi games are 2-player games on directed finite graphs. In this presentation, I will briefly introduce these two games and […]