activity
20232026
most citedApproximately Packing Dijoins via Nowhere-Zero Flows

1 citations · 1 across the 11 of their papers we have counts for

collaborators
Showing 2026Show all

6 papers · 1 filter

math.NT2026

Simultaneous Residue-Class Selection in Prescribed-Difference Packings

Jianfeng Hou, Siyue Liu, Hongbin Zhao

A family of finite subsets of is packed into if suitable integer translates of its members are pairwise disjoint subsets of . We study two presc…

math.CO2026

Feedback edge set in bipartite digraph

Bin Chen, Jianfeng Hou, Siyue Liu

Let \(β(G)\) denote the minimum size of a feedback edge set of a digraph \(G\), and let \(γ(G)\) denote the number of unordered pairs of nonadjacent vertices. Motivated by the Chud…

cs.DS2026

Weighted Equitability and Matroid-Constrained Discrepancy

Kristóf Bérczi, Siyue Liu, Victor Reis +1

We prove weighted matroid equitability. Let be a matroid whose ground set can be partitioned into bases, and assign a nonnegative weight to every element. T…

cs.DS2026

Semi-Streaming Algorithms for Submodular Maximization under Random Arrival Order

Niv Buchbinder, Moran Feldman, Siyue Liu +1

We study random order semi-streaming algorithms for submodular maximization under a wide range of combinatorial constraint classes, including matroids, matroid -parity, -exch…

cs.CL2026

Open-Domain Safety Policy Construction

Di Wu, Siyue Liu, Zixiang Ji +4

Moderation layers are increasingly a core component of many products built on user- or model-generated content. However, drafting and maintaining domain-specific safety policies re…

math.CO2026

Lattice Structure and Efficient Basis Construction for Strongly Connected Orientations

Siyue Liu, Olha Silina

Let be a bidirected graph whose underlying undirected graph is -edge-connected. A strongly connected orientation (SCO) is defined as a subset…