Publications

Pkd-tree: Parallel $k$d-tree with Batch Updates

The $k$d-tree is one of the most widely used data structures to manage multi-dimensional data. Due to the ever-growing data volume, it …

Ziyang Men, Zheqi Shen, Yan Gu, Yihan Sun

Parallel Longest Increasing Subsequence and van Emde Boas Trees

This paper studies parallel algorithms for the longest increasing subsequence (LIS) problem. Let $n$ be the input size and $k$ be the …

Yan Gu, Ziyang Men, Zheqi Shen, Yihan Sun, Zijin Wan

A vertex-separator-based integer linear programming formulation for the partitioned Steiner tree problem

Given an undirected graph $G$ with a cost function on vertices, a collection of subgraphs of $G$ such that in each subgraph, there are …

Mengfan Ma, Ziyang Men, André Rossi, Yi zhou, Mingyu Xiao

Leveraging cutting planes reasoning for faster Pseudo-Boolean solving and optimization

Among the execution of modern Boolean Satisfiability (SAT) and Mixed Integer Programming (MIP) solvers, presolving is a commonly …

Ziyang Men