BibTeX records: Alice Paul

download as .bib file

@article{DBLP:journals/jmlr/FelzenszwalbKP22,
  author       = {Pedro F. Felzenszwalb and
                  Caroline J. Klivans and
                  Alice Paul},
  title        = {Clustering with Semidefinite Programming and Fixed Point Iteration},
  journal      = {J. Mach. Learn. Res.},
  volume       = {23},
  pages        = {190:1--190:23},
  year         = {2022},
  url          = {http://jmlr.org/papers/v23/21-0402.html},
  timestamp    = {Wed, 07 Jun 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jmlr/FelzenszwalbKP22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mor/PaulFFSW20,
  author       = {Alice Paul and
                  Daniel Freund and
                  Aaron M. Ferber and
                  David B. Shmoys and
                  David P. Williamson},
  title        = {Budgeted Prize-Collecting Traveling Salesman and Minimum Spanning
                  Tree Problems},
  journal      = {Math. Oper. Res.},
  volume       = {45},
  number       = {2},
  pages        = {576--590},
  year         = {2020},
  url          = {https://doi.org/10.1287/moor.2019.1002},
  doi          = {10.1287/MOOR.2019.1002},
  timestamp    = {Wed, 07 Dec 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/mor/PaulFFSW20.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/orl/PaulW20,
  author       = {Alice Paul and
                  David P. Williamson},
  title        = {Easy capacitated facility location problems, with connections to lot-sizing},
  journal      = {Oper. Res. Lett.},
  volume       = {48},
  number       = {2},
  pages        = {109--114},
  year         = {2020},
  url          = {https://doi.org/10.1016/j.orl.2019.12.006},
  doi          = {10.1016/J.ORL.2019.12.006},
  timestamp    = {Mon, 19 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/orl/PaulW20.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-2001-02727,
  author       = {Alice Paul and
                  David P. Williamson},
  title        = {Easy Capacitated Facility Location Problems, with Connections to Lot-Sizing},
  journal      = {CoRR},
  volume       = {abs/2001.02727},
  year         = {2020},
  url          = {http://arxiv.org/abs/2001.02727},
  eprinttype    = {arXiv},
  eprint       = {2001.02727},
  timestamp    = {Mon, 13 Jan 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2001-02727.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-2012-02213,
  author       = {Pedro F. Felzenszwalb and
                  Caroline J. Klivans and
                  Alice Paul},
  title        = {Iterated Linear Optimization},
  journal      = {CoRR},
  volume       = {abs/2012.02213},
  year         = {2020},
  url          = {https://arxiv.org/abs/2012.02213},
  eprinttype    = {arXiv},
  eprint       = {2012.02213},
  timestamp    = {Wed, 09 Dec 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2012-02213.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-2012-09202,
  author       = {Pedro F. Felzenszwalb and
                  Caroline J. Klivans and
                  Alice Paul},
  title        = {Clustering with Iterated Linear Optimization},
  journal      = {CoRR},
  volume       = {abs/2012.09202},
  year         = {2020},
  url          = {https://arxiv.org/abs/2012.09202},
  eprinttype    = {arXiv},
  eprint       = {2012.09202},
  timestamp    = {Tue, 05 Jan 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2012-09202.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ior/FeldmanPT19,
  author       = {Jacob B. Feldman and
                  Alice Paul and
                  Huseyin Topaloglu},
  title        = {Technical Note - Assortment Optimization with Small Consideration
                  Sets},
  journal      = {Oper. Res.},
  volume       = {67},
  number       = {5},
  pages        = {1283--1299},
  year         = {2019},
  url          = {https://doi.org/10.1287/opre.2018.1803},
  doi          = {10.1287/OPRE.2018.1803},
  timestamp    = {Tue, 31 Mar 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ior/FeldmanPT19.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 11:02:16 +0200},
  biburl       = {https://dblp.org/rec/conf/wads/BeckerP19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/PaulPW18,
  author       = {Alice Paul and
                  Matthias Poloczek and
                  David P. Williamson},
  title        = {Simple Approximation Algorithms for Balanced {MAX} 2SAT},
  journal      = {Algorithmica},
  volume       = {80},
  number       = {3},
  pages        = {995--1012},
  year         = {2018},
  url          = {https://doi.org/10.1007/s00453-017-0312-6},
  doi          = {10.1007/S00453-017-0312-6},
  timestamp    = {Thu, 15 Feb 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/algorithmica/PaulPW18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/msom/PaulFD18,
  author       = {Alice Paul and
                  Jacob B. Feldman and
                  James Mario Davis},
  title        = {Assortment Optimization and Pricing Under a Nonparametric Tree Choice
                  Model},
  journal      = {Manuf. Serv. Oper. Manag.},
  volume       = {20},
  number       = {3},
  pages        = {550--565},
  year         = {2018},
  url          = {https://doi.org/10.1287/msom.2017.0662},
  doi          = {10.1287/MSOM.2017.0662},
  timestamp    = {Thu, 01 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/msom/PaulFD18.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/Paul0FSW17,
  author       = {Alice Paul and
                  Daniel Freund and
                  Aaron M. Ferber and
                  David B. Shmoys and
                  David P. Williamson},
  editor       = {Kirk Pruhs and
                  Christian Sohler},
  title        = {Prize-Collecting {TSP} with a Budget Constraint},
  booktitle    = {25th Annual European Symposium on Algorithms, {ESA} 2017, September
                  4-6, 2017, Vienna, Austria},
  series       = {LIPIcs},
  volume       = {87},
  pages        = {62:1--62:14},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2017},
  url          = {https://doi.org/10.4230/LIPIcs.ESA.2017.62},
  doi          = {10.4230/LIPICS.ESA.2017.62},
  timestamp    = {Mon, 26 Jun 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/esa/Paul0FSW17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/latin/PaulPW16,
  author       = {Alice Paul and
                  Matthias Poloczek and
                  David P. Williamson},
  editor       = {Evangelos Kranakis and
                  Gonzalo Navarro and
                  Edgar Ch{\'{a}}vez},
  title        = {Simple Approximation Algorithms for Balanced {MAX} 2SAT},
  booktitle    = {{LATIN} 2016: Theoretical Informatics - 12th Latin American Symposium,
                  Ensenada, Mexico, April 11-15, 2016, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {9644},
  pages        = {659--671},
  publisher    = {Springer},
  year         = {2016},
  url          = {https://doi.org/10.1007/978-3-662-49529-2\_49},
  doi          = {10.1007/978-3-662-49529-2\_49},
  timestamp    = {Wed, 28 Feb 2024 00:16:41 +0100},
  biburl       = {https://dblp.org/rec/conf/latin/PaulPW16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/combinatorics/PaulP11,
  author       = {Alice Paul and
                  Nicholas Pippenger},
  title        = {A Census of Vertices by Generations in Regular Tessellations of the
                  Plane},
  journal      = {Electron. J. Comb.},
  volume       = {18},
  number       = {1},
  year         = {2011},
  url          = {https://doi.org/10.37236/574},
  doi          = {10.37236/574},
  timestamp    = {Fri, 10 Jun 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/combinatorics/PaulP11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

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.