-
A $(2+\epsilon)k$-vertex kernel for Edge Triangle Deletion Problem
Speaker: Yuxi Liu (University of Electronic Science and Technology of China) Time: 16:20-17:20 (Time in Beijing) April 7, 2023 (Friday) Venue: 518, Research Building 4 Abstract: The Edge Triangle Deletion problem asks whether we can delete at most edges from the input graph such that there is no triangle in the remaining graph. This problem […]
-
Zimo Sheng: Improved Kernels for Edge Triangle Covering Problem
Speaker: Zimo Sheng (University of Electronic Science and Technology of China) Time: 16:20-17:20 (Time in Beijing) March 31, 2023 (Friday) Venue: 518, Research Building 4 Abstract: Kernelization is a concept of data preprocessing which is possible to derive upper and lower bounds on sizes of reduced instance. Edge Triangle Covering is an important NP-hard problem […]
-
Qimu Xiao: Joint cross-cell offloading and resource allocation in the multi-cell MEC network via online learning
Speaker: Qimu Xiao (University of Electronic Science and Technology of China) Time: 16:20-17:20 (Time in Beijing) March 24, 2023 (Friday) Venue: 518, Research Building 4 Abstract: A widely studied typical mobile edge computing (MEC) system network consists of a cloud server, some edge servers, and some user equipment, which promises a satisfactory user experience by […]
-
Dong Hao: Invitation in Contest Mechanism Design
Speaker: Dong Hao (University of Electronic Science and Technology of China) Time: 16:20-17:20 (Time in Beijing) March 17, 2023 (Friday) Venue: 518, Research Building 4 Abstract: In a contest, a principal holding a task posts it to a crowd. People in the crowd then compete to win the principal’s rewards. Although a crowd is usually […]
-
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) March 10, 2023 (Friday) Venue: 518, Research Building 4 Abstract: We introduce 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 constitute […]
-
Zihui Liang: Solving M¨uller Game in Polynomial Time
Speaker: Zihui Liang (University of Electronic Science and Technology of China) Time: 16:20-17:20 (Time in Beijing) March 3, 2023 (Friday) Venue: 518, Research Building 4 Abstract: We introduce Muller games. These are two player games played on finite graphs. They are used to model reactive systems that interact with enviroment. They are also used in […]
-
Ye Wei & Dingwen Xu: Probability Graph Models
Speaker: () Time: 16:20-17:20 (Time in Beijing) November 25, 2022 (Friday) Venue: 518, Research Building 4 Abstract:
-
Jianbo Wang: Solving systems of linear equations through zero forcing set
Speaker: () Time: 16:20-17:20 (Time in Beijing) November 18, 2022 (Friday) Venue: 518, Research Building 4 Abstract:
-
Ke Shi: A Polynomial Time Algorithm for Finding a Minimum 4-Partition of a Submodular Function
Speaker: () Time: 16:20-17:20 (Time in Beijing) October 21, 2022 (Friday) Venue: 518, Research Building 4 Abstract:
-
Yuan Fang: Multi-unit Auction over a Social Network
Speaker: () Time: 16:20-17:20 (Time in Beijing) October 14, 2022 (Friday) Venue: 518, Research Building 4 Abstract: