Siyue Liu

activity

20232026

most citedApproximately Packing Dijoins via Nowhere-Zero Flows

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

collaborators

13 papers

math.NT2026

Simultaneous Residue-Class Selection in Prescribed-Difference Packings

Jianfeng Hou, Siyue Liu, Hongbin Zhao

A family $F$ of finite subsets of $Z$ is packed into $[N]$ if suitable integer translates of its members are pairwise disjoint subsets of $[N]$ . 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 $M = (E, I)$ be a matroid whose ground set can be partitioned into $k$ 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 $p$ -parity, $p$ -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 $G = (V, E^{+} \cup E^{-})$ be a bidirected graph whose underlying undirected graph $G = (V, E)$ is $2$ -edge-connected. A strongly connected orientation (SCO) is defined as a subset…

cs.DS2025

Weighted Chairman Assignment and Flow-Time Scheduling

Siyue Liu, Victor Reis

Given positive integers $m, n$ , a fractional assignment $x \in [0, 1]^{m \times n}$ and weights $d \in R_{> 0}^{n}$ , we show that there exists an assignment $y \in \{0,1\}^{m…

cs.DS2025

Minimum Cost Nowhere-zero Flows and Cut-balanced Orientations

Karthekeyan Chandrasekaran, Siyue Liu, R. Ravi

Flows and colorings are disparate concepts in graph algorithms -- the former is tractable while the latter is intractable. Tutte introduced the concept of nowhere-zero flows to uni…

math.CO2025

A Min-Max Relation on Dicuts and Dijoins in Weighted Chordal Digraphs

Gérard Cornuéjols, Siyue Liu, R. Ravi

In a digraph, a dicut is a cut where all the arcs cross in one direction. A dijoin is a subset of arcs that intersects every dicut. Edmonds and Giles conjectured that in a weighted…

math.CO2024

Strongly connected orientations and integer lattices

Ahmad Abdi, Gérard Cornuéjols, Siyue Liu +1

Let $D = (V, A)$ be a digraph whose underlying undirected graph is $2$ -edge-connected, and let $P$ be the polytope whose vertices are the incidence vectors of arc sets whose reversal…

math.CO2023

On the Congruency-Constrained Matroid Base

Siyue Liu, Chao Xu

Consider a matroid where all elements are labeled with an element in $Z$ . We are interested in finding a base where the sum of the labels is congruent to $g (mod m)$ . We s…

math.CO2023★ 1 cited

Approximately Packing Dijoins via Nowhere-Zero Flows

Gérard Cornuéjols, Siyue Liu, R. Ravi

In a digraph, a dicut is a cut where all the arcs cross in one direction. A dijoin is a subset of arcs that intersects each dicut. Woodall conjectured in 1976 that in every digraph…

math.OC2023

Convexification Techniques for Fractional Programs

Taotao He, Siyue Liu, Mohit Tawarmalani

This paper develops a correspondence relating convex hulls of fractional functions with those of polynomial functions over the same domain. Using this result, we develop a number o…