Stop the war!
Остановите войну!
for scientists:
default search action
BibTeX records: Amariah Becker
@article{DBLP:journals/jocss/BeckerG22, author = {Amariah Becker and Dara Gold}, title = {The gameability of redistricting criteria}, journal = {J. Comput. Soc. Sci.}, volume = {5}, number = {2}, pages = {1735--1777}, year = {2022}, url = {https://doi.org/10.1007/s42001-022-00180-w}, doi = {10.1007/S42001-022-00180-W}, timestamp = {Thu, 13 Jul 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jocss/BeckerG22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jossw/KnudsonSB21, author = {Karin Knudson and Gabe Schoenbach and Amariah Becker}, title = {PyEI: {A} Python package for ecological inference}, journal = {J. Open Source Softw.}, volume = {6}, number = {64}, pages = {3397}, year = {2021}, url = {https://doi.org/10.21105/joss.03397}, doi = {10.21105/JOSS.03397}, timestamp = {Fri, 04 Aug 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jossw/KnudsonSB21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2011-09504, author = {Amariah Becker and Justin Solomon}, title = {Redistricting Algorithms}, journal = {CoRR}, volume = {abs/2011.09504}, year = {2020}, url = {https://arxiv.org/abs/2011.09504}, eprinttype = {arXiv}, eprint = {2011.09504}, timestamp = {Wed, 25 Nov 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2011-09504.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@phdthesis{DBLP:phd/us/Becker19, author = {Amariah Becker}, title = {Approximation Algorithms for Capacitated Facility-Placement and Vehicle-Routing Problems in Transportation Networks}, school = {Brown University, {USA}}, year = {2019}, url = {https://cs.brown.edu/research/pubs/theses/phd/2019/becker.amariah.pdf}, timestamp = {Tue, 28 Jun 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/phd/us/Becker19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wads/BeckerKS19, author = {Amariah Becker and Philip N. Klein and Aaron Schild}, editor = {Zachary Friggstad and J{\"{o}}rg{-}R{\"{u}}diger Sack and Mohammad R. Salavatipour}, title = {A {PTAS} for Bounded-Capacity Vehicle Routing in Planar Graphs}, booktitle = {Algorithms and Data Structures - 16th International Symposium, {WADS} 2019, Edmonton, AB, Canada, August 5-7, 2019, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {11646}, pages = {99--111}, publisher = {Springer}, year = {2019}, url = {https://doi.org/10.1007/978-3-030-24766-9\_8}, doi = {10.1007/978-3-030-24766-9\_8}, timestamp = {Wed, 31 Jul 2019 11:02:16 +0200}, biburl = {https://dblp.org/rec/conf/wads/BeckerKS19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wads/BeckerP19, author = {Amariah Becker and Alice Paul}, editor = {Zachary Friggstad and J{\"{o}}rg{-}R{\"{u}}diger Sack and Mohammad R. Salavatipour}, title = {A Framework for Vehicle Routing Approximation Schemes in Trees}, booktitle = {Algorithms and Data Structures - 16th International Symposium, {WADS} 2019, Edmonton, AB, Canada, August 5-7, 2019, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {11646}, pages = {112--125}, publisher = {Springer}, year = {2019}, url = {https://doi.org/10.1007/978-3-030-24766-9\_9}, doi = {10.1007/978-3-030-24766-9\_9}, timestamp = {Wed, 31 Jul 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wads/BeckerP19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1901-07032, author = {Amariah Becker and Philip N. Klein and Aaron Schild}, title = {A {PTAS} for Bounded-Capacity Vehicle Routing in Planar Graphs}, journal = {CoRR}, volume = {abs/1901.07032}, year = {2019}, url = {http://arxiv.org/abs/1901.07032}, eprinttype = {arXiv}, eprint = {1901.07032}, timestamp = {Fri, 01 Feb 2019 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-1901-07032.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/approx/Becker18, author = {Amariah Becker}, editor = {Eric Blais and Klaus Jansen and Jos{\'{e}} D. P. Rolim and David Steurer}, title = {A Tight 4/3 Approximation for Capacitated Vehicle Routing in Trees}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, {APPROX/RANDOM} 2018, August 20-22, 2018 - Princeton, NJ, {USA}}, series = {LIPIcs}, volume = {116}, pages = {3:1--3:15}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2018}, url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2018.3}, doi = {10.4230/LIPICS.APPROX-RANDOM.2018.3}, timestamp = {Tue, 21 Sep 2021 09:36:24 +0200}, biburl = {https://dblp.org/rec/conf/approx/Becker18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/esa/BeckerKS18, author = {Amariah Becker and Philip N. Klein and David Saulpic}, editor = {Yossi Azar and Hannah Bast and Grzegorz Herman}, title = {Polynomial-Time Approximation Schemes for k-center, k-median, and Capacitated Vehicle Routing in Bounded Highway Dimension}, booktitle = {26th Annual European Symposium on Algorithms, {ESA} 2018, August 20-22, 2018, Helsinki, Finland}, series = {LIPIcs}, volume = {112}, pages = {8:1--8:15}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2018}, url = {https://doi.org/10.4230/LIPIcs.ESA.2018.8}, doi = {10.4230/LIPICS.ESA.2018.8}, timestamp = {Tue, 11 Feb 2020 15:52:14 +0100}, biburl = {https://dblp.org/rec/conf/esa/BeckerKS18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1804-08791, author = {Amariah Becker}, title = {A Tight 4/3 Approximation for Capacitated Vehicle Routing in Trees}, journal = {CoRR}, volume = {abs/1804.08791}, year = {2018}, url = {http://arxiv.org/abs/1804.08791}, eprinttype = {arXiv}, eprint = {1804.08791}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1804-08791.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1807-04308, author = {Amariah Becker and Alice Paul}, title = {A {PTAS} for Minimum Makespan Vehicle Routing in Trees}, journal = {CoRR}, volume = {abs/1807.04308}, year = {2018}, url = {http://arxiv.org/abs/1807.04308}, eprinttype = {arXiv}, eprint = {1807.04308}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1807-04308.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/esa/BeckerKS17, author = {Amariah Becker and Philip N. Klein and David Saulpic}, editor = {Kirk Pruhs and Christian Sohler}, title = {A Quasi-Polynomial-Time Approximation Scheme for Vehicle Routing on Planar and Bounded-Genus Graphs}, booktitle = {25th Annual European Symposium on Algorithms, {ESA} 2017, September 4-6, 2017, Vienna, Austria}, series = {LIPIcs}, volume = {87}, pages = {12:1--12:15}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.ESA.2017.12}, doi = {10.4230/LIPICS.ESA.2017.12}, timestamp = {Tue, 11 Feb 2020 15:52:14 +0100}, biburl = {https://dblp.org/rec/conf/esa/BeckerKS17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/waoa/Becker17, author = {Amariah Becker}, editor = {Roberto Solis{-}Oba and Rudolf Fleischer}, title = {Capacitated Domination Problems on Planar Graphs}, booktitle = {Approximation and Online Algorithms - 15th International Workshop, {WAOA} 2017, Vienna, Austria, September 7-8, 2017, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {10787}, pages = {1--16}, publisher = {Springer}, year = {2017}, url = {https://doi.org/10.1007/978-3-319-89441-6\_1}, doi = {10.1007/978-3-319-89441-6\_1}, timestamp = {Tue, 14 May 2019 10:00:46 +0200}, biburl = {https://dblp.org/rec/conf/waoa/Becker17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wea/BeckerFKM17, author = {Amariah Becker and Eli Fox{-}Epstein and Philip N. Klein and David Meierfrankenfeld}, editor = {Costas S. Iliopoulos and Solon P. Pissis and Simon J. Puglisi and Rajeev Raman}, title = {Engineering an Approximation Scheme for Traveling Salesman in Planar Graphs}, booktitle = {16th International Symposium on Experimental Algorithms, {SEA} 2017, June 21-23, 2017, London, {UK}}, series = {LIPIcs}, volume = {75}, pages = {8:1--8:17}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.SEA.2017.8}, doi = {10.4230/LIPICS.SEA.2017.8}, timestamp = {Tue, 11 Feb 2020 15:52:14 +0100}, biburl = {https://dblp.org/rec/conf/wea/BeckerFKM17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/BeckerKS17, author = {Amariah Becker and Philip N. Klein and David Saulpic}, title = {Polynomial-Time Approximation Schemes for k-Center and Bounded-Capacity Vehicle Routing in Metrics with Bounded Highway Dimension}, journal = {CoRR}, volume = {abs/1707.08270}, year = {2017}, url = {http://arxiv.org/abs/1707.08270}, eprinttype = {arXiv}, eprint = {1707.08270}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/BeckerKS17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/Becker16, author = {Amariah Becker}, title = {Capacitated Dominating Set on Planar Graphs}, journal = {CoRR}, volume = {abs/1604.04664}, year = {2016}, url = {http://arxiv.org/abs/1604.04664}, eprinttype = {arXiv}, eprint = {1604.04664}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/Becker16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
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.