-
Yiding Feng: Mobility Data in Operations: The Facility Location Problem
Speaker: Yiding Feng（University of Chicago) Time: 11:00-12:00 (Time in Beijing) August 4, 2023 (Friday) Venue: 518, Research Building 4 Abstract: Speaker Bio: Yiding Feng is a postdoctoral principal researcher at the University of Chicago Booth School of Business. Previously, he worked as a postdoctoral researcher at Microsoft Research New England from 2021 to 2023. He […]
-
Louxin Zhang: A Scalable Algorithm for Inferring Phylogenetic Networks from Trees
Speaker: Louxin Zhang （新加坡国立大学） Time: July 3, 2023 (Monday) 10:30-11:30am Venue: 电子科技大学清水河校区主楼B1-501 Abstract: Phylogenetic networks are rooted, acyclic directed graph in which leaves are labelled with genes, genomes or species. They are used to model evolution with reticulate events. The reconstruction of phylogenetic networks is an important but challenging problem in phylogenetics and genome evolution, […]
-
Chao Xu: Matroid Base with Congruency Constraint
Speaker: Chao Xu (University of Electronic Science and Technology of China) Time: 16:20-17:20 (Time in Beijing) June 9, 2023 (Friday) Venue: 518, Research Building 4 Abstract: Let $k$ be an integer and $M$ a matroid on groundset $E$.There is a label function $\ell:E\to [k]$ that assigns a label to all elements. We aim to identify […]
-
Yuhang Guo: Characterization of Monotonic Allocation in Multi-unit Diffusion Auction
Speaker: Yuhang Guo (University of Electronic Science and Technology of China) Time: 16:20-17:20 (Time in Beijing) June 2, 2023 (Friday) Venue: 518, Research Building 4 Abstract: Designing strategyproof mechanisms in multi-unit diffusion auctions has posed a significant challenge, as each agent’s allocation and price can be easily influenced by their invitees and siblings. In our […]
-
Yuyang Zhuge, Xiaoyang Gong: Automatic Structures
Speaker: Yuyang Zhuge, Xiaoyang Gong(University of Electronic Science and Technology of China) Time: 16:20-17:20 (Time in Beijing) May 26, 2023 (Friday) Venue: 518, Research Building 4 Abstract: We introduce automatic structures. We provide examples and discuss several research directions. One direction of research is the isomorphism problem. The problem asks to design an algorithm that […]
-
Yu Cong: Trade-off Curve Computation for Incentive Allocation
Speaker: Yu Cong (University of Electronic Science and Technology of China) Time: 16:20-17:20 (Time in Beijing) May 19, 2023 (Friday) Venue: 518, Research Building 4 Abstract: We consider a large-scale incentive allocation problem where the entire trade-off curve between budget and profit has to be maintained approximately at all time. The application originally comes from […]
-
Yixin Cao: Enumerating Maximal Induced Subgraphs
Speaker: 操宜新 （香港城市大学) Time: 15:00-16:00 (Time in Beijing) May 15, 2023 (Thursday) Venue: 电子科技大学清水河校区四号科研楼A区518 Abstract: Given a graph $G$, the maximal induced subgraphs problem asks to enumerate all maximal induced subgraphs of $G$ that belong to a certain hereditary graph class. While its optimization version, known as the minimum vertex deletion problem in literature, has […]
-
Minming Li: Defending with Shared Resources on a Network
Speaker: 李閩溟 （香港城市大学) Time: 14:00-15:00 (Time in Beijing) May 15, 2023 (Thursday) Venue: 电子科技大学清水河校区四号科研楼A区518 Abstract: In this paper we consider a defending problem on a network. In the model, the defender holds a total defending resource of R, which can be distributed to the nodes of the network. The defending resource allocated to a node […]
-
Xiaohui Bei: Auction Design: from Theory to Practice
Speaker: 贝小辉 (新加坡南洋理工大学) Time: 16:20-17:20 (Time in Beijing) May 11, 2023 (Thursday) Venue: 电子科技大学清水河校区四号科研楼A区518 Abstract: As a means to facilitate efficient resource allocation, auctions are a fundamental tool in the modern economy and play a pivotal role in mechanism design theory. This talk will provide a brief introduction to auction design. We will discuss fundamental […]
-
Zhiguo Fu: 平面图上计数问题的计算复杂性分类
Speaker: 付治国 (东北师范大学) Time: 11:00-12:00 (Time in Beijing) May 8, 2023 (Monday) Venue: 电子科技大学清水河校区四号科研楼A区518 Abstract: 平面图上计数问题的计算复杂性分类探索特定框架下的计数问题是否分为如下的三类：（1）一般图上可解的问题；（2）一般图上#P-难，但在平面图上可解的问题；（3）在平面图上#P-难的问题。其中一个重要的问题是基于匹配门的全息算法对（2）中的问题是否具有通用性。本报告将介绍平面图上计数问题计算复杂性分类的进展，尤其将介绍基于匹配门的全息算法与（2）中问题的关系。 Speaker Bio: 付治国，东北师范大学信息科学与技术学院教授，博士生导师，副院长。博士毕业于吉林大学数学学院计算数学专业，美国威斯康星大学麦迪逊分校博士后。研究领域为计数问题的算法与计算复杂性，成果发表在STOC，FOCS， SODA，Information and Computation等理论计算机顶级会议和期刊。