Amanote Research
Register
Sign In
Discover open access scientific publications
Search, annotate, share and cite publications
Publications by Richard Peng
Parallel Batch-Dynamic Graphs: Algorithms and Lower Bounds
Sparsified Cholesky and Multigrid Solvers for Connection Laplacians
Approximate Maximum Flow on Separable Undirected Graphs
Related publications
Lower Bounds and Parallel Algorithms for Planar Orthogonal Grid Drawings
New Algorithms and Lower Bounds for All-Pairs Max-Flow in Undirected Graphs
A Framework for ETH-tight Algorithms and Lower Bounds in Geometric Intersection Graphs
Hexagonal Grid Drawings: Algorithms and Lower Bounds
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Lower Bounds for Dynamic Connectivity
Lower Bounds for Gaussian Estrada Index of Graphs
Symmetry
Mathematics
Chemistry
Physics
Computer Science
Astronomy
Efficient Algorithms and Lower Bounds for Robust Linear Regression
Parallel Maximum Matching Algorithms in Interval Graphs
International Journal of Foundations of Computer Science
Computer Science
General Lower Bounds for the Minor Crossing Number of Graphs
Discrete and Computational Geometry
Combinatorics
Mathematics
Geometry
Discrete Mathematics
Computational Theory
Topology
Theoretical Computer Science