default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAmariah Becker
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j2]Amariah Becker, Dara Gold
:
The gameability of redistricting criteria. J. Comput. Soc. Sci. 5(2): 1735-1777 (2022)- 2021
- [j1]Karin Knudson, Gabe Schoenbach, Amariah Becker:
PyEI: A Python package for ecological inference. J. Open Source Softw. 6(64): 3397 (2021) - 2020
- [i6]Amariah Becker, Justin Solomon:
Redistricting Algorithms. CoRR abs/2011.09504 (2020)
2010 – 2019
- 2019
- [b1]Amariah Becker:
Approximation Algorithms for Capacitated Facility-Placement and Vehicle-Routing Problems in Transportation Networks. Brown University, USA, 2019 - [c7]Amariah Becker, Philip N. Klein, Aaron Schild:
A PTAS for Bounded-Capacity Vehicle Routing in Planar Graphs. WADS 2019: 99-111 - [c6]Amariah Becker, Alice Paul:
A Framework for Vehicle Routing Approximation Schemes in Trees. WADS 2019: 112-125 - [i5]Amariah Becker, Philip N. Klein, Aaron Schild:
A PTAS for Bounded-Capacity Vehicle Routing in Planar Graphs. CoRR abs/1901.07032 (2019) - 2018
- [c5]Amariah Becker:
A Tight 4/3 Approximation for Capacitated Vehicle Routing in Trees. APPROX-RANDOM 2018: 3:1-3:15 - [c4]Amariah Becker, Philip N. Klein, David Saulpic:
Polynomial-Time Approximation Schemes for k-center, k-median, and Capacitated Vehicle Routing in Bounded Highway Dimension. ESA 2018: 8:1-8:15 - [i4]Amariah Becker:
A Tight 4/3 Approximation for Capacitated Vehicle Routing in Trees. CoRR abs/1804.08791 (2018) - [i3]Amariah Becker, Alice Paul:
A PTAS for Minimum Makespan Vehicle Routing in Trees. CoRR abs/1807.04308 (2018) - 2017
- [c3]Amariah Becker, Philip N. Klein, David Saulpic:
A Quasi-Polynomial-Time Approximation Scheme for Vehicle Routing on Planar and Bounded-Genus Graphs. ESA 2017: 12:1-12:15 - [c2]Amariah Becker:
Capacitated Domination Problems on Planar Graphs. WAOA 2017: 1-16 - [c1]Amariah Becker, Eli Fox-Epstein, Philip N. Klein, David Meierfrankenfeld:
Engineering an Approximation Scheme for Traveling Salesman in Planar Graphs. SEA 2017: 8:1-8:17 - [i2]Amariah Becker, Philip N. Klein, David Saulpic:
Polynomial-Time Approximation Schemes for k-Center and Bounded-Capacity Vehicle Routing in Metrics with Bounded Highway Dimension. CoRR abs/1707.08270 (2017) - 2016
- [i1]Amariah Becker:
Capacitated Dominating Set on Planar Graphs. CoRR abs/1604.04664 (2016)
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-04-25 05:57 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:
