Aaron Schild

Orcid: 0000-0003-0476-6479

According to our database1, Aaron Schild authored at least 21 papers between 2015 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
First Passage Percolation with Queried Hints.
CoRR, 2024

2023
Network Flow Problems with Electric Vehicles.
CoRR, 2023

2022
Network Design for <i>s</i>-<i>t</i> Effective Resistance.
ACM Trans. Algorithms, 2022

2021
Sampling Arborescences in Parallel.
Proceedings of the 12th Innovations in Theoretical Computer Science Conference, 2021

2020
Improved Distributed Approximations for Maximum Independent Set.
Proceedings of the 34th International Symposium on Distributed Computing, 2020

Brief Announcement: Improved Distributed Approximations for Maximum-Weight Independent Set.
Proceedings of the PODC '20: ACM Symposium on Principles of Distributed Computing, 2020

Algorithms and Hardness for Linear Algebra on Geometric Graphs.
Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020

2019
Faster Algorithms and Graph Structure via Gaussian Elimination.
PhD thesis, 2019

Cache-aware load balancing of data center applications.
Proc. VLDB Endow., 2019

Improved Distributed Approximation to Maximum Independent Set.
CoRR, 2019

Network design for s-t effective resistance.
CoRR, 2019

A PTAS for Bounded-Capacity Vehicle Routing in Planar Graphs.
Proceedings of the Algorithms and Data Structures - 16th International Symposium, 2019

Embedding Planar Graphs into Low-Treewidth Graphs with Applications to Efficient Approximation Schemes for Metric Problems.
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

A Schur Complement Cheeger Inequality.
Proceedings of the 10th Innovations in Theoretical Computer Science Conference, 2019

Semi-Online Bipartite Matching.
Proceedings of the 10th Innovations in Theoretical Computer Science Conference, 2019

2018
An almost-linear time algorithm for uniform random spanning tree generation.
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018

Localization of Electrical Flows.
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

Spectral Subspace Sparsification.
Proceedings of the 59th IEEE Annual Symposium on Foundations of Computer Science, 2018

2017
Sandpile prediction on a tree in near linear time.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

2016
Interdiction problems on planar graphs.
Discret. Appl. Math., 2016

2015
On Balanced Separators in Road Networks.
Proceedings of the Experimental Algorithms - 14th International Symposium, 2015


  Loading...