default search action
Aaron Schild
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c16]Kritkorn Karntikoon, Yiheng Shen, Sreenivas Gollapudi, Kostas Kollias, Aaron Schild, Ali Kemal Sinop:
First Passage Percolation with Queried Hints. AISTATS 2024: 4231-4239 - [c15]Haripriya Pulyassary
, Kostas Kollias
Network Flow Problems with Electric Vehicles. IPCO 2024: 365-378 - [i13]Kritkorn Karntikoon, Yiheng Shen, Sreenivas Gollapudi, Kostas Kollias, Aaron Schild, Ali Kemal Sinop:
First Passage Percolation with Queried Hints. CoRR abs/2403.10640 (2024) - 2023
- [i12]Haripriya Pulyassary, Kostas Kollias, Aaron Schild, David B. Shmoys, Manxi Wu:
Network Flow Problems with Electric Vehicles. CoRR abs/2311.05040 (2023) - 2022
- [j3]Pak Hay Chan, Lap Chi Lau, Aaron Schild, Sam Chiu-wai Wong, Hong Zhou
Network Design for s-t Effective Resistance. ACM Trans. Algorithms 18(3): 22:1-22:45 (2022) - 2021
- [c14]Nima Anari
Sampling Arborescences in Parallel. ITCS 2021: 83:1-83:18 - 2020
- [c13]Josh Alman, Timothy Chu, Aaron Schild, Zhao Song:
Algorithms and Hardness for Linear Algebra on Geometric Graphs. FOCS 2020: 541-552 - [c12]Ken-ichi Kawarabayashi, Seri Khoury, Aaron Schild, Gregory Schwartzman:
Brief Announcement: Improved Distributed Approximations for Maximum-Weight Independent Set. PODC 2020: 283-285 - [c11]Ken-ichi Kawarabayashi, Seri Khoury, Aaron Schild, Gregory Schwartzman:
Improved Distributed Approximations for Maximum Independent Set. DISC 2020: 35:1-35:16 - [i11]Josh Alman, Timothy Chu, Aaron Schild, Zhao Song:
Algorithms and Hardness for Linear Algebra on Geometric Graphs. CoRR abs/2011.02466 (2020) - [i10]Nima Anari, Nathan Hu, Amin Saberi, Aaron Schild:
Sampling Arborescences in Parallel. CoRR abs/2012.09502 (2020)
2010 – 2019
- 2019
- [b1]Aaron Schild:
Faster Algorithms and Graph Structure via Gaussian Elimination. University of California, Berkeley, USA, 2019 - [j2]Aaron Archer, Kevin Aydin, MohammadHossein Bateni, Vahab S. Mirrokni, Aaron Schild, Ray Yang, Richard Zhuang:
Cache-aware load balancing of data center applications. Proc. VLDB Endow. 12(6): 709-723 (2019) - [c10]Ravi Kumar, Manish Purohit, Aaron Schild, Zoya Svitkina, Erik Vee:
Semi-Online Bipartite Matching. ITCS 2019: 50:1-50:20 - [c9]Aaron Schild:
A Schur Complement Cheeger Inequality. ITCS 2019: 65:1-65:15 - [c8]Eli Fox-Epstein, Philip N. Klein, Aaron Schild:
Embedding Planar Graphs into Low-Treewidth Graphs with Applications to Efficient Approximation Schemes for Metric Problems. SODA 2019: 1069-1088 - [c7]Amariah Becker, Philip N. Klein, Aaron Schild:
A PTAS for Bounded-Capacity Vehicle Routing in Planar Graphs. WADS 2019: 99-111 - [i9]Amariah Becker, Philip N. Klein, Aaron Schild:
A PTAS for Bounded-Capacity Vehicle Routing in Planar Graphs. CoRR abs/1901.07032 (2019) - [i8]Pak Hay Chan, Lap Chi Lau, Aaron Schild, Sam Chiu-wai Wong, Hong Zhou:
Network design for s-t effective resistance. CoRR abs/1904.03219 (2019) - [i7]Ken-ichi Kawarabayashi, Seri Khoury, Aaron Schild, Gregory Schwartzman:
Improved Distributed Approximation to Maximum Independent Set. CoRR abs/1906.11524 (2019) - 2018
- [c6]Huan Li, Aaron Schild:
Spectral Subspace Sparsification. FOCS 2018: 385-396 - [c5]Aaron Schild, Satish Rao, Nikhil Srivastava:
Localization of Electrical Flows. SODA 2018: 1577-1584 - [c4]Aaron Schild:
An almost-linear time algorithm for uniform random spanning tree generation. STOC 2018: 214-227 - [i6]Huan Li, Aaron Schild:
Spectral Subspace Sparsification. CoRR abs/1810.03224 (2018) - [i5]Aaron Schild:
A Schur Complement Cheeger Inequality. CoRR abs/1811.10834 (2018) - [i4]Ravi Kumar, Manish Purohit, Aaron Schild, Zoya Svitkina, Erik Vee:
Semi-Online Bipartite Matching. CoRR abs/1812.00134 (2018) - 2017
- [c3]Akshay Ramachandran, Aaron Schild:
Sandpile prediction on a tree in near linear time. SODA 2017: 1115-1131 - [i3]Aaron Schild, Satish Rao, Nikhil Srivastava:
Localization of Electrical Flows. CoRR abs/1708.01632 (2017) - [i2]Aaron Schild:
An almost-linear time algorithm for uniform random spanning tree generation. CoRR abs/1711.06455 (2017) - 2016
- [j1]Feng Pan, Aaron Schild
Interdiction problems on planar graphs. Discret. Appl. Math. 198: 215-231 (2016) - 2015
- [c2]Aaron Schild, Christian Sommer:
On Balanced Separators in Road Networks. SEA 2015: 286-297 - 2013
- [c1]Feng Pan, Aaron Schild:
Interdiction Problems on Planar Graphs. APPROX-RANDOM 2013: 317-331 - [i1]Feng Pan, Aaron Schild:
Interdiction Problems on Planar Graphs. CoRR abs/1305.1407 (2013)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-16 21:27 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: