Yu Chen

Affiliations:
  • École Polytechnique Fédérale de Lausanne, Switzerland
  • University of Pennsylvania, Department of Computer and Information Science, Philadelphia, PA, USA (PhD 2022)
  • Shanghai Jiao Tong University, Zhiyuan College, Shanghai, China (2012 - 2016)


According to our database1, Yu Chen authored at least 22 papers between 2016 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Cut-Preserving Vertex Sparsifiers for Planar and Quasi-bipartite Graphs.
CoRR, 2024

On (1 + ɛ)-Approximate Flow Sparsifiers.
Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

An <i>Ω~(√log|T|)</i> Lower Bound for Steiner Point Removal.
Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

Lower Bounds on 0-Extension with Steiner Nodes.
Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

On the Streaming Complexity of Expander Decomposition.
Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

2023
Towards the Characterization of Terminal Cut Functions: a Condition for Laminar Families.
CoRR, 2023

An Ω̃(√(log |T|) Lower Bound for Steiner Point Removal.
CoRR, 2023

On (1+ε)-Approximate Flow Sparsifiers.
CoRR, 2023

Query Complexity of the Metric Steiner Tree Problem.
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

Sublinear Algorithms and Lower Bounds for Estimating MST and TSP Cost in General Metrics.
Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

2022
On Weighted Graph Sparsification by Linear Sketching.
Proceedings of the 63rd IEEE Annual Symposium on Foundations of Computer Science, 2022

2021
A Polynomial Lower Bound on the Number of Rounds for Parallel Submodular Function Minimization and Matroid Intersection.
CoRR, 2021

Sublinear Time Hypergraph Sparsification via Cut and Edge Sampling Queries.
Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

A Polynomial Lower Bound on the Number of Rounds for Parallel Submodular Function Minimization.
Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021

2020
Near-Perfect Recovery in the One-Dimensional Latent Space Model.
Proceedings of the WWW '20: The Web Conference 2020, Taipei, Taiwan, April 20-24, 2020, 2020

Space-efficient Query Evaluation over Probabilistic Event Streams.
Proceedings of the LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, 2020

Sublinear Algorithms and Lower Bounds for Metric TSP Cost Estimation.
Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

Near-linear Size Hypergraph Cut Sparsifiers.
Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020

2019
Polynomial pass lower bounds for graph streaming algorithms.
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019

Sublinear Algorithms for (Δ + 1) Vertex Coloring.
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Network Formation under Random Attack and Probabilistic Spread.
Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

2016
The Beachcombers' Problem: Walking and Searching from an Inner Point of a Line.
Proceedings of the Language and Automata Theory and Applications, 2016


  Loading...