Email: aschild at berkeley dot edu
I am a fifth-year PhD student in the Theory Group at UC Berkeley. I am fortunate to be co-advised by Satish Rao and Nikhil Srivastava. My research interests lie in the theory of algorithms, especially in planar graph algorithms and algorithms using spectral graph theory.
Network design for s-t effective resistance
Pak Hay Chan, Lap Chi Lau, Aaron Schild, Sam Chiu-wai Wong, and Hong Zhou.
A PTAS for Bounded-Capacity Vehicle Routing in Planar Graphs
Amariah Becker, Philip Klein, and Aaron Schild.
To appear in WADS 2019.
Embedding Planar Graphs into Low-Treewidth Graphs with Applications to Efficient Approximation Schemes for Metric Problems
Eli Fox-Epstein, Philip Klein, and Aaron Schild.
Semi-Online Bipartite Matching
Ravi Kumar, Manish Purohit, Aaron Schild, Zoya Svitkina, and Erik Vee.
A Schur Complement Cheeger Inequality
Spectral Subspace Sparsification
Huan Li and Aaron Schild.
An almost-linear time algorithm for uniform random spanning tree generation
STOC 2018 Best Student Paper.
STOC talk slides
Localization of Electrical Flows
Aaron Schild, Satish Rao, and Nikhil Srivastava.
Sandpile prediction on a tree in near linear time
Akshay Ramachandran and Aaron Schild.
On Balanced Separators in Road Networks
Aaron Schild and Christian Sommer.
Interdiction Problems on Planar Graphs
Feng Pan and Aaron Schild.
APPROX 2013 and Discrete Applied Mathematics.