-
Improving Maximum k-Plex Solver via Second-Order Reduction and Graph Color Bounding
Speaker: Shan Hu (University of Electronic and Science Technology of China) Time: 10:00-12:00 (Time in Beijing) 14:00-16:00 (Time in Auckland) June 25, 2021 (Friday) VooVmeeting: Link: https://meeting.tencent.com/s/Epf69wfHFBWm ID: 171 763 214 Venue: Main Building Abstract: In a graph, a k-plex is a vertex set in which every vertex is not adjacent to at most k…
-
PPSZ on unique-kSAT
Speaker: Jian Ma (University of Electronic and Science Technology of China) Time: 10:00-12:00 (Time in Beijing) 14:00-16:00 (Time in Auckland) June 11, 2021 (Friday) VooVmeeting: Link: https://meeting.tencent.com/s/jSsMAf9XBBZ7 ID: 166 684 100 Venue: Main Building Abstract: The CNF satisfiability problem is defined as follows: given a CNF formula , decide if there exists truth-value assignment to…
-
A Fast Algorithm for SAT in Terms of Formula Length
Speaker: Junqiang Peng (University of Electronic and Science Technology of China) Time: 10:00-12:00 (Time in Beijing) 14:00-16:00 (Time in Auckland) June 4, 2021 (Friday) VooVmeeting: Link: https://meeting.tencent.com/s/2p05iZpS1RvT ID: 973 577 922 Password: 1949 Venue: Main Building Abstract: The CNF satisfiability problem is defined as follows: given a CNF formula , decide if there exists a…
-
Random Sampling of Important Separators: New Bounds and New Applications
Speaker: Huairui Chu (University of Electronic and Science Technology of China) Time: 10:00-12:00 (Time in Beijing) 14:00-16:00 (Time in Auckland) May 28, 2021 (Friday) VooVmeeting: Link: https://meeting.tencent.com/s/xtCxnutcKyYJ ID: 447 185 012 Password: 1949 Venue: Main Building Abstract: Important separator is a well-known concept for solving problems about graphs in parameterized algorithm sense. Marx and Razgon…
-
Kernelization for Feedback Vertex Set based on linear programming
Speaker: Tian Bai (University of Electronic and Science Technology of China) Time: 10:00-12:00 (Time in Beijing) 14:00-16:00 (Time in Auckland) May 21, 2021 (Friday) VooVmeeting: Link: https://meeting.tencent.com/s/QfT7QuGrXPBQ ID: 582 848 199 Password: 1949 Venue: Main Building Abstract: Feedback Vertex Set (FVS) is a problem to determine whether a given undirected graph has a vertex set…
-
Kernels for Planar Vertex-Disjoint Triangle Packing
Speaker: Zimo Sheng (University of Electronic and Science Technology of China) Time: 10:00-12:00 (Time in Beijing) 14:00-16:00 (Time in Auckland) May 14, 2021 (Friday) VooVmeeting: Link: https://meeting.tencent.com/s/oLdo3h9nEQlW ID: 655 461 488 Venue: Main Building Abstract: Triangle Packing is an important class of NP-hard problem. In this paper, we study Parameterized Planar Vertex-Disjoint Triangle Packing problem,…
-
Approximation Algorithms for the Traveling Tournament Problem with Maximum Tour Length Two
Speaker: Jingyang Zhao (University of Electronic and Science Technology of China) Time: 10:00-12:00 (Time in Beijing) 14:00-16:00 (Time in Auckland) May 07, 2021 (Friday) VooVmeeting: Link: https://meeting.tencent.com/s/smb8sodAC9nv ID: 559 715 185 Venue: Main Building Abstract: The Traveling Tournament Problem is a complex combinatorial optimization problem in tournament timetabling, which asks us to design a double…
-
Efficient Reductions and a Fast Algorithm of Maximum Weighted Independent Set
Speaker: Sen Huang (University of Electronic and Science Technology of China) Time: 10:00-12:00 (Time in Beijing) 14:00-16:00 (Time in Auckland) April 23, 2021 (Friday) VooVmeeting: Link: https://meeting.tencent.com/s/XOBiQORlo9f9 ID: 860 317 588 Venue: B1-514, Main Building Abstract: The maximum independent set problem is one of the most fundamental problems in graph algorithms and has been widely…
-
An Experimental Study of the Feedback Arc Set Problem
Speaker: Ziliang Xiong(University of Electronic and Science Technology of China) Time: 10:00-12:00 (Time in Beijing) 14:00-16:00 (Time in Auckland) April 9, 2021 (Friday) VooVmeeting: Link: https://meeting.tencent.com/s/4780kEVEoRgF ID: 381 139 951 Venue: B1-514, Main Building Abstract: Given a digraph, the minimum feedback arc set problem asks to find the smallest arc set whose removal makes the…
-
Random sampling in social network auction
Speaker: Yuchao Song(University of Electronic and Science Technology of China) Time: 10:00AM(Time in Beijing) 3:00PM(Time in Auckland) April 2, 2021 (Friday) Address: Online meeting VooVmeeting: ID: 425 826 163 Password: 1949 Link: https://meeting.tencent.com/s/OWsH2L3tXfss Abstract: We will introuduce the problem of auction design with budget and network structure, that is, auction information can be transmitted by…