Yu Chen

Publication Activity (10 Years)

Years Active: 2021-2024
Publications (10 Years): 17

Top Topics

Query Complexity

Bipartite Graph

Top Venues

Publications

Yu Chen, Zihan Tan
Lower Bounds on 0-Extension with Steiner Nodes. CoRR (2024)
Yu Chen, Michael Kapralov, Mikhail Makarov, Davide Mazzali
On the Streaming Complexity of Expander Decomposition. CoRR (2024)
Yu Chen, Zihan Tan
Cut-Preserving Vertex Sparsifiers for Planar and Quasi-bipartite Graphs. CoRR (2024)
Yu Chen, Zihan Tan
Lower Bound for Steiner Point Removal. SODA (2024)
Yu Chen, Zihan Tan
Lower Bounds on 0-Extension with Steiner Nodes. ICALP (2024)
Yu Chen, Michael Kapralov, Mikhail Makarov, Davide Mazzali
On the Streaming Complexity of Expander Decomposition. ICALP (2024)
Yu Chen, Zihan Tan
On (1 + ɛ)-Approximate Flow Sparsifiers. SODA (2024)
Deeparnab Chakrabarty, Yu Chen, Sanjeev Khanna
A Polynomial Lower Bound on the Number of Rounds for Parallel Submodular Function Minimization and Matroid Intersection. SIAM J. Comput. 52 (1) (2023)
Yu Chen, Sanjeev Khanna, Zihan Tan
Query Complexity of the Metric Steiner Tree Problem. SODA (2023)
Yu Chen, Zihan Tan
Towards the Characterization of Terminal Cut Functions: a Condition for Laminar Families. CoRR (2023)
Yu Chen, Sanjeev Khanna, Zihan Tan
Sublinear Algorithms and Lower Bounds for Estimating MST and TSP Cost in General Metrics. ICALP (2023)
Yu Chen, Zihan Tan
On (1+ε)-Approximate Flow Sparsifiers. CoRR (2023)
Yu Chen, Zihan Tan
An Ω̃(√(log |T|) Lower Bound for Steiner Point Removal. CoRR (2023)
Yu Chen, Sanjeev Khanna, Zihan Tan
Query Complexity of the Metric Steiner Tree Problem. CoRR (2022)
Yu Chen, Sanjeev Khanna, Huan Li
On Weighted Graph Sparsification by Linear Sketching. CoRR (2022)
Yu Chen, Sanjeev Khanna, Zihan Tan
Sublinear Algorithms and Lower Bounds for Estimating MST and TSP Cost in General Metrics. CoRR (2022)
Deeparnab Chakrabarty, Yu Chen, Sanjeev Khanna
A Polynomial Lower Bound on the Number of Rounds for Parallel Submodular Function Minimization. FOCS (2021)