Search dblp for Publications

export results for "toc:db/conf/soda/soda2002.bht:"

 download as .bib file

@inproceedings{DBLP:conf/soda/AdjihGJS02,
  author       = {C{\'{e}}dric Adjih and
                  Leonidas Georgiadis and
                  Philippe Jacquet and
                  Wojciech Szpankowski},
  editor       = {David Eppstein},
  title        = {Is the internet fractal?},
  booktitle    = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
  pages        = {338--345},
  publisher    = {{ACM/SIAM}},
  year         = {2002},
  url          = {http://dl.acm.org/citation.cfm?id=545381.545426},
  timestamp    = {Fri, 20 Mar 2015 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/AdjihGJS02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/AdlerR02,
  author       = {Micah Adler and
                  Dan Rubenstein},
  editor       = {David Eppstein},
  title        = {Pricing multicasting in more practical network models},
  booktitle    = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
  pages        = {981--990},
  publisher    = {{ACM/SIAM}},
  year         = {2002},
  url          = {http://dl.acm.org/citation.cfm?id=545381.545508},
  timestamp    = {Fri, 07 Dec 2012 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/AdlerR02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/AgarwalEW02,
  author       = {Pankaj K. Agarwal and
                  Herbert Edelsbrunner and
                  Yusu Wang},
  editor       = {David Eppstein},
  title        = {Computing the writhing number of a polygonal knot},
  booktitle    = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
  pages        = {791--799},
  publisher    = {{ACM/SIAM}},
  year         = {2002},
  url          = {http://dl.acm.org/citation.cfm?id=545381.545485},
  timestamp    = {Mon, 02 Jan 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/AgarwalEW02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/AgarwalS02,
  author       = {Pankaj K. Agarwal and
                  Micha Sharir},
  editor       = {David Eppstein},
  title        = {Pseudo-line arrangements: duality, algorithms, and applications},
  booktitle    = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
  pages        = {800--809},
  publisher    = {{ACM/SIAM}},
  year         = {2002},
  url          = {http://dl.acm.org/citation.cfm?id=545381.545486},
  timestamp    = {Fri, 07 Dec 2012 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/AgarwalS02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/AlonGKS02,
  author       = {Noga Alon and
                  Venkatesan Guruswami and
                  Tali Kaufman and
                  Madhu Sudan},
  editor       = {David Eppstein},
  title        = {Guessing secrets efficiently via list decoding},
  booktitle    = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
  pages        = {254--262},
  publisher    = {{ACM/SIAM}},
  year         = {2002},
  url          = {http://dl.acm.org/citation.cfm?id=545381.545414},
  timestamp    = {Tue, 14 Jun 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/soda/AlonGKS02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/AlonS02,
  author       = {Noga Alon and
                  Asaf Shapira},
  editor       = {David Eppstein},
  title        = {Testing satisfiability},
  booktitle    = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
  pages        = {645--654},
  publisher    = {{ACM/SIAM}},
  year         = {2002},
  url          = {http://dl.acm.org/citation.cfm?id=545381.545467},
  timestamp    = {Fri, 07 Dec 2012 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/AlonS02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/AlstrupR02,
  author       = {Stephen Alstrup and
                  Theis Rauhe},
  editor       = {David Eppstein},
  title        = {Improved labeling scheme for ancestor queries},
  booktitle    = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
  pages        = {947--953},
  publisher    = {{ACM/SIAM}},
  year         = {2002},
  url          = {http://dl.acm.org/citation.cfm?id=545381.545504},
  timestamp    = {Fri, 07 Dec 2012 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/AlstrupR02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/AmirCD02,
  author       = {Amihood Amir and
                  Kenneth Ward Church and
                  Emanuel Dar},
  editor       = {David Eppstein},
  title        = {Separable attributes: a technique for solving the sub matrices character
                  count problem},
  booktitle    = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
  pages        = {400--401},
  publisher    = {{ACM/SIAM}},
  year         = {2002},
  url          = {http://dl.acm.org/citation.cfm?id=545381.545433},
  timestamp    = {Fri, 07 Dec 2012 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/AmirCD02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/AndersonP02,
  author       = {Edward J. Anderson and
                  Chris N. Potts},
  editor       = {David Eppstein},
  title        = {On-line scheduling of a single machine to minimize total weighted
                  completion time},
  booktitle    = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
  pages        = {548--557},
  publisher    = {{ACM/SIAM}},
  year         = {2002},
  url          = {http://dl.acm.org/citation.cfm?id=545381.545455},
  timestamp    = {Fri, 07 Dec 2012 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/AndersonP02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/AndrewsZ02,
  author       = {Matthew Andrews and
                  Lisa Zhang},
  editor       = {David Eppstein},
  title        = {Scheduling protocols for switches with large envelopes},
  booktitle    = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
  pages        = {443--452},
  publisher    = {{ACM/SIAM}},
  year         = {2002},
  url          = {http://dl.acm.org/citation.cfm?id=545381.545440},
  timestamp    = {Fri, 07 Dec 2012 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/AndrewsZ02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/ArcherT02,
  author       = {Aaron Archer and
                  {\'{E}}va Tardos},
  editor       = {David Eppstein},
  title        = {Frugal path mechanisms},
  booktitle    = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
  pages        = {991--999},
  publisher    = {{ACM/SIAM}},
  year         = {2002},
  url          = {http://dl.acm.org/citation.cfm?id=545381.545509},
  timestamp    = {Fri, 07 Dec 2012 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/ArcherT02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/ArkinBFMS02,
  author       = {Esther M. Arkin and
                  Michael A. Bender and
                  S{\'{a}}ndor P. Fekete and
                  Joseph S. B. Mitchell and
                  Martin Skutella},
  editor       = {David Eppstein},
  title        = {The freeze-tag problem: how to wake up a swarm of robots},
  booktitle    = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
  pages        = {568--577},
  publisher    = {{ACM/SIAM}},
  year         = {2002},
  url          = {http://dl.acm.org/citation.cfm?id=545381.545457},
  timestamp    = {Fri, 07 Dec 2012 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/ArkinBFMS02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/ArmonAER02,
  author       = {Amitai Armon and
                  Yossi Azar and
                  Leah Epstein and
                  Oded Regev},
  editor       = {David Eppstein},
  title        = {Temporary tasks assignment resolved},
  booktitle    = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
  pages        = {116--124},
  publisher    = {{ACM/SIAM}},
  year         = {2002},
  url          = {http://dl.acm.org/citation.cfm?id=545381.545396},
  timestamp    = {Mon, 20 Mar 2017 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/ArmonAER02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/AroraB02,
  author       = {Sanjeev Arora and
                  Bo Brinkman},
  editor       = {David Eppstein},
  title        = {A randomized online algorithm for bandwidth utilization},
  booktitle    = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
  pages        = {535--539},
  publisher    = {{ACM/SIAM}},
  year         = {2002},
  url          = {http://dl.acm.org/citation.cfm?id=545381.545453},
  timestamp    = {Fri, 07 Dec 2012 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/AroraB02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/AryaM02,
  author       = {Sunil Arya and
                  Theocharis Malamatos},
  editor       = {David Eppstein},
  title        = {Linear-size approximate voronoi diagrams},
  booktitle    = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
  pages        = {147--155},
  publisher    = {{ACM/SIAM}},
  year         = {2002},
  url          = {http://dl.acm.org/citation.cfm?id=545381.545400},
  timestamp    = {Fri, 07 Dec 2012 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/AryaM02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/AsanoKOT02,
  author       = {Tetsuo Asano and
                  Naoki Katoh and
                  Koji Obokata and
                  Takeshi Tokuyama},
  editor       = {David Eppstein},
  title        = {Matrix rounding under the Lp-discrepancy measure and its application
                  to digital halftoning},
  booktitle    = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
  pages        = {896--904},
  publisher    = {{ACM/SIAM}},
  year         = {2002},
  url          = {http://dl.acm.org/citation.cfm?id=545381.545498},
  timestamp    = {Fri, 07 Dec 2012 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/AsanoKOT02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BabcockDM02,
  author       = {Brian Babcock and
                  Mayur Datar and
                  Rajeev Motwani},
  editor       = {David Eppstein},
  title        = {Sampling from a moving window over streaming data},
  booktitle    = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
  pages        = {633--634},
  publisher    = {{ACM/SIAM}},
  year         = {2002},
  url          = {http://dl.acm.org/citation.cfm?id=545381.545465},
  timestamp    = {Thu, 02 Jan 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/BabcockDM02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/Bar-NoyFLN02,
  author       = {Amotz Bar{-}Noy and
                  Ari Freund and
                  Shimon Landa and
                  Joseph Naor},
  editor       = {David Eppstein},
  title        = {Competitive on-line switching policies},
  booktitle    = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
  pages        = {525--534},
  publisher    = {{ACM/SIAM}},
  year         = {2002},
  url          = {http://dl.acm.org/citation.cfm?id=545381.545452},
  timestamp    = {Wed, 03 Jan 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/Bar-NoyFLN02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/Bar-NoyGKNSS02,
  author       = {Amotz Bar{-}Noy and
                  Sudipto Guha and
                  Yoav Katz and
                  Joseph Naor and
                  Baruch Schieber and
                  Hadas Shachnai},
  editor       = {David Eppstein},
  title        = {Throughput maximization of real-time scheduling with batching},
  booktitle    = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
  pages        = {742--751},
  publisher    = {{ACM/SIAM}},
  year         = {2002},
  url          = {http://dl.acm.org/citation.cfm?id=545381.545480},
  timestamp    = {Fri, 07 Dec 2012 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/Bar-NoyGKNSS02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/Bar-NoyL02,
  author       = {Amotz Bar{-}Noy and
                  Richard E. Ladner},
  editor       = {David Eppstein},
  title        = {Windows scheduling problems for broadcast systems},
  booktitle    = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
  pages        = {433--442},
  publisher    = {{ACM/SIAM}},
  year         = {2002},
  url          = {http://dl.acm.org/citation.cfm?id=545381.545439},
  timestamp    = {Mon, 05 Feb 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/Bar-NoyL02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/Bar-YehudaHNSS02,
  author       = {Reuven Bar{-}Yehuda and
                  Magn{\'{u}}s M. Halld{\'{o}}rsson and
                  Joseph Naor and
                  Hadas Shachnai and
                  Irina Shapira},
  editor       = {David Eppstein},
  title        = {Scheduling split intervals},
  booktitle    = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
  pages        = {732--741},
  publisher    = {{ACM/SIAM}},
  year         = {2002},
  url          = {http://dl.acm.org/citation.cfm?id=545381.545479},
  timestamp    = {Fri, 07 Dec 2012 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/Bar-YehudaHNSS02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/Bar-YossefHW02,
  author       = {Ziv Bar{-}Yossef and
                  Kirsten Hildrum and
                  Felix Wu},
  editor       = {David Eppstein},
  title        = {Incentive-compatible online auctions for digital goods},
  booktitle    = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
  pages        = {964--970},
  publisher    = {{ACM/SIAM}},
  year         = {2002},
  url          = {http://dl.acm.org/citation.cfm?id=545381.545506},
  timestamp    = {Fri, 07 Dec 2012 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/Bar-YossefHW02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/Bar-YossefKS02,
  author       = {Ziv Bar{-}Yossef and
                  Ravi Kumar and
                  D. Sivakumar},
  editor       = {David Eppstein},
  title        = {Reductions in streaming algorithms, with an application to counting
                  triangles in graphs},
  booktitle    = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
  pages        = {623--632},
  publisher    = {{ACM/SIAM}},
  year         = {2002},
  url          = {http://dl.acm.org/citation.cfm?id=545381.545464},
  timestamp    = {Mon, 08 Mar 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/Bar-YossefKS02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BarbayK02,
  author       = {J{\'{e}}r{\'{e}}my Barbay and
                  Claire Kenyon},
  editor       = {David Eppstein},
  title        = {Adaptive intersection and t-threshold problems},
  booktitle    = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
  pages        = {390--399},
  publisher    = {{ACM/SIAM}},
  year         = {2002},
  url          = {http://dl.acm.org/citation.cfm?id=545381.545432},
  timestamp    = {Fri, 07 Dec 2012 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/BarbayK02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BeckL02,
  author       = {J{\'{o}}zsef Beck and
                  Sachin Lodha},
  editor       = {David Eppstein},
  title        = {Efficient proper 2-coloring of almost disjoint hypergraphs},
  booktitle    = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
  pages        = {598--605},
  publisher    = {{ACM/SIAM}},
  year         = {2002},
  url          = {http://dl.acm.org/citation.cfm?id=545381.545460},
  timestamp    = {Fri, 07 Dec 2012 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/BeckL02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BenderDIW02,
  author       = {Michael A. Bender and
                  Ziyang Duan and
                  John Iacono and
                  Jing Wu},
  editor       = {David Eppstein},
  title        = {A locality-preserving cache-oblivious dynamic dictionary},
  booktitle    = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
  pages        = {29--38},
  publisher    = {{ACM/SIAM}},
  year         = {2002},
  url          = {http://dl.acm.org/citation.cfm?id=545381.545385},
  timestamp    = {Fri, 07 Dec 2012 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/BenderDIW02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BenderMR02,
  author       = {Michael A. Bender and
                  S. Muthukrishnan and
                  Rajmohan Rajaraman},
  editor       = {David Eppstein},
  title        = {Improved algorithms for stretch scheduling},
  booktitle    = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
  pages        = {762--771},
  publisher    = {{ACM/SIAM}},
  year         = {2002},
  url          = {http://dl.acm.org/citation.cfm?id=545381.545482},
  timestamp    = {Mon, 10 May 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/soda/BenderMR02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BermanDM02,
  author       = {Piotr Berman and
                  Bhaskar DasGupta and
                  S. Muthukrishnan},
  editor       = {David Eppstein},
  title        = {Slice and dice: a simple, improved approximate tiling recipe},
  booktitle    = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
  pages        = {455--464},
  publisher    = {{ACM/SIAM}},
  year         = {2002},
  url          = {http://dl.acm.org/citation.cfm?id=545381.545442},
  timestamp    = {Mon, 10 May 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/soda/BermanDM02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BermanDM02a,
  author       = {Piotr Berman and
                  Bhaskar DasGupta and
                  S. Muthukrishnan},
  editor       = {David Eppstein},
  title        = {Simple approximation algorithm for nonoverlapping local alignments},
  booktitle    = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
  pages        = {677--678},
  publisher    = {{ACM/SIAM}},
  year         = {2002},
  url          = {http://dl.acm.org/citation.cfm?id=545381.545471},
  timestamp    = {Mon, 10 May 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/soda/BermanDM02a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BermanK02,
  author       = {Piotr Berman and
                  Marek Karpinski},
  editor       = {David Eppstein},
  title        = {Approximating minimum unsatisfiability of linear equations},
  booktitle    = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
  pages        = {514--516},
  publisher    = {{ACM/SIAM}},
  year         = {2002},
  url          = {http://dl.acm.org/citation.cfm?id=545381.545450},
  timestamp    = {Fri, 07 Dec 2012 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/BermanK02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/Blaser02,
  author       = {Markus Bl{\"{a}}ser},
  editor       = {David Eppstein},
  title        = {An 8/13-approximation algorithm for the asymmetric maximum {TSP}},
  booktitle    = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
  pages        = {64--73},
  publisher    = {{ACM/SIAM}},
  year         = {2002},
  url          = {http://dl.acm.org/citation.cfm?id=545381.545389},
  timestamp    = {Fri, 07 Dec 2012 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/Blaser02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BlumCK02,
  author       = {Avrim Blum and
                  Shuchi Chawla and
                  Adam Kalai},
  editor       = {David Eppstein},
  title        = {Static optimality and dynamic search-optimality in lists and trees},
  booktitle    = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
  pages        = {1--8},
  publisher    = {{ACM/SIAM}},
  year         = {2002},
  url          = {http://dl.acm.org/citation.cfm?id=545381.545382},
  timestamp    = {Sun, 17 Dec 2017 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/BlumCK02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BlumD02,
  author       = {Avrim Blum and
                  John Dunagan},
  editor       = {David Eppstein},
  title        = {Smoothed analysis of the perceptron algorithm for linear programming},
  booktitle    = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
  pages        = {905--914},
  publisher    = {{ACM/SIAM}},
  year         = {2002},
  url          = {http://dl.acm.org/citation.cfm?id=545381.545499},
  timestamp    = {Fri, 07 Dec 2012 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/BlumD02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BlumSZ02,
  author       = {Avrim Blum and
                  Tuomas Sandholm and
                  Martin Zinkevich},
  editor       = {David Eppstein},
  title        = {Online algorithms for market clearing},
  booktitle    = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
  pages        = {971--980},
  publisher    = {{ACM/SIAM}},
  year         = {2002},
  url          = {http://dl.acm.org/citation.cfm?id=545381.545507},
  timestamp    = {Fri, 07 Dec 2012 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/BlumSZ02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BorodinNR02,
  author       = {Allan Borodin and
                  Morten N. Nielsen and
                  Charles Rackoff},
  editor       = {David Eppstein},
  title        = {(Incremental) priority algorithms},
  booktitle    = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
  pages        = {752--761},
  publisher    = {{ACM/SIAM}},
  year         = {2002},
  url          = {http://dl.acm.org/citation.cfm?id=545381.545481},
  timestamp    = {Fri, 07 Dec 2012 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/BorodinNR02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BrodalFJ02,
  author       = {Gerth St{\o}lting Brodal and
                  Rolf Fagerberg and
                  Riko Jacob},
  editor       = {David Eppstein},
  title        = {Cache oblivious search trees via binary trees of small height},
  booktitle    = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
  pages        = {39--48},
  publisher    = {{ACM/SIAM}},
  year         = {2002},
  url          = {http://dl.acm.org/citation.cfm?id=545381.545386},
  timestamp    = {Fri, 07 Dec 2012 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/BrodalFJ02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BuchsbaumFG02,
  author       = {Adam L. Buchsbaum and
                  Glenn S. Fowler and
                  Raffaele Giancarlo},
  editor       = {David Eppstein},
  title        = {Improving table compression with combinatorial optimization},
  booktitle    = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
  pages        = {213--222},
  publisher    = {{ACM/SIAM}},
  year         = {2002},
  url          = {http://dl.acm.org/citation.cfm?id=545381.545408},
  timestamp    = {Fri, 07 Dec 2012 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/BuchsbaumFG02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/Chan02,
  author       = {Timothy M. Chan},
  editor       = {David Eppstein},
  title        = {Closest-point problems simplified on the {RAM}},
  booktitle    = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
  pages        = {472--473},
  publisher    = {{ACM/SIAM}},
  year         = {2002},
  url          = {http://dl.acm.org/citation.cfm?id=545381.545444},
  timestamp    = {Fri, 07 Dec 2012 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/Chan02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/Chan02a,
  author       = {Timothy M. Chan},
  editor       = {David Eppstein},
  title        = {Semi-online maintenance of geometric optima and measures},
  booktitle    = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
  pages        = {474--483},
  publisher    = {{ACM/SIAM}},
  year         = {2002},
  url          = {http://dl.acm.org/citation.cfm?id=545381.545445},
  timestamp    = {Fri, 07 Dec 2012 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/Chan02a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/Charikar02,
  author       = {Moses Charikar},
  editor       = {David Eppstein},
  title        = {On semidefinite programming relaxations for graph coloring and vertex
                  cover},
  booktitle    = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
  pages        = {616--620},
  publisher    = {{ACM/SIAM}},
  year         = {2002},
  url          = {http://dl.acm.org/citation.cfm?id=545381.545462},
  timestamp    = {Fri, 07 Dec 2012 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/Charikar02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/ChengD02,
  author       = {Siu{-}Wing Cheng and
                  Tamal K. Dey},
  editor       = {David Eppstein},
  title        = {Quality meshing with weighted Delaunay refinement},
  booktitle    = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
  pages        = {137--146},
  publisher    = {{ACM/SIAM}},
  year         = {2002},
  url          = {http://dl.acm.org/citation.cfm?id=545381.545399},
  timestamp    = {Fri, 07 Dec 2012 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/ChengD02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/ChengV02,
  author       = {Siu{-}Wing Cheng and
                  Antoine Vigneron},
  editor       = {David Eppstein},
  title        = {Motorcycle graphs and straight skeletons},
  booktitle    = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
  pages        = {156--165},
  publisher    = {{ACM/SIAM}},
  year         = {2002},
  url          = {http://dl.acm.org/citation.cfm?id=545381.545401},
  timestamp    = {Fri, 07 Dec 2012 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/ChengV02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/ChepoiDV02,
  author       = {Victor Chepoi and
                  Feodor F. Dragan and
                  Yann Vax{\`{e}}s},
  editor       = {David Eppstein},
  title        = {Center and diameter problems in plane triangulations and quadrangulations},
  booktitle    = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
  pages        = {346--355},
  publisher    = {{ACM/SIAM}},
  year         = {2002},
  url          = {http://dl.acm.org/citation.cfm?id=545381.545427},
  timestamp    = {Fri, 07 Dec 2012 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/ChepoiDV02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/ChoiA02,
  author       = {Sunghee Choi and
                  Nina Amenta},
  editor       = {David Eppstein},
  title        = {Delaunay triangulation programs on surface data},
  booktitle    = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
  pages        = {135--136},
  publisher    = {{ACM/SIAM}},
  year         = {2002},
  url          = {http://dl.acm.org/citation.cfm?id=545381.545398},
  timestamp    = {Fri, 07 Dec 2012 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/ChoiA02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/ChungGL02,
  author       = {Fan R. K. Chung and
                  Ronald L. Graham and
                  Linyuan Lu},
  editor       = {David Eppstein},
  title        = {Guessing secrets with inner product questions},
  booktitle    = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
  pages        = {247--253},
  publisher    = {{ACM/SIAM}},
  year         = {2002},
  url          = {http://dl.acm.org/citation.cfm?id=545381.545413},
  timestamp    = {Fri, 07 Dec 2012 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/ChungGL02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/CohenHKZ02,
  author       = {Edith Cohen and
                  Eran Halperin and
                  Haim Kaplan and
                  Uri Zwick},
  editor       = {David Eppstein},
  title        = {Reachability and distance queries via 2-hop labels},
  booktitle    = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
  pages        = {937--946},
  publisher    = {{ACM/SIAM}},
  year         = {2002},
  url          = {http://dl.acm.org/citation.cfm?id=545381.545503},
  timestamp    = {Fri, 07 Dec 2012 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/CohenHKZ02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/CooperFS02,
  author       = {Colin Cooper and
                  Alan M. Frieze and
                  Gregory B. Sorkin},
  editor       = {David Eppstein},
  title        = {A note on random 2-SAT with prescribed literal degrees},
  booktitle    = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
  pages        = {316--320},
  publisher    = {{ACM/SIAM}},
  year         = {2002},
  url          = {http://dl.acm.org/citation.cfm?id=545381.545423},
  timestamp    = {Fri, 07 Dec 2012 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/CooperFS02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/CoppersmithGS02,
  author       = {Don Coppersmith and
                  David Gamarnik and
                  Maxim Sviridenko},
  editor       = {David Eppstein},
  title        = {The diameter of a long range percolation graph},
  booktitle    = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
  pages        = {329--337},
  publisher    = {{ACM/SIAM}},
  year         = {2002},
  url          = {http://dl.acm.org/citation.cfm?id=545381.545425},
  timestamp    = {Fri, 07 Dec 2012 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/CoppersmithGS02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/CormodeM02,
  author       = {Graham Cormode and
                  S. Muthukrishnan},
  editor       = {David Eppstein},
  title        = {The string edit distance matching problem with moves},
  booktitle    = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
  pages        = {667--676},
  publisher    = {{ACM/SIAM}},
  year         = {2002},
  url          = {http://dl.acm.org/citation.cfm?id=545381.545470},
  timestamp    = {Fri, 07 May 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/soda/CormodeM02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/CrochemoreLZ02,
  author       = {Maxime Crochemore and
                  Gad M. Landau and
                  Michal Ziv{-}Ukelson},
  editor       = {David Eppstein},
  title        = {A sub-quadratic sequence alignment algorithm for unrestricted cost
                  matrices},
  booktitle    = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
  pages        = {679--688},
  publisher    = {{ACM/SIAM}},
  year         = {2002},
  url          = {http://dl.acm.org/citation.cfm?id=545381.545472},
  timestamp    = {Fri, 07 Dec 2012 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/CrochemoreLZ02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/CsabaKK02,
  author       = {B{\'{e}}la Csaba and
                  Marek Karpinski and
                  Piotr Krysta},
  editor       = {David Eppstein},
  title        = {Approximability of dense and sparse instances of minimum 2-connectivity,
                  {TSP} and path problems},
  booktitle    = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
  pages        = {74--83},
  publisher    = {{ACM/SIAM}},
  year         = {2002},
  url          = {http://dl.acm.org/citation.cfm?id=545381.545390},
  timestamp    = {Fri, 07 Dec 2012 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/CsabaKK02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/CzumajV02,
  author       = {Artur Czumaj and
                  Berthold V{\"{o}}cking},
  editor       = {David Eppstein},
  title        = {Tight bounds for worst-case equilibria},
  booktitle    = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
  pages        = {413--420},
  publisher    = {{ACM/SIAM}},
  year         = {2002},
  url          = {http://dl.acm.org/citation.cfm?id=545381.545436},
  timestamp    = {Fri, 07 Dec 2012 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/CzumajV02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/DahllofJ02,
  author       = {Vilhelm Dahll{\"{o}}f and
                  Peter Jonsson},
  editor       = {David Eppstein},
  title        = {An algorithm for counting maximum weighted independent sets and its
                  applications},
  booktitle    = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
  pages        = {292--298},
  publisher    = {{ACM/SIAM}},
  year         = {2002},
  url          = {http://dl.acm.org/citation.cfm?id=545381.545420},
  timestamp    = {Fri, 07 Dec 2012 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/DahllofJ02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/DatarGIM02,
  author       = {Mayur Datar and
                  Aristides Gionis and
                  Piotr Indyk and
                  Rajeev Motwani},
  editor       = {David Eppstein},
  title        = {Maintaining stream statistics over sliding windows (extended abstract)},
  booktitle    = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
  pages        = {635--644},
  publisher    = {{ACM/SIAM}},
  year         = {2002},
  url          = {http://dl.acm.org/citation.cfm?id=545381.545466},
  timestamp    = {Thu, 02 Jan 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/DatarGIM02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/DemetrescuT02,
  author       = {Camil Demetrescu and
                  Mikkel Thorup},
  editor       = {David Eppstein},
  title        = {Oracles for distances avoiding a link-failure},
  booktitle    = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
  pages        = {838--843},
  publisher    = {{ACM/SIAM}},
  year         = {2002},
  url          = {http://dl.acm.org/citation.cfm?id=545381.545490},
  timestamp    = {Fri, 07 Dec 2012 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/DemetrescuT02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/DeyGGZ02,
  author       = {Tamal K. Dey and
                  Joachim Giesen and
                  Samrat Goswami and
                  Wulue Zhao},
  editor       = {David Eppstein},
  title        = {Shape dimension and approximation from samples},
  booktitle    = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
  pages        = {772--780},
  publisher    = {{ACM/SIAM}},
  year         = {2002},
  url          = {http://dl.acm.org/citation.cfm?id=545381.545483},
  timestamp    = {Fri, 07 Dec 2012 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/DeyGGZ02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/DiksFKP02,
  author       = {Krzysztof Diks and
                  Pierre Fraigniaud and
                  Evangelos Kranakis and
                  Andrzej Pelc},
  editor       = {David Eppstein},
  title        = {Tree exploration with little memory},
  booktitle    = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
  pages        = {588--597},
  publisher    = {{ACM/SIAM}},
  year         = {2002},
  url          = {http://dl.acm.org/citation.cfm?id=545381.545459},
  timestamp    = {Fri, 07 Dec 2012 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/DiksFKP02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/DrineaFM02,
  author       = {Eleni Drinea and
                  Alan M. Frieze and
                  Michael Mitzenmacher},
  editor       = {David Eppstein},
  title        = {Balls and bins models with feedback},
  booktitle    = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
  pages        = {308--315},
  publisher    = {{ACM/SIAM}},
  year         = {2002},
  url          = {http://dl.acm.org/citation.cfm?id=545381.545422},
  timestamp    = {Fri, 07 Dec 2012 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/DrineaFM02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/EdmondsP02,
  author       = {Jeff Edmonds and
                  Kirk Pruhs},
  editor       = {David Eppstein},
  title        = {Broadcast scheduling: when fairness is fine},
  booktitle    = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
  pages        = {421--430},
  publisher    = {{ACM/SIAM}},
  year         = {2002},
  url          = {http://dl.acm.org/citation.cfm?id=545381.545437},
  timestamp    = {Fri, 07 Dec 2012 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/EdmondsP02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/EfratHKKRW02,
  author       = {Alon Efrat and
                  Frank Hoffmann and
                  Christian Knauer and
                  Klaus Kriegel and
                  G{\"{u}}nter Rote and
                  Carola Wenk},
  editor       = {David Eppstein},
  title        = {Covering shapes by ellipses},
  booktitle    = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
  pages        = {453--454},
  publisher    = {{ACM/SIAM}},
  year         = {2002},
  url          = {http://dl.acm.org/citation.cfm?id=545381545441.},
  timestamp    = {Sun, 12 Nov 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/EfratHKKRW02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/EisenbrandRV02,
  author       = {Friedrich Eisenbrand and
                  Giovanni Rinaldi and
                  Paolo Ventura},
  editor       = {David Eppstein},
  title        = {0/1 optimization and 0/1 primal separation are equivalent},
  booktitle    = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
  pages        = {920--926},
  publisher    = {{ACM/SIAM}},
  year         = {2002},
  url          = {http://dl.acm.org/citation.cfm?id=545381.545501},
  timestamp    = {Fri, 07 Dec 2012 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/EisenbrandRV02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/EngebretsenIO02,
  author       = {Lars Engebretsen and
                  Piotr Indyk and
                  Ryan O'Donnell},
  editor       = {David Eppstein},
  title        = {Derandomized dimensionality reduction with applications},
  booktitle    = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
  pages        = {705--712},
  publisher    = {{ACM/SIAM}},
  year         = {2002},
  url          = {http://dl.acm.org/citation.cfm?id=545381.545476},
  timestamp    = {Fri, 07 Dec 2012 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/EngebretsenIO02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/EngebretsenS02,
  author       = {Lars Engebretsen and
                  Madhu Sudan},
  editor       = {David Eppstein},
  title        = {Harmonic broadcasting is optimal},
  booktitle    = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
  pages        = {431--432},
  publisher    = {{ACM/SIAM}},
  year         = {2002},
  url          = {http://dl.acm.org/citation.cfm?id=545381.545438},
  timestamp    = {Tue, 14 Jun 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/soda/EngebretsenS02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/Erickson02,
  author       = {Jeff Erickson},
  editor       = {David Eppstein},
  title        = {Dense point sets have sparse Delaunay triangulations: or "... but
                  not too nasty"},
  booktitle    = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
  pages        = {125--134},
  publisher    = {{ACM/SIAM}},
  year         = {2002},
  url          = {http://dl.acm.org/citation.cfm?id=545381.545397},
  timestamp    = {Tue, 21 Nov 2017 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/Erickson02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/ErlebachH02,
  author       = {Thomas Erlebach and
                  Alexander Hall},
  editor       = {David Eppstein},
  title        = {NP-hardness of broadcast scheduling and inapproximability of single-source
                  unsplittable min-cost flow},
  booktitle    = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
  pages        = {194--202},
  publisher    = {{ACM/SIAM}},
  year         = {2002},
  url          = {http://dl.acm.org/citation.cfm?id=545381.545405},
  timestamp    = {Fri, 07 Dec 2012 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/ErlebachH02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/EvenK02,
  author       = {Guy Even and
                  Guy Kortsarz},
  editor       = {David Eppstein},
  title        = {An approximation algorithm for the group Steiner problem},
  booktitle    = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
  pages        = {49--58},
  publisher    = {{ACM/SIAM}},
  year         = {2002},
  url          = {http://dl.acm.org/citation.cfm?id=545381.545387},
  timestamp    = {Fri, 07 Dec 2012 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/EvenK02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/EvenK02a,
  author       = {Shimon Even and
                  Roni Kupershtok},
  editor       = {David Eppstein},
  title        = {Layout area of the hypercube (extended abstract)},
  booktitle    = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
  pages        = {366--371},
  publisher    = {{ACM/SIAM}},
  year         = {2002},
  url          = {http://dl.acm.org/citation.cfm?id=545381.545429},
  timestamp    = {Fri, 07 Dec 2012 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/EvenK02a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/FederMPZ02,
  author       = {Tom{\'{a}}s Feder and
                  Rajeev Motwani and
                  Rina Panigrahy and
                  An Zhu},
  editor       = {David Eppstein},
  title        = {Web caching with request reordering},
  booktitle    = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
  pages        = {104--105},
  publisher    = {{ACM/SIAM}},
  year         = {2002},
  url          = {http://dl.acm.org/citation.cfm?id=545381.545393},
  timestamp    = {Thu, 02 Jan 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/FederMPZ02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/FiatS02,
  author       = {Amos Fiat and
                  Jared Saia},
  editor       = {David Eppstein},
  title        = {Censorship resistant peer-to-peer content addressable networks},
  booktitle    = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
  pages        = {94--103},
  publisher    = {{ACM/SIAM}},
  year         = {2002},
  url          = {http://dl.acm.org/citation.cfm?id=545381.545392},
  timestamp    = {Fri, 07 Dec 2012 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/FiatS02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/FinocchiPS02,
  author       = {Irene Finocchi and
                  Alessandro Panconesi and
                  Riccardo Silvestri},
  editor       = {David Eppstein},
  title        = {Experimental analysis of simple, distributed vertex coloring algorithms},
  booktitle    = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
  pages        = {606--615},
  publisher    = {{ACM/SIAM}},
  year         = {2002},
  url          = {http://dl.acm.org/citation.cfm?id=545381.545461},
  timestamp    = {Fri, 07 Dec 2012 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/FinocchiPS02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/FunkeR02,
  author       = {Stefan Funke and
                  Edgar A. Ramos},
  editor       = {David Eppstein},
  title        = {Smooth-surface reconstruction in near-linear time},
  booktitle    = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
  pages        = {781--790},
  publisher    = {{ACM/SIAM}},
  year         = {2002},
  url          = {http://dl.acm.org/citation.cfm?id=545381.545484},
  timestamp    = {Fri, 07 Dec 2012 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/FunkeR02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/Gabow02,
  author       = {Harold N. Gabow},
  editor       = {David Eppstein},
  title        = {An ear decomposition approach to approximating the smallest 3-edge
                  connected spanning subgraph of a multigraph},
  booktitle    = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
  pages        = {84--93},
  publisher    = {{ACM/SIAM}},
  year         = {2002},
  url          = {http://dl.acm.org/citation.cfm?id=545381.545391},
  timestamp    = {Fri, 07 Dec 2012 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/Gabow02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/GamburdP02,
  author       = {Alexander Gamburd and
                  Igor Pak},
  editor       = {David Eppstein},
  title        = {Expansion of product replacement graphs},
  booktitle    = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
  pages        = {691--696},
  publisher    = {{ACM/SIAM}},
  year         = {2002},
  url          = {http://dl.acm.org/citation.cfm?id=545381.545474},
  timestamp    = {Fri, 07 Dec 2012 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/GamburdP02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/GasieniecL02,
  author       = {Leszek Gasieniec and
                  Andrzej Lingas},
  editor       = {David Eppstein},
  title        = {On adaptive deterministic gossiping in ad hoc radio networks},
  booktitle    = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
  pages        = {689--690},
  publisher    = {{ACM/SIAM}},
  year         = {2002},
  url          = {http://dl.acm.org/citation.cfm?id=545381.545473},
  timestamp    = {Fri, 07 Dec 2012 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/GasieniecL02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/GoldsteinM02,
  author       = {Darin Goldstein and
                  Nick Meyer},
  editor       = {David Eppstein},
  title        = {The wake up and report problem is time-equivalent to the firing squad
                  synchronization problem},
  booktitle    = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
  pages        = {578--587},
  publisher    = {{ACM/SIAM}},
  year         = {2002},
  url          = {http://dl.acm.org/citation.cfm?id=545381.545458},
  timestamp    = {Fri, 07 Dec 2012 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/GoldsteinM02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/GopalanKMMV02,
  author       = {Parikshit Gopalan and
                  Howard J. Karloff and
                  Aranyak Mehta and
                  Milena Mihail and
                  Nisheeth K. Vishnoi},
  editor       = {David Eppstein},
  title        = {Caching with expiration times},
  booktitle    = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
  pages        = {540--547},
  publisher    = {{ACM/SIAM}},
  year         = {2002},
  url          = {http://dl.acm.org/citation.cfm?id=545381.545454},
  timestamp    = {Fri, 07 Dec 2012 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/GopalanKMMV02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/GrigniS02,
  author       = {Michelangelo Grigni and
                  Papa A. Sissokho},
  editor       = {David Eppstein},
  title        = {Light spanners and approximate {TSP} in weighted graphs with forbidden
                  minors},
  booktitle    = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
  pages        = {852--857},
  publisher    = {{ACM/SIAM}},
  year         = {2002},
  url          = {http://dl.acm.org/citation.cfm?id=545381.545492},
  timestamp    = {Tue, 10 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/GrigniS02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/GudmundssonLNS02,
  author       = {Joachim Gudmundsson and
                  Christos Levcopoulos and
                  Giri Narasimhan and
                  Michiel H. M. Smid},
  editor       = {David Eppstein},
  title        = {Approximate distance oracles for geometric graphs},
  booktitle    = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
  pages        = {828--837},
  publisher    = {{ACM/SIAM}},
  year         = {2002},
  url          = {http://dl.acm.org/citation.cfm?id=545381.545489},
  timestamp    = {Fri, 07 Dec 2012 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/GudmundssonLNS02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/GuhaHKO02,
  author       = {Sudipto Guha and
                  Refael Hassin and
                  Samir Khuller and
                  Einat Or},
  editor       = {David Eppstein},
  title        = {Capacitated vertex covering with applications},
  booktitle    = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
  pages        = {858--865},
  publisher    = {{ACM/SIAM}},
  year         = {2002},
  url          = {http://dl.acm.org/citation.cfm?id=545381.545493},
  timestamp    = {Fri, 07 Dec 2012 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/GuhaHKO02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/GuhaM02,
  author       = {Sudipto Guha and
                  Kamesh Munagala},
  editor       = {David Eppstein},
  title        = {Improved algorithms for the data placement problem},
  booktitle    = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
  pages        = {106--107},
  publisher    = {{ACM/SIAM}},
  year         = {2002},
  url          = {http://dl.acm.org/citation.cfm?id=545381.545394},
  timestamp    = {Fri, 07 Dec 2012 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/GuhaM02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/GuhaM02a,
  author       = {Sudipto Guha and
                  Kamesh Munagala},
  editor       = {David Eppstein},
  title        = {Generalized clustering},
  booktitle    = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
  pages        = {484--485},
  publisher    = {{ACM/SIAM}},
  year         = {2002},
  url          = {http://dl.acm.org/citation.cfm?id=545381.545446},
  timestamp    = {Fri, 07 Dec 2012 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/GuhaM02a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/HalperinLZ02,
  author       = {Eran Halperin and
                  Dror Livnat and
                  Uri Zwick},
  editor       = {David Eppstein},
  title        = {{MAX} {CUT} in cubic graphs},
  booktitle    = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
  pages        = {506--513},
  publisher    = {{ACM/SIAM}},
  year         = {2002},
  url          = {http://dl.acm.org/citation.cfm?id=545381.545449},
  timestamp    = {Fri, 07 Dec 2012 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/HalperinLZ02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/Hart02,
  author       = {David Hart},
  editor       = {David Eppstein},
  title        = {An optimal (expected time) algorithm for minimizing lab costs in {DNA}
                  sequencing},
  booktitle    = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
  pages        = {885--893},
  publisher    = {{ACM/SIAM}},
  year         = {2002},
  url          = {http://dl.acm.org/citation.cfm?id=545381.545496},
  timestamp    = {Fri, 07 Dec 2012 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/Hart02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/HaywardHR02,
  author       = {Ryan B. Hayward and
                  Stefan Hougardy and
                  Bruce A. Reed},
  editor       = {David Eppstein},
  title        = {Polynomial time recognition of P4-structure},
  booktitle    = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
  pages        = {382--389},
  publisher    = {{ACM/SIAM}},
  year         = {2002},
  url          = {http://dl.acm.org/citation.cfm?id=545381.545431},
  timestamp    = {Fri, 07 Dec 2012 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/HaywardHR02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/HongME02,
  author       = {Seok{-}Hee Hong and
                  Brendan D. McKay and
                  Peter Eades},
  editor       = {David Eppstein},
  title        = {Symmetric drawings of triconnected planar graphs},
  booktitle    = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
  pages        = {356--365},
  publisher    = {{ACM/SIAM}},
  year         = {2002},
  url          = {http://dl.acm.org/citation.cfm?id=545381.545428},
  timestamp    = {Thu, 27 Apr 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/soda/HongME02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/Indyk02,
  author       = {Piotr Indyk},
  editor       = {David Eppstein},
  title        = {Explicit constructions of selectors and related combinatorial structures,
                  with applications},
  booktitle    = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
  pages        = {697--704},
  publisher    = {{ACM/SIAM}},
  year         = {2002},
  url          = {http://dl.acm.org/citation.cfm?id=545381.545475},
  timestamp    = {Fri, 07 Dec 2012 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/Indyk02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/IraniLR02,
  author       = {Sandy Irani and
                  Xiangwen Lu and
                  Amelia Regan},
  editor       = {David Eppstein},
  title        = {On-line algorithms for the dynamic traveling repair problem},
  booktitle    = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
  pages        = {517--524},
  publisher    = {{ACM/SIAM}},
  year         = {2002},
  url          = {http://dl.acm.org/citation.cfm?id=545381.545451},
  timestamp    = {Fri, 07 Dec 2012 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/IraniLR02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/Iwata02,
  author       = {Satoru Iwata},
  editor       = {David Eppstein},
  title        = {A fully combinatorial algorithm for submodular function minimization},
  booktitle    = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
  pages        = {915--919},
  publisher    = {{ACM/SIAM}},
  year         = {2002},
  url          = {http://dl.acm.org/citation.cfm?id=545381.545500},
  timestamp    = {Wed, 16 May 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/soda/Iwata02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/Kalai02,
  author       = {Adam Kalai},
  editor       = {David Eppstein},
  title        = {Generating random factored numbers, easily},
  booktitle    = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
  pages        = {412--412},
  publisher    = {{ACM/SIAM}},
  year         = {2002},
  url          = {http://dl.acm.org/citation.cfm?id=545381.545435},
  timestamp    = {Fri, 07 Dec 2012 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/Kalai02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/Kalai02a,
  author       = {Adam Kalai},
  editor       = {David Eppstein},
  title        = {Efficient pattern-matching with don't cares},
  booktitle    = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
  pages        = {655--656},
  publisher    = {{ACM/SIAM}},
  year         = {2002},
  url          = {http://dl.acm.org/citation.cfm?id=545381.545468},
  timestamp    = {Fri, 07 Dec 2012 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/Kalai02a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/KaplanMS02,
  author       = {Haim Kaplan and
                  Tova Milo and
                  Ronen Shabo},
  editor       = {David Eppstein},
  title        = {A comparison of labeling schemes for ancestor queries},
  booktitle    = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
  pages        = {954--963},
  publisher    = {{ACM/SIAM}},
  year         = {2002},
  url          = {http://dl.acm.org/citation.cfm?id=545381.545505},
  timestamp    = {Fri, 07 Dec 2012 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/KaplanMS02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/KaplanST02,
  author       = {Haim Kaplan and
                  Nira Shafrir and
                  Robert Endre Tarjan},
  editor       = {David Eppstein},
  title        = {Union-find with deletions},
  booktitle    = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
  pages        = {19--28},
  publisher    = {{ACM/SIAM}},
  year         = {2002},
  url          = {http://dl.acm.org/citation.cfm?id=545381.545384},
  timestamp    = {Fri, 07 Dec 2012 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/KaplanST02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/Karakostas02,
  author       = {George Karakostas},
  editor       = {David Eppstein},
  title        = {Faster approximation schemes for fractional multicommodity flow problems},
  booktitle    = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
  pages        = {166--173},
  publisher    = {{ACM/SIAM}},
  year         = {2002},
  url          = {http://dl.acm.org/citation.cfm?id=545381.545402},
  timestamp    = {Fri, 07 Dec 2012 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/Karakostas02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/KatzKKP02,
  author       = {Michal Katz and
                  Nir A. Katz and
                  Amos Korman and
                  David Peleg},
  editor       = {David Eppstein},
  title        = {Labeling schemes for flow and connectivity},
  booktitle    = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
  pages        = {927--936},
  publisher    = {{ACM/SIAM}},
  year         = {2002},
  url          = {http://dl.acm.org/citation.cfm?id=545381.545502},
  timestamp    = {Fri, 07 Dec 2012 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/KatzKKP02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/Klein02,
  author       = {Philip N. Klein},
  editor       = {David Eppstein},
  title        = {Preprocessing an undirected planar network to enable fast approximate
                  distance queries},
  booktitle    = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
  pages        = {820--827},
  publisher    = {{ACM/SIAM}},
  year         = {2002},
  url          = {http://dl.acm.org/citation.cfm?id=545381.545488},
  timestamp    = {Fri, 07 Dec 2012 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/Klein02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/KohayakawaRT02,
  author       = {Yoshiharu Kohayakawa and
                  Vojtech R{\"{o}}dl and
                  Lubos Thoma},
  editor       = {David Eppstein},
  title        = {An optimal algorithm for checking regularity (extended abstract)},
  booktitle    = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
  pages        = {277--286},
  publisher    = {{ACM/SIAM}},
  year         = {2002},
  url          = {http://dl.acm.org/citation.cfm?id=545381.545418},
  timestamp    = {Fri, 07 Dec 2012 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/KohayakawaRT02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/KohlerS02,
  author       = {Ekkehard K{\"{o}}hler and
                  Martin Skutella},
  editor       = {David Eppstein},
  title        = {Flows over time with load-dependent transit times},
  booktitle    = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
  pages        = {174--183},
  publisher    = {{ACM/SIAM}},
  year         = {2002},
  url          = {http://dl.acm.org/citation.cfm?id=545381.545403},
  timestamp    = {Fri, 07 Dec 2012 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/KohlerS02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/KolmanS02,
  author       = {Petr Kolman and
                  Christian Scheideler},
  editor       = {David Eppstein},
  title        = {Improved bounds for the unsplittable flow problem},
  booktitle    = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
  pages        = {184--193},
  publisher    = {{ACM/SIAM}},
  year         = {2002},
  url          = {http://dl.acm.org/citation.cfm?id=545381.545404},
  timestamp    = {Fri, 07 Dec 2012 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/KolmanS02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/KoltunS02,
  author       = {Vladlen Koltun and
                  Micha Sharir},
  editor       = {David Eppstein},
  title        = {On the overlay of envelopes in four dimensions},
  booktitle    = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
  pages        = {810--819},
  publisher    = {{ACM/SIAM}},
  year         = {2002},
  url          = {http://dl.acm.org/citation.cfm?id=545381.545487},
  timestamp    = {Fri, 07 Dec 2012 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/KoltunS02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/KrishnanMV02,
  author       = {Shankar Krishnan and
                  Nabil H. Mustafa and
                  Suresh Venkatasubramanian},
  editor       = {David Eppstein},
  title        = {Hardware-assisted computation of depth contours},
  booktitle    = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
  pages        = {558--567},
  publisher    = {{ACM/SIAM}},
  year         = {2002},
  url          = {http://dl.acm.org/citation.cfm?id=545381.545456},
  timestamp    = {Fri, 07 Dec 2012 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/KrishnanMV02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/KrumkeLPPRSW02,
  author       = {Sven Oliver Krumke and
                  Maarten Lipmann and
                  Willem de Paepe and
                  Diana Poensgen and
                  J{\"{o}}rg Rambau and
                  Leen Stougie and
                  Gerhard J. Woeginger},
  editor       = {David Eppstein},
  title        = {How to cut a cake almost fairly},
  booktitle    = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
  pages        = {263--264},
  publisher    = {{ACM/SIAM}},
  year         = {2002},
  url          = {http://dl.acm.org/citation.cfm?id=545381.545415},
  timestamp    = {Fri, 07 Dec 2012 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/KrumkeLPPRSW02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/LehmanS02,
  author       = {Eric Lehman and
                  Abhi Shelat},
  editor       = {David Eppstein},
  title        = {Approximation algorithms for grammar-based compression},
  booktitle    = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
  pages        = {205--212},
  publisher    = {{ACM/SIAM}},
  year         = {2002},
  url          = {http://dl.acm.org/citation.cfm?id=545381.545407},
  timestamp    = {Fri, 07 Dec 2012 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/LehmanS02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/Lu02,
  author       = {Hsueh{-}I Lu},
  editor       = {David Eppstein},
  title        = {Linear-time compression of bounded-genus graphs into information-theoretically
                  optimal number of bits},
  booktitle    = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
  pages        = {223--224},
  publisher    = {{ACM/SIAM}},
  year         = {2002},
  url          = {http://dl.acm.org/citation.cfm?id=545381.545409},
  timestamp    = {Fri, 07 Dec 2012 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/Lu02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/MaheshwariZ02,
  author       = {Anil Maheshwari and
                  Norbert Zeh},
  editor       = {David Eppstein},
  title        = {I/O-optimal algorithms for planar graphs using separators},
  booktitle    = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
  pages        = {372--381},
  publisher    = {{ACM/SIAM}},
  year         = {2002},
  url          = {http://dl.acm.org/citation.cfm?id=545381.545430},
  timestamp    = {Fri, 07 Dec 2012 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/MaheshwariZ02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/McConnellS02,
  author       = {Ross M. McConnell and
                  Jeremy P. Spinrad},
  editor       = {David Eppstein},
  title        = {Construction of probe interval models},
  booktitle    = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
  pages        = {866--875},
  publisher    = {{ACM/SIAM}},
  year         = {2002},
  url          = {http://dl.acm.org/citation.cfm?id=545381.545494},
  timestamp    = {Wed, 01 Apr 2015 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/soda/McConnellS02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/MooreRR02,
  author       = {Cristopher Moore and
                  Ivan Rapaport and
                  Eric R{\'{e}}mila},
  editor       = {David Eppstein},
  title        = {Tiling groups for Wang tiles},
  booktitle    = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
  pages        = {402--411},
  publisher    = {{ACM/SIAM}},
  year         = {2002},
  url          = {http://dl.acm.org/citation.cfm?id=545381.545434},
  timestamp    = {Fri, 07 Dec 2012 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/MooreRR02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/Muthukrishnan02,
  author       = {S. Muthukrishnan},
  editor       = {David Eppstein},
  title        = {Efficient algorithms for document retrieval problems},
  booktitle    = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
  pages        = {657--666},
  publisher    = {{ACM/SIAM}},
  year         = {2002},
  url          = {http://dl.acm.org/citation.cfm?id=545381.545469},
  timestamp    = {Mon, 10 May 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/soda/Muthukrishnan02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/Newman02,
  author       = {Alantha Newman},
  editor       = {David Eppstein},
  title        = {A new algorithm for protein folding in the {HP} model},
  booktitle    = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
  pages        = {876--884},
  publisher    = {{ACM/SIAM}},
  year         = {2002},
  url          = {http://dl.acm.org/citation.cfm?id=545381.545495},
  timestamp    = {Fri, 07 Dec 2012 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/Newman02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/PaghP02,
  author       = {Rasmus Pagh and
                  Jakob Pagter},
  editor       = {David Eppstein},
  title        = {Optimal time-space trade-offs for non-comparison-based sorting},
  booktitle    = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
  pages        = {9--18},
  publisher    = {{ACM/SIAM}},
  year         = {2002},
  url          = {http://dl.acm.org/citation.cfm?id=545381.545383},
  timestamp    = {Fri, 07 Dec 2012 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/PaghP02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/Pak02,
  author       = {Igor Pak},
  editor       = {David Eppstein},
  title        = {Mixing time and long paths in graphs},
  booktitle    = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
  pages        = {321--328},
  publisher    = {{ACM/SIAM}},
  year         = {2002},
  url          = {http://dl.acm.org/citation.cfm?id=545381.545424},
  timestamp    = {Fri, 07 Dec 2012 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/Pak02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/Parekh02,
  author       = {Ojas Parekh},
  editor       = {David Eppstein},
  title        = {Edge dominating and hypomatchable sets},
  booktitle    = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
  pages        = {287--291},
  publisher    = {{ACM/SIAM}},
  year         = {2002},
  url          = {http://dl.acm.org/citation.cfm?id=545381.545419},
  timestamp    = {Fri, 07 Dec 2012 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/Parekh02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/PettieR02,
  author       = {Seth Pettie and
                  Vijaya Ramachandran},
  editor       = {David Eppstein},
  title        = {Computing shortest paths with comparisons and additions},
  booktitle    = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
  pages        = {267--276},
  publisher    = {{ACM/SIAM}},
  year         = {2002},
  url          = {http://dl.acm.org/citation.cfm?id=545381.545417},
  timestamp    = {Fri, 07 Dec 2012 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/PettieR02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/PettieR02a,
  author       = {Seth Pettie and
                  Vijaya Ramachandran},
  editor       = {David Eppstein},
  title        = {Minimizing randomness in minimum spanning tree, parallel connectivity,
                  and set maxima algorithms},
  booktitle    = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
  pages        = {713--722},
  publisher    = {{ACM/SIAM}},
  year         = {2002},
  url          = {http://dl.acm.org/citation.cfm?id=545381.545477},
  timestamp    = {Fri, 07 Dec 2012 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/PettieR02a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/RamanRR02,
  author       = {Rajeev Raman and
                  Venkatesh Raman and
                  S. Srinivasa Rao},
  editor       = {David Eppstein},
  title        = {Succinct indexable dictionaries with applications to encoding k-ary
                  trees and multisets},
  booktitle    = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
  pages        = {233--242},
  publisher    = {{ACM/SIAM}},
  year         = {2002},
  url          = {http://dl.acm.org/citation.cfm?id=545381.545411},
  timestamp    = {Fri, 27 May 2016 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/soda/RamanRR02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/RasalaSTU02,
  author       = {April Rasala and
                  Clifford Stein and
                  Eric Torng and
                  Patchrawat Uthaisombut},
  editor       = {David Eppstein},
  title        = {Existence theorems, lower bounds and algorithms for scheduling to
                  meet two objectives},
  booktitle    = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
  pages        = {723--731},
  publisher    = {{ACM/SIAM}},
  year         = {2002},
  url          = {http://dl.acm.org/citation.cfm?id=545381.545478},
  timestamp    = {Mon, 17 Aug 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/soda/RasalaSTU02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/RaviS02,
  author       = {R. Ravi and
                  Amitabh Sinha II},
  editor       = {David Eppstein},
  title        = {Approximating k-cuts via network strength},
  booktitle    = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
  pages        = {621--622},
  publisher    = {{ACM/SIAM}},
  year         = {2002},
  url          = {http://dl.acm.org/citation.cfm?id=545381.545463},
  timestamp    = {Mon, 31 Aug 2015 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/soda/RaviS02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/RaviW02,
  author       = {R. Ravi and
                  David P. Williamson},
  editor       = {David Eppstein},
  title        = {Erratum: an approximation algorithm for minimum-cost vertex-connectivity
                  problems},
  booktitle    = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
  pages        = {1000--1001},
  publisher    = {{ACM/SIAM}},
  year         = {2002},
  url          = {http://dl.acm.org/citation.cfm?id=545381.545510},
  timestamp    = {Mon, 31 Aug 2015 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/soda/RaviW02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/RinaldiVW02,
  author       = {Giovanni Rinaldi and
                  Ulrich Voigt and
                  Gerhard J. Woeginger},
  editor       = {David Eppstein},
  title        = {The mathematics of playing golf},
  booktitle    = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
  pages        = {265--266},
  publisher    = {{ACM/SIAM}},
  year         = {2002},
  url          = {http://dl.acm.org/citation.cfm?id=545381.545416},
  timestamp    = {Fri, 07 Dec 2012 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/RinaldiVW02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/RodittyTZ02,
  author       = {Liam Roditty and
                  Mikkel Thorup and
                  Uri Zwick},
  editor       = {David Eppstein},
  title        = {Roundtrip spanners and roundtrip routing in directed graphs},
  booktitle    = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
  pages        = {844--851},
  publisher    = {{ACM/SIAM}},
  year         = {2002},
  url          = {http://dl.acm.org/citation.cfm?id=545381.545491},
  timestamp    = {Fri, 07 Dec 2012 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/RodittyTZ02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/Roughgarden02,
  author       = {Tim Roughgarden},
  editor       = {David Eppstein},
  title        = {How unfair is optimal routing?},
  booktitle    = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
  pages        = {203--204},
  publisher    = {{ACM/SIAM}},
  year         = {2002},
  url          = {http://dl.acm.org/citation.cfm?id=545381.545406},
  timestamp    = {Fri, 07 Dec 2012 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/Roughgarden02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/Sadakane02,
  author       = {Kunihiko Sadakane},
  editor       = {David Eppstein},
  title        = {Succinct representations of lcp information and improvements in the
                  compressed suffix arrays},
  booktitle    = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
  pages        = {225--232},
  publisher    = {{ACM/SIAM}},
  year         = {2002},
  url          = {http://dl.acm.org/citation.cfm?id=545381.545410},
  timestamp    = {Fri, 07 Dec 2012 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/Sadakane02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/SeidenS02,
  author       = {Steven S. Seiden and
                  Rob van Stee},
  editor       = {David Eppstein},
  title        = {New bounds for multi-dimensional packing},
  booktitle    = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
  pages        = {486--495},
  publisher    = {{ACM/SIAM}},
  year         = {2002},
  url          = {http://dl.acm.org/citation.cfm?id=545381.545447},
  timestamp    = {Fri, 07 Dec 2012 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/SeidenS02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/ShahF02,
  author       = {Rahul Shah and
                  Martin Farach{-}Colton},
  editor       = {David Eppstein},
  title        = {Undiscretized dynamic programming: faster algorithms for facility
                  location and related problems on trees},
  booktitle    = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
  pages        = {108--115},
  publisher    = {{ACM/SIAM}},
  year         = {2002},
  url          = {http://dl.acm.org/citation.cfm?id=545381.545395},
  timestamp    = {Wed, 28 Feb 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/ShahF02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/Toth02,
  author       = {Csaba D. T{\'{o}}th},
  editor       = {David Eppstein},
  title        = {Binary space partitions for line segments with a limited number of
                  directions},
  booktitle    = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
  pages        = {465--471},
  publisher    = {{ACM/SIAM}},
  year         = {2002},
  url          = {http://dl.acm.org/citation.cfm?id=545381.545443},
  timestamp    = {Fri, 07 Dec 2012 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/Toth02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/VedovaJLW02,
  author       = {Gianluca Della Vedova and
                  Tao Jiang and
                  Jing Li and
                  Jianjun Wen},
  editor       = {David Eppstein},
  title        = {Approximating minimum quartet inconsistency (abstract)},
  booktitle    = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
  pages        = {894--895},
  publisher    = {{ACM/SIAM}},
  year         = {2002},
  url          = {http://dl.acm.org/citation.cfm?id=545381.545497},
  timestamp    = {Thu, 31 Mar 2016 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/soda/VedovaJLW02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/Williams02,
  author       = {Ryan Williams},
  editor       = {David Eppstein},
  title        = {Algorithms for quantified Boolean formulas},
  booktitle    = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
  pages        = {299--307},
  publisher    = {{ACM/SIAM}},
  year         = {2002},
  url          = {http://dl.acm.org/citation.cfm?id=545381.545421},
  timestamp    = {Wed, 02 Nov 2016 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/Williams02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/ZosinK02,
  author       = {Leonid Zosin and
                  Samir Khuller},
  editor       = {David Eppstein},
  title        = {On directed Steiner trees},
  booktitle    = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
  pages        = {59--63},
  publisher    = {{ACM/SIAM}},
  year         = {2002},
  url          = {http://dl.acm.org/citation.cfm?id=545381.545388},
  timestamp    = {Fri, 07 Dec 2012 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/ZosinK02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/Zwick02,
  author       = {Uri Zwick},
  editor       = {David Eppstein},
  title        = {Jenga},
  booktitle    = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
  pages        = {243--246},
  publisher    = {{ACM/SIAM}},
  year         = {2002},
  url          = {http://dl.acm.org/citation.cfm?id=545381.545412},
  timestamp    = {Fri, 07 Dec 2012 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/Zwick02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/Zwick02a,
  author       = {Uri Zwick},
  editor       = {David Eppstein},
  title        = {Computer assisted proof of optimal approximability results},
  booktitle    = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
  pages        = {496--505},
  publisher    = {{ACM/SIAM}},
  year         = {2002},
  url          = {http://dl.acm.org/citation.cfm?id=545381.545448},
  timestamp    = {Fri, 07 Dec 2012 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/Zwick02a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/soda/2002,
  editor       = {David Eppstein},
  title        = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
  publisher    = {{ACM/SIAM}},
  year         = {2002},
  url          = {http://dl.acm.org/citation.cfm?id=545381},
  isbn         = {0-89871-513-X},
  timestamp    = {Fri, 07 Dec 2012 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/2002.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics