Siyue Liu

collaborators

8 papers

math.CO2026

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.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.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

Strongly connected orientations and integer lattices

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…

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…