Yu Chen

39 papers A* 18A 1C 1Journal 19
YearRankTypeTitle / Venue / Authors
2026 A conf
Lower Bounds on Tree Covers.
ITCS
Yu Chen, Zihan Tan, Hangyu Xu
2025 A* conf
Cut-Preserving Vertex Sparsifiers for Planar and Quasi-Bipartite Graphs.
ICALP
Yu Chen, Zihan Tan
2025 J jnl
Lower Bounds on Tree Covers.
CoRR
Yu Chen, Zihan Tan, Hangyu Xu
2025 A* conf
Path and Intersections: Characterization of Quasi-metrics in Directed Okamura-Seymour Instances.
SODA
Yu Chen, Zihan Tan
2024 A* conf
An
SODA
Yu Chen, Zihan Tan
2024 J jnl
Cut-Preserving Vertex Sparsifiers for Planar and Quasi-bipartite Graphs.
CoRR
Yu Chen, Zihan Tan
2024 A* conf
Lower Bounds on 0-Extension with Steiner Nodes.
ICALP
Yu Chen, Zihan Tan
2024 J jnl
Lower Bounds on 0-Extension with Steiner Nodes.
CoRR
Yu Chen, Zihan Tan
2024 A* conf
On (1 + ɛ)-Approximate Flow Sparsifiers.
SODA
Yu Chen, Zihan Tan
2024 A* conf
On the Streaming Complexity of Expander Decomposition.
ICALP
Yu Chen, Michael Kapralov, Mikhail Makarov, Davide Mazzali
2024 J jnl
On the Streaming Complexity of Expander Decomposition.
CoRR
Yu Chen, Michael Kapralov, Mikhail Makarov, Davide Mazzali
2024 J jnl
Paths and Intersections: Characterization of Quasi-metrics in Directed Okamura-Seymour Instances.
CoRR
Yu Chen, Zihan Tan
2023 J jnl
An Ω̃(√(log |T|) Lower Bound for Steiner Point Removal.
CoRR
Yu Chen, Zihan Tan
2023 J jnl
On (1+ε)-Approximate Flow Sparsifiers.
CoRR
Yu Chen, Zihan Tan
2023 A* conf
Query Complexity of the Metric Steiner Tree Problem.
SODA
Yu Chen, Sanjeev Khanna, Zihan Tan
2023 A* conf
Sublinear Algorithms and Lower Bounds for Estimating MST and TSP Cost in General Metrics.
ICALP
Yu Chen, Sanjeev Khanna, Zihan Tan
2023 J jnl
Towards the Characterization of Terminal Cut Functions: a Condition for Laminar Families.
CoRR
Yu Chen, Zihan Tan
2022 A* conf
On Weighted Graph Sparsification by Linear Sketching.
FOCS
Yu Chen, Sanjeev Khanna, Huan Li
2022 J jnl
On Weighted Graph Sparsification by Linear Sketching.
CoRR
Yu Chen, Sanjeev Khanna, Huan Li
2022 J jnl
Query Complexity of the Metric Steiner Tree Problem.
CoRR
Yu Chen, Sanjeev Khanna, Zihan Tan
2022 J jnl
Sublinear Algorithms and Lower Bounds for Estimating MST and TSP Cost in General Metrics.
CoRR
Yu Chen, Sanjeev Khanna, Zihan Tan
2021 J jnl
A Polynomial Lower Bound on the Number of Rounds for Parallel Submodular Function Minimization and Matroid Intersection.
CoRR
Deeparnab Chakrabarty, Yu Chen, Sanjeev Khanna
2021 A* conf
A Polynomial Lower Bound on the Number of Rounds for Parallel Submodular Function Minimization.
FOCS
Deeparnab Chakrabarty, Yu Chen, Sanjeev Khanna
2021 A* conf
Sublinear Time Hypergraph Sparsification via Cut and Edge Sampling Queries.
ICALP
Yu Chen, Sanjeev Khanna, Ansh Nagda
2021 J jnl
Sublinear Time Hypergraph Sparsification via Cut and Edge Sampling Queries.
CoRR
Yu Chen, Sanjeev Khanna, Ansh Nagda
2020 A* conf
Near-Perfect Recovery in the One-Dimensional Latent Space Model.
WWW
Yu Chen, Sampath Kannan, Sanjeev Khanna
2020 J jnl
Near-Perfect Recovery in the One-Dimensional Latent Space Model.
CoRR
Yu Chen, Sampath Kannan, Sanjeev Khanna
2020 A* conf
Near-linear Size Hypergraph Cut Sparsifiers.
FOCS
Yu Chen, Sanjeev Khanna, Ansh Nagda
2020 J jnl
Near-linear Size Hypergraph Cut Sparsifiers.
CoRR
Yu Chen, Sanjeev Khanna, Ansh Nagda
2020 A* conf
Space-efficient Query Evaluation over Probabilistic Event Streams.
LICS
Rajeev Alur, Yu Chen, Kishor Jothimurugan, Sanjeev Khanna
2020 A* conf
Sublinear Algorithms and Lower Bounds for Metric TSP Cost Estimation.
ICALP
Yu Chen, Sampath Kannan, Sanjeev Khanna
2020 J jnl
Sublinear Algorithms and Lower Bounds for Metric TSP Cost Estimation.
CoRR
Yu Chen, Sampath Kannan, Sanjeev Khanna
2019 A* conf
Network Formation under Random Attack and Probabilistic Spread.
IJCAI
Yu Chen, Shahin Jabbari, Michael J. Kearns, Sanjeev Khanna, Jamie Morgenstern
2019 J jnl
Network Formation under Random Attack and Probabilistic Spread.
CoRR
Yu Chen, Shahin Jabbari, Michael J. Kearns, Sanjeev Khanna, Jamie Morgenstern
2019 J jnl
Polynomial Pass Lower Bounds for Graph Streaming Algorithms.
CoRR
Sepehr Assadi, Yu Chen, Sanjeev Khanna
2019 A* conf
Polynomial pass lower bounds for graph streaming algorithms.
STOC
Sepehr Assadi, Yu Chen, Sanjeev Khanna
2019 A* conf
Sublinear Algorithms for (Δ + 1) Vertex Coloring.
SODA
Sepehr Assadi, Yu Chen, Sanjeev Khanna
2018 J jnl
Sublinear Algorithms for (Δ+ 1) Vertex Coloring.
CoRR
Sepehr Assadi, Yu Chen, Sanjeev Khanna
2016 C conf
The Beachcombers' Problem: Walking and Searching from an Inner Point of a Line.
LATA
Yu Chen, Xiaotie Deng, Ziwei Ji, Chao Liao