BibTeX records: David S. Johnson

download as .bib file

@incollection{DBLP:reference/algo/Johnson16,
  author    = {David S. Johnson},
  title     = {Bin Packing},
  booktitle = {Encyclopedia of Algorithms},
  pages     = {207--211},
  year      = {2016},
  url       = {https://doi.org/10.1007/978-1-4939-2864-4_49},
  doi       = {10.1007/978-1-4939-2864-4_49},
  timestamp = {Wed, 12 Jul 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/reference/algo/Johnson16},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@incollection{DBLP:reference/algo/DemetrescuGJ16,
  author    = {Camil Demetrescu and
               Andrew V. Goldberg and
               David S. Johnson},
  title     = {Implementation Challenge for Shortest Paths},
  booktitle = {Encyclopedia of Algorithms},
  pages     = {947--951},
  year      = {2016},
  url       = {https://doi.org/10.1007/978-1-4939-2864-4_181},
  doi       = {10.1007/978-1-4939-2864-4_181},
  timestamp = {Wed, 12 Jul 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/reference/algo/DemetrescuGJ16},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@incollection{DBLP:reference/algo/Johnson16a,
  author    = {David S. Johnson},
  title     = {Vector Bin Packing},
  booktitle = {Encyclopedia of Algorithms},
  pages     = {2319--2323},
  year      = {2016},
  url       = {https://doi.org/10.1007/978-1-4939-2864-4_495},
  doi       = {10.1007/978-1-4939-2864-4_495},
  timestamp = {Wed, 12 Jul 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/reference/algo/Johnson16a},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/corr/JohnsonBDD0HKRS16,
  author    = {David S. Johnson and
               Lee Breslau and
               Ilias Diakonikolas and
               Nick G. Duffield and
               Yu Gu and
               MohammadTaghi Hajiaghayi and
               Howard J. Karloff and
               Mauricio G. C. Resende and
               Subhabrata Sen},
  title     = {Near-Optimal Disjoint-Path Facility Location Through Set Cover by
               Pairs},
  journal   = {CoRR},
  volume    = {abs/1611.01210},
  year      = {2016},
  url       = {http://arxiv.org/abs/1611.01210},
  archivePrefix = {arXiv},
  eprint    = {1611.01210},
  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/corr/JohnsonBDD0HKRS16},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/dagstuhl-reports/DellingDJV16,
  author    = {Daniel Delling and
               Camil Demetrescu and
               David S. Johnson and
               Jan Vitek},
  title     = {Rethinking Experimental Methods in Computing (Dagstuhl Seminar 16111)},
  journal   = {Dagstuhl Reports},
  volume    = {6},
  number    = {3},
  pages     = {24--43},
  year      = {2016},
  url       = {https://doi.org/10.4230/DagRep.6.3.24},
  doi       = {10.4230/DagRep.6.3.24},
  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/dagstuhl-reports/DellingDJV16},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/tcc/GarayGJKY15,
  author    = {Juan A. Garay and
               Ran Gelles and
               David S. Johnson and
               Aggelos Kiayias and
               Moti Yung},
  title     = {A Little Honesty Goes a Long Way - The Two-Tier Model for Secure Multiparty
               Computation},
  booktitle = {Theory of Cryptography - 12th Theory of Cryptography Conference, {TCC}
               2015, Warsaw, Poland, March 23-25, 2015, Proceedings, Part {I}},
  pages     = {134--158},
  year      = {2015},
  crossref  = {DBLP:conf/tcc/2015-1},
  url       = {https://doi.org/10.1007/978-3-662-46494-6_7},
  doi       = {10.1007/978-3-662-46494-6_7},
  timestamp = {Sat, 16 Sep 2017 12:07:36 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/tcc/GarayGJKY15},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/iacr/GarayGJKY14,
  author    = {Juan A. Garay and
               Ran Gelles and
               David S. Johnson and
               Aggelos Kiayias and
               Moti Yung},
  title     = {A Little Honesty Goes a Long Way: The Two-Tier Model for Secure Multiparty
               Computation},
  journal   = {{IACR} Cryptology ePrint Archive},
  volume    = {2014},
  pages     = {209},
  year      = {2014},
  url       = {http://eprint.iacr.org/2014/209},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/iacr/GarayGJKY14},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/innovations/GarayJKY13,
  author    = {Juan A. Garay and
               David S. Johnson and
               Aggelos Kiayias and
               Moti Yung},
  title     = {Resource-based corruptions and the combinatorics of hidden diversity},
  booktitle = {Innovations in Theoretical Computer Science, {ITCS} '13, Berkeley,
               CA, USA, January 9-12, 2013},
  pages     = {415--428},
  year      = {2013},
  crossref  = {DBLP:conf/innovations/2013},
  url       = {http://doi.acm.org/10.1145/2422436.2422482},
  doi       = {10.1145/2422436.2422482},
  timestamp = {Mon, 06 May 2013 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/innovations/GarayJKY13},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/dagstuhl-reports/GoldbergIJW13,
  author    = {Andrew V. Goldberg and
               Giuseppe F. Italiano and
               David S. Johnson and
               Dorothea Wagner},
  title     = {Algorithm Engineering (Dagstuhl Seminar 13391)},
  journal   = {Dagstuhl Reports},
  volume    = {3},
  number    = {9},
  pages     = {169--189},
  year      = {2013},
  url       = {https://doi.org/10.4230/DagRep.3.9.169},
  doi       = {10.4230/DagRep.3.9.169},
  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/dagstuhl-reports/GoldbergIJW13},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/iacr/GarayJKY12,
  author    = {Juan A. Garay and
               David S. Johnson and
               Aggelos Kiayias and
               Moti Yung},
  title     = {Resource-based Corruptions and the Combinatorics of Hidden Diversity},
  journal   = {{IACR} Cryptology ePrint Archive},
  volume    = {2012},
  pages     = {556},
  year      = {2012},
  url       = {http://eprint.iacr.org/2012/556},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/iacr/GarayJKY12},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/alenex/BreslauDDGHJKRS11,
  author    = {Lee Breslau and
               Ilias Diakonikolas and
               Nick G. Duffield and
               Yu Gu and
               Mohammad Taghi Hajiaghayi and
               David S. Johnson and
               Howard J. Karloff and
               Mauricio G. C. Resende and
               Subhabrata Sen},
  title     = {Disjoint-Path Facility Location: Theory and Practice},
  booktitle = {Proceedings of the Thirteenth Workshop on Algorithm Engineering and
               Experiments, {ALENEX} 2011, Holiday Inn San Francisco Golden Gateway,
               San Francisco, California, USA, January 22, 2011},
  pages     = {60--74},
  year      = {2011},
  crossref  = {DBLP:conf/alenex/2011},
  url       = {https://doi.org/10.1137/1.9781611972917.7},
  doi       = {10.1137/1.9781611972917.7},
  timestamp = {Thu, 01 Jun 2017 18:58:35 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/alenex/BreslauDDGHJKRS11},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/dagstuhl/2010P10261,
  editor    = {Giuseppe F. Italiano and
               David S. Johnson and
               Petra Mutzel and
               Peter Sanders},
  title     = {Algorithm Engineering, 27.06. - 02.07.2010},
  series    = {Dagstuhl Seminar Proceedings},
  volume    = {10261},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik, Germany},
  year      = {2010},
  url       = {http://drops.dagstuhl.de/portals/10261/},
  timestamp = {Fri, 06 Jan 2017 00:00:00 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/dagstuhl/2010P10261},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/dagstuhl/ItalianoJMS10,
  author    = {Giuseppe F. Italiano and
               David S. Johnson and
               Petra Mutzel and
               Peter Sanders},
  title     = {10261 Abstracts Collection - Algorithm Engineering},
  booktitle = {Algorithm Engineering, 27.06. - 02.07.2010},
  year      = {2010},
  crossref  = {DBLP:conf/dagstuhl/2010P10261},
  url       = {http://drops.dagstuhl.de/opus/volltexte/2010/2817/},
  timestamp = {Sun, 09 Jul 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/dagstuhl/ItalianoJMS10},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/dagstuhl/ItalianoJMS10a,
  author    = {Giuseppe F. Italiano and
               David S. Johnson and
               Petra Mutzel and
               Peter Sanders},
  title     = {10261 Executive Summary - Algorithm Engineering},
  booktitle = {Algorithm Engineering, 27.06. - 02.07.2010},
  year      = {2010},
  crossref  = {DBLP:conf/dagstuhl/2010P10261},
  url       = {http://drops.dagstuhl.de/opus/volltexte/2010/2796/},
  timestamp = {Sun, 09 Jul 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/dagstuhl/ItalianoJMS10a},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/dimacs/dimacs74,
  editor    = {Camil Demetrescu and
               Andrew V. Goldberg and
               David S. Johnson},
  title     = {The Shortest Path Problem, Proceedings of a {DIMACS} Workshop, Piscataway,
               New Jersey, USA, November 13-14, 2006},
  series    = {{DIMACS} Series in Discrete Mathematics and Theoretical Computer Science},
  volume    = {74},
  publisher = {{DIMACS/AMS}},
  year      = {2009},
  url       = {http://dimacs.rutgers.edu/Volumes/Vol74.html},
  timestamp = {Wed, 30 Mar 2016 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/dimacs/dimacs74},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/dam/JohnsonMT08,
  author    = {David S. Johnson and
               Anuj Mehrotra and
               Michael A. Trick},
  title     = {Special issue on computational methods for graph coloring and its
               generalizations},
  journal   = {Discrete Applied Mathematics},
  volume    = {156},
  number    = {2},
  pages     = {145--146},
  year      = {2008},
  url       = {https://doi.org/10.1016/j.dam.2007.10.007},
  doi       = {10.1016/j.dam.2007.10.007},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/dam/JohnsonMT08},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@incollection{DBLP:reference/algo/DemetrescuGJ08,
  author    = {Camil Demetrescu and
               Andrew V. Goldberg and
               David S. Johnson},
  title     = {Implementation Challenge for Shortest Paths},
  booktitle = {Encyclopedia of Algorithms},
  year      = {2008},
  crossref  = {DBLP:reference/algo/2008},
  url       = {https://doi.org/10.1007/978-0-387-30162-4_181},
  doi       = {10.1007/978-0-387-30162-4_181},
  timestamp = {Wed, 12 Jul 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/reference/algo/DemetrescuGJ08},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@incollection{DBLP:reference/algo/Johnson08,
  author    = {David S. Johnson},
  title     = {Bin Packing},
  booktitle = {Encyclopedia of Algorithms},
  year      = {2008},
  crossref  = {DBLP:reference/algo/2008},
  url       = {https://doi.org/10.1007/978-0-387-30162-4_49},
  doi       = {10.1007/978-0-387-30162-4_49},
  timestamp = {Wed, 12 Jul 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/reference/algo/Johnson08},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/talg/Johnson07,
  author    = {David S. Johnson},
  title     = {The NP-completeness column: Finding needles in haystacks},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {3},
  number    = {2},
  pages     = {24},
  year      = {2007},
  url       = {http://doi.acm.org/10.1145/1240233.1240247},
  doi       = {10.1145/1240233.1240247},
  timestamp = {Fri, 06 Jan 2017 00:00:00 +0100},
  biburl    = {http://dblp.org/rec/bib/journals/talg/Johnson07},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/expcs/Johnson07,
  author    = {David S. Johnson},
  title     = {What is the science in experimental computer science?},
  booktitle = {Proceedings of the Workshop on Experimental Computer Science, Part
               of {ACM} FCRC, San Diego, 13-14 June 2007},
  pages     = {1},
  year      = {2007},
  crossref  = {DBLP:conf/expcs/2007},
  url       = {http://doi.acm.org/10.1145/1281700.1281701},
  doi       = {10.1145/1281700.1281701},
  timestamp = {Wed, 02 Apr 2008 15:38:49 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/expcs/Johnson07},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/soda/ApplegateCJKLW07,
  author    = {David Applegate and
               Gruia C{\u{a}}linescu and
               David S. Johnson and
               Howard J. Karloff and
               Katrina Ligett and
               Jia Wang},
  title     = {Compressing rectilinear pictures and minimizing access control lists},
  booktitle = {Proceedings of the Eighteenth Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, {SODA} 2007, New Orleans, Louisiana, USA, January 7-9,
               2007},
  pages     = {1066--1075},
  year      = {2007},
  crossref  = {DBLP:conf/soda/2007},
  url       = {http://dl.acm.org/citation.cfm?id=1283383.1283498},
  timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/soda/ApplegateCJKLW07},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/stoc/2007,
  editor    = {David S. Johnson and
               Uriel Feige},
  title     = {Proceedings of the 39th Annual {ACM} Symposium on Theory of Computing,
               San Diego, California, USA, June 11-13, 2007},
  publisher = {{ACM}},
  year      = {2007},
  isbn      = {978-1-59593-631-8},
  timestamp = {Wed, 13 Jun 2007 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/stoc/2007},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/jacm/CsirikJKOSW06,
  author    = {J{\'{a}}nos Csirik and
               David S. Johnson and
               Claire Kenyon and
               James B. Orlin and
               Peter W. Shor and
               Richard R. Weber},
  title     = {On the Sum-of-Squares algorithm for bin packing},
  journal   = {J. {ACM}},
  volume    = {53},
  number    = {1},
  pages     = {1--65},
  year      = {2006},
  url       = {http://doi.acm.org/10.1145/1120582.1120583},
  doi       = {10.1145/1120582.1120583},
  timestamp = {Wed, 05 Apr 2006 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/jacm/CsirikJKOSW06},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/talg/Johnson06,
  author    = {David S. Johnson},
  title     = {The NP-completeness column: The many limits on approximation},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {2},
  number    = {3},
  pages     = {473--489},
  year      = {2006},
  url       = {http://doi.acm.org/10.1145/1159892.1159901},
  doi       = {10.1145/1159892.1159901},
  timestamp = {Wed, 09 Mar 2016 00:00:00 +0100},
  biburl    = {http://dblp.org/rec/bib/journals/talg/Johnson06},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/talg/Johnson05,
  author    = {David S. Johnson},
  title     = {The NP-completeness column},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {1},
  number    = {1},
  pages     = {160--176},
  year      = {2005},
  url       = {http://doi.acm.org/10.1145/1077464.1077476},
  doi       = {10.1145/1077464.1077476},
  timestamp = {Wed, 09 Mar 2016 00:00:00 +0100},
  biburl    = {http://dblp.org/rec/bib/journals/talg/Johnson05},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/tvcg/ChhuganiPKCVJK05,
  author    = {Jatin Chhugani and
               Budirijanto Purnomo and
               Shankar Krishnan and
               Jonathan D. Cohen and
               Suresh Venkatasubramanian and
               David S. Johnson and
               Subodh Kumar},
  title     = {vLOD: High-Fidelity Walkthrough of Large Virtual Environments},
  journal   = {{IEEE} Trans. Vis. Comput. Graph.},
  volume    = {11},
  number    = {1},
  pages     = {35--47},
  year      = {2005},
  url       = {https://doi.org/10.1109/TVCG.2005.17},
  doi       = {10.1109/TVCG.2005.17},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/tvcg/ChhuganiPKCVJK05},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/corr/abs-cs-0509031,
  author    = {J{\'{a}}nos Csirik and
               David S. Johnson and
               Claire Kenyon},
  title     = {On the Worst-case Performance of the Sum-of-Squares Algorithm for
               Bin Packing},
  journal   = {CoRR},
  volume    = {abs/cs/0509031},
  year      = {2005},
  url       = {http://arxiv.org/abs/cs/0509031},
  archivePrefix = {arXiv},
  eprint    = {cs/0509031},
  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/corr/abs-cs-0509031},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/vldb/JohnsonKCKV04,
  author    = {David S. Johnson and
               Shankar Krishnan and
               Jatin Chhugani and
               Subodh Kumar and
               Suresh Venkatasubramanian},
  title     = {Compressing Large Boolean Matrices using Reordering Techniques},
  booktitle = {(e)Proceedings of the Thirtieth International Conference on Very Large
               Data Bases, Toronto, Canada, August 31 - September 3 2004},
  pages     = {13--23},
  year      = {2004},
  crossref  = {DBLP:conf/vldb/2004},
  url       = {http://www.vldb.org/conf/2004/RS1P1.PDF},
  timestamp = {Mon, 17 Sep 2012 22:06:33 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/vldb/JohnsonKCKV04},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/jacm/BarvinokFJTWW03,
  author    = {Alexander I. Barvinok and
               S{\'{a}}ndor P. Fekete and
               David S. Johnson and
               Arie Tamir and
               Gerhard J. Woeginger and
               Russell Woodroofe},
  title     = {The geometric maximum traveling salesman problem},
  journal   = {J. {ACM}},
  volume    = {50},
  number    = {5},
  pages     = {641--664},
  year      = {2003},
  url       = {http://doi.acm.org/10.1145/876638.876640},
  doi       = {10.1145/876638.876640},
  timestamp = {Thu, 09 Feb 2006 00:00:00 +0100},
  biburl    = {http://dblp.org/rec/bib/journals/jacm/BarvinokFJTWW03},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/alenex/ApplegateBDJS03,
  author    = {David Applegate and
               Luciana S. Buriol and
               Bernard L. Dillard and
               David S. Johnson and
               Peter W. Shor},
  title     = {The Cutting-Stock Approach to Bin Packing: Theory and Experiments},
  booktitle = {Proceedings of the Fifth Workshop on Algorithm Engineering and Experiments,
               Baltimore, MD, USA, January 11, 2003},
  pages     = {1--15},
  year      = {2003},
  crossref  = {DBLP:conf/alenex/2003},
  timestamp = {Fri, 10 Dec 2004 13:30:41 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/alenex/ApplegateBDJS03},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/siamrev/CoffmanCGJSWY02,
  author    = {Edward G. Coffman Jr. and
               Costas Courcoubetis and
               Michael R. Garey and
               David S. Johnson and
               Peter W. Shor and
               Richard R. Weber and
               Mihalis Yannakakis},
  title     = {Perfect Packing Theorems and the Average-Case Behavior of Optimal
               and Online Bin Packing},
  journal   = {{SIAM} Review},
  volume    = {44},
  number    = {1},
  pages     = {95--108},
  year      = {2002},
  url       = {https://doi.org/10.1137/S0036144501395423},
  doi       = {10.1137/S0036144501395423},
  timestamp = {Wed, 17 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/siamrev/CoffmanCGJSWY02},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/dimacs/dimacs59,
  editor    = {Michael H. Goldwasser and
               David S. Johnson and
               Catherine C. McGeoch},
  title     = {Data Structures, Near Neighbor Searches, and Methodology: Fifth and
               Sixth {DIMACS} Implementation Challenges, Proceedings of a {DIMACS}
               Workshop, USA, 1999},
  series    = {{DIMACS} Series in Discrete Mathematics and Theoretical Computer Science},
  volume    = {59},
  publisher = {{DIMACS/AMS}},
  year      = {2002},
  url       = {http://dimacs.rutgers.edu/Volumes/Vol59.html},
  timestamp = {Tue, 15 Mar 2016 00:00:00 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/dimacs/dimacs59},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/corr/cs-DS-0204024,
  author    = {Alexander I. Barvinok and
               S{\'{a}}ndor P. Fekete and
               David S. Johnson and
               Arie Tamir and
               Gerhard J. Woeginger and
               Russell Woodroofe},
  title     = {The Geometric Maximum Traveling Salesman Problem},
  journal   = {CoRR},
  volume    = {cs.DS/0204024},
  year      = {2002},
  url       = {http://arxiv.org/abs/cs.DS/0204024},
  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/corr/cs-DS-0204024},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/corr/cs-DS-0210013,
  author    = {J{\'{a}}nos Csirik and
               David S. Johnson and
               Claire Kenyon and
               James B. Orlin and
               Peter W. Shor and
               Richard R. Weber},
  title     = {On the Sum-of-Squares Algorithm for Bin Packing},
  journal   = {CoRR},
  volume    = {cs.DS/0210013},
  year      = {2002},
  url       = {http://arxiv.org/abs/cs.DS/0210013},
  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/corr/cs-DS-0210013},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/algorithmica/CsirikJ01,
  author    = {J{\'{a}}nos Csirik and
               David S. Johnson},
  title     = {Bounded Space On-Line Bin Packing: Best Is Better than First},
  journal   = {Algorithmica},
  volume    = {31},
  number    = {2},
  pages     = {115--138},
  year      = {2001},
  url       = {https://doi.org/10.1007/s00453-001-0041-7},
  doi       = {10.1007/s00453-001-0041-7},
  timestamp = {Wed, 17 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/algorithmica/CsirikJ01},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/alenex/CirasellaJMZ01,
  author    = {Jill Cirasella and
               David S. Johnson and
               Lyle A. McGeoch and
               Weixiong Zhang},
  title     = {The Asymmetric Traveling Salesman Problem: Algorithms, Instance Generators,
               and Tests},
  booktitle = {Algorithm Engineering and Experimentation, Third International Workshop,
               {ALENEX} 2001, Washington, DC, USA, January 5-6, 2001, Revised Papers},
  pages     = {32--59},
  year      = {2001},
  crossref  = {DBLP:conf/alenex/2001},
  url       = {https://doi.org/10.1007/3-540-44808-X_3},
  doi       = {10.1007/3-540-44808-X_3},
  timestamp = {Fri, 26 May 2017 14:09:14 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/alenex/CirasellaJMZ01},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/soda/CsirikJK01,
  author    = {J{\'{a}}nos Csirik and
               David S. Johnson and
               Claire Kenyon},
  title     = {Better approximation algorithms for bin covering},
  booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms,
               January 7-9, 2001, Washington, DC, {USA.}},
  pages     = {557--566},
  year      = {2001},
  crossref  = {DBLP:conf/soda/2001},
  url       = {http://dl.acm.org/citation.cfm?id=365411.365533},
  timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/soda/CsirikJK01},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/siamdm/CoffmanCGJSWY00,
  author    = {Edward G. Coffman Jr. and
               Costas Courcoubetis and
               M. R. Garey and
               David S. Johnson and
               Peter W. Shor and
               Richard R. Weber and
               Mihalis Yannakakis},
  title     = {Bin Packing with Discrete Item Sizes, Part {I:} Perfect Packing Theorems
               and the Average Case Behavior of Optimal Packings},
  journal   = {{SIAM} J. Discrete Math.},
  volume    = {13},
  number    = {3},
  pages     = {384--402},
  year      = {2000},
  url       = {https://doi.org/10.1137/S0895480197325936},
  doi       = {10.1137/S0895480197325936},
  timestamp = {Fri, 26 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/siamdm/CoffmanCGJSWY00},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/soda/JohnsonMP00,
  author    = {David S. Johnson and
               Maria Minkoff and
               Steven Phillips},
  title     = {The prize collecting Steiner tree problem: theory and practice},
  booktitle = {Proceedings of the Eleventh Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, January 9-11, 2000, San Francisco, CA, {USA.}},
  pages     = {760--769},
  year      = {2000},
  crossref  = {DBLP:conf/soda/2000},
  url       = {http://dl.acm.org/citation.cfm?id=338219.338637},
  timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/soda/JohnsonMP00},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/stoc/CsirikJKOSW00,
  author    = {J{\'{a}}nos Csirik and
               David S. Johnson and
               Claire Kenyon and
               James B. Orlin and
               Peter W. Shor and
               Richard R. Weber},
  title     = {On the sum-of-squares algorithm for bin packing},
  booktitle = {Proceedings of the Thirty-Second Annual {ACM} Symposium on Theory
               of Computing, May 21-23, 2000, Portland, OR, {USA}},
  pages     = {208--217},
  year      = {2000},
  crossref  = {DBLP:conf/stoc/2000},
  url       = {http://doi.acm.org/10.1145/335305.335331},
  doi       = {10.1145/335305.335331},
  timestamp = {Thu, 16 Feb 2012 00:00:00 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/stoc/CsirikJKOSW00},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/alenex/CsirikJKSW99,
  author    = {J{\'{a}}nos Csirik and
               David S. Johnson and
               Claire Kenyon and
               Peter W. Shor and
               Richard R. Weber},
  title     = {A Self Organizing Bin Packing Heuristic},
  booktitle = {Algorithm Engineering and Experimentation, International Workshop
               {ALENEX} '99, Baltimore, MD, USA, January 15-16, 1999, Selected Papers},
  pages     = {246--265},
  year      = {1999},
  crossref  = {DBLP:conf/alenex/1999},
  url       = {https://doi.org/10.1007/3-540-48518-X_15},
  doi       = {10.1007/3-540-48518-X_15},
  timestamp = {Thu, 15 Jun 2017 21:39:32 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/alenex/CsirikJKSW99},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/dimacs/Johnson99,
  author    = {David S. Johnson},
  title     = {A theoretician's guide to the experimental analysis of algorithms},
  booktitle = {Data Structures, Near Neighbor Searches, and Methodology: Fifth and
               Sixth {DIMACS} Implementation Challenges, Proceedings of a {DIMACS}
               Workshop, USA, 1999},
  pages     = {215--250},
  year      = {1999},
  crossref  = {DBLP:conf/dimacs/dimacs59},
  timestamp = {Tue, 15 Mar 2016 17:08:05 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/dimacs/Johnson99},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/soda/JohnsonS99,
  author    = {David S. Johnson and
               Mario Szegedy},
  title     = {What are the Least Tractable Instances of max Tndependent Set?},
  booktitle = {Proceedings of the Tenth Annual {ACM-SIAM} Symposium on Discrete Algorithms,
               17-19 January 1999, Baltimore, Maryland.},
  pages     = {927--928},
  year      = {1999},
  crossref  = {DBLP:conf/soda/1999},
  url       = {http://dl.acm.org/citation.cfm?id=314500.315093},
  timestamp = {Mon, 14 Mar 2016 15:38:52 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/soda/JohnsonS99},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/ipco/BarvinokJWW98,
  author    = {Alexander I. Barvinok and
               David S. Johnson and
               Gerhard J. Woeginger and
               Russell Woodroofe},
  title     = {The Maximum Traveling Salesman Problem Under Polyhedral Norms},
  booktitle = {Integer Programming and Combinatorial Optimization, 6th International
               {IPCO} Conference, Houston, Texas, USA, June 22-24, 1998, Proceedings},
  pages     = {195--201},
  year      = {1998},
  crossref  = {DBLP:conf/ipco/1998},
  url       = {https://doi.org/10.1007/3-540-69346-7_15},
  doi       = {10.1007/3-540-69346-7_15},
  timestamp = {Sun, 04 Jun 2017 10:11:25 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/ipco/BarvinokJWW98},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/rsa/CoffmanJSW97,
  author    = {Edward G. Coffman Jr. and
               David S. Johnson and
               Peter W. Shor and
               Richard R. Weber},
  title     = {Bin packing with discrete item sizes, part {II:} Tight bounds on First
               Fit},
  journal   = {Random Struct. Algorithms},
  volume    = {10},
  number    = {1-2},
  pages     = {69--101},
  year      = {1997},
  url       = {https://doi.org/10.1002/(SICI)1098-2418(199701/03)10:1/2<69::AID-RSA4>3.0.CO;2-V},
  doi       = {10.1002/(SICI)1098-2418(199701/03)10:1/2<69::AID-RSA4>3.0.CO;2-V},
  timestamp = {Fri, 26 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/rsa/CoffmanJSW97},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/sigact/AhoJKKMPP97,
  author    = {Alfred V. Aho and
               David S. Johnson and
               Richard M. Karp and
               S. Rao Kosaraju and
               Catherine C. McGeoch and
               Christos H. Papadimitriou and
               Pavel A. Pevzner},
  title     = {Emerging opportunities for theoretical computer science},
  journal   = {{SIGACT} News},
  volume    = {28},
  number    = {3},
  pages     = {65--74},
  year      = {1997},
  url       = {http://doi.acm.org/10.1145/262301.262309},
  doi       = {10.1145/262301.262309},
  timestamp = {Mon, 25 Jan 2010 00:00:00 +0100},
  biburl    = {http://dblp.org/rec/bib/journals/sigact/AhoJKKMPP97},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/sigact/CondonFFGJLMRSSS97,
  author    = {Anne Condon and
               Faith Fich and
               Greg N. Frederickson and
               Andrew V. Goldberg and
               David S. Johnson and
               Michael C. Loui and
               Steven Mahaney and
               Prabhakar Raghavan and
               John E. Savage and
               Alan L. Selman and
               David B. Shmoys},
  title     = {Strategic directions in research in theory of computing},
  journal   = {{SIGACT} News},
  volume    = {28},
  number    = {3},
  pages     = {75--93},
  year      = {1997},
  url       = {http://doi.acm.org/10.1145/262301.262310},
  doi       = {10.1145/262301.262310},
  timestamp = {Mon, 25 Jan 2010 00:00:00 +0100},
  biburl    = {http://dblp.org/rec/bib/journals/sigact/CondonFFGJLMRSSS97},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/pldi/YoungJKS97,
  author    = {Cliff Young and
               David S. Johnson and
               David R. Karger and
               Michael D. Smith},
  title     = {Near-optimal Intraprocedural Branch Alignment},
  booktitle = {Proceedings of the {ACM} {SIGPLAN} '97 Conference on Programming Language
               Design and Implementation (PLDI), Las Vegas, Nevada, June 15-18, 1997},
  pages     = {183--193},
  year      = {1997},
  crossref  = {DBLP:conf/pldi/1997},
  url       = {http://doi.acm.org/10.1145/258915.258932},
  doi       = {10.1145/258915.258932},
  timestamp = {Mon, 05 Dec 2016 00:00:00 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/pldi/YoungJKS97},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/sigact/Johnson96,
  author    = {David S. Johnson},
  title     = {How to do experiments (extended advertisement)},
  journal   = {{SIGACT} News},
  volume    = {27},
  number    = {2},
  pages     = {87},
  year      = {1996},
  url       = {http://doi.acm.org/10.1145/235767.235771},
  doi       = {10.1145/235767.235771},
  timestamp = {Mon, 25 Jan 2010 00:00:00 +0100},
  biburl    = {http://dblp.org/rec/bib/journals/sigact/Johnson96},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/sigact/Johnson96a,
  author    = {David S. Johnson},
  title     = {A Brief History of {SIGACT} News and its Editors},
  journal   = {{SIGACT} News},
  volume    = {27},
  number    = {3},
  pages     = {125},
  year      = {1996},
  url       = {http://doi.acm.org/10.1145/235666.571628},
  doi       = {10.1145/235666.571628},
  timestamp = {Mon, 25 Jan 2010 00:00:00 +0100},
  biburl    = {http://dblp.org/rec/bib/journals/sigact/Johnson96a},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/soda/JohnsonMR96,
  author    = {David S. Johnson and
               Lyle A. McGeoch and
               Edward E. Rothberg},
  title     = {Asymptotic Experimental Analysis for the Held-Karp Traveling Salesman
               Bound},
  booktitle = {Proceedings of the Seventh Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, 28-30 January 1996, Atlanta, Georgia.},
  pages     = {341--350},
  year      = {1996},
  crossref  = {DBLP:conf/soda/1996},
  url       = {http://dl.acm.org/citation.cfm?id=313852.314081},
  timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/soda/JohnsonMR96},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/dimacs/dimacs26,
  editor    = {David S. Johnson and
               Michael A. Trick},
  title     = {Cliques, Coloring, and Satisfiability, Proceedings of a {DIMACS} Workshop,
               New Brunswick, New Jersey, USA, October 11-13, 1993},
  series    = {{DIMACS} Series in Discrete Mathematics and Theoretical Computer Science},
  volume    = {26},
  publisher = {{DIMACS/AMS}},
  year      = {1996},
  url       = {http://dimacs.rutgers.edu/Volumes/Vol26.html},
  timestamp = {Fri, 12 Feb 2016 00:00:00 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/dimacs/dimacs26},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/jal/FredmanJMO95,
  author    = {Michael L. Fredman and
               David S. Johnson and
               Lyle A. McGeoch and
               G. Ostheimer},
  title     = {Data Structures for Traveling Salesmen},
  journal   = {J. Algorithms},
  volume    = {18},
  number    = {3},
  pages     = {432--479},
  year      = {1995},
  url       = {https://doi.org/10.1006/jagm.1995.1018},
  doi       = {10.1006/jagm.1995.1018},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/jal/FredmanJMO95},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/siamcomp/DahlhausJPSY94,
  author    = {Elias Dahlhaus and
               David S. Johnson and
               Christos H. Papadimitriou and
               Paul D. Seymour and
               Mihalis Yannakakis},
  title     = {The Complexity of Multiterminal Cuts},
  journal   = {{SIAM} J. Comput.},
  volume    = {23},
  number    = {4},
  pages     = {864--894},
  year      = {1994},
  url       = {https://doi.org/10.1137/S0097539792225297},
  doi       = {10.1137/S0097539792225297},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/siamcomp/DahlhausJPSY94},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/ifip/Johnson94,
  author    = {David S. Johnson},
  title     = {The Traveling Salesman Problem: {A} report on the State of the Art},
  booktitle = {Technology and Foundations - Information Processing '94, Volume 1,
               Proceedings of the {IFIP} 13th World Computer Congress, Hamburg, Germany,
               28 August - 2 September, 1994},
  pages     = {221--222},
  year      = {1994},
  crossref  = {DBLP:conf/ifip/1994-1},
  timestamp = {Tue, 15 Mar 2016 13:03:03 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/ifip/Johnson94},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/soda/JohnsonLP94,
  author    = {David S. Johnson and
               Andrea S. LaPaugh and
               Ron Y. Pinter},
  title     = {Minimizing Channel Density by Lateral Shifting of Components},
  booktitle = {Proceedings of the Fifth Annual {ACM-SIAM} Symposium on Discrete Algorithms.
               23-25 January 1994, Arlington, Virginia.},
  pages     = {122--131},
  year      = {1994},
  crossref  = {DBLP:conf/soda/1994},
  url       = {http://dl.acm.org/citation.cfm?id=314464.314486},
  timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/soda/JohnsonLP94},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/jpdc/JohnsonB93,
  author    = {David S. Johnson and
               Francine Berman},
  title     = {Performance of the Efficient Data-Driven Evaluation Scheme},
  journal   = {J. Parallel Distrib. Comput.},
  volume    = {18},
  number    = {3},
  pages     = {340--346},
  year      = {1993},
  url       = {https://doi.org/10.1006/jpdc.1993.1069},
  doi       = {10.1006/jpdc.1993.1069},
  timestamp = {Fri, 26 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/jpdc/JohnsonB93},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/dimacs/JohnsonT93,
  author    = {David S. Johnson and
               Michael A. Trick},
  title     = {Foreword xiIntroduction to the Second {DIMACS} Challenge: Cliques,
               coloring, and satisfiability},
  booktitle = {Cliques, Coloring, and Satisfiability, Proceedings of a {DIMACS} Workshop,
               New Brunswick, New Jersey, USA, October 11-13, 1993},
  pages     = {1--10},
  year      = {1993},
  crossref  = {DBLP:conf/dimacs/dimacs26},
  timestamp = {Fri, 12 Feb 2016 07:36:52 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/dimacs/JohnsonT93},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/soda/FredmanJMO93,
  author    = {Michael L. Fredman and
               David S. Johnson and
               Lyle A. McGeoch and
               G. Ostheimer},
  title     = {Data Structures for Traveling Salesmen},
  booktitle = {Proceedings of the Fourth Annual {ACM/SIGACT-SIAM} Symposium on Discrete
               Algorithms, 25-27 January 1993, Austin, Texas.},
  pages     = {145--154},
  year      = {1993},
  crossref  = {DBLP:conf/soda/1993},
  url       = {http://dl.acm.org/citation.cfm?id=313559.313668},
  timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/soda/FredmanJMO93},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/stoc/CoffmanJSW93,
  author    = {Edward G. Coffman Jr. and
               David S. Johnson and
               Peter W. Shor and
               Richard R. Weber},
  title     = {Markov chains, computer proofs, and average-case analysis of best
               fit bin packing},
  booktitle = {Proceedings of the Twenty-Fifth Annual {ACM} Symposium on Theory of
               Computing, May 16-18, 1993, San Diego, CA, {USA}},
  pages     = {412--421},
  year      = {1993},
  crossref  = {DBLP:conf/stoc/STOC25},
  url       = {http://doi.acm.org/10.1145/167088.167203},
  doi       = {10.1145/167088.167203},
  timestamp = {Thu, 16 Feb 2012 00:00:00 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/stoc/CoffmanJSW93},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/dimacs/dimacs12,
  editor    = {David S. Johnson and
               Catherine C. McGeoch},
  title     = {Network Flows And Matching, Proceedings of a {DIMACS} Workshop, New
               Brunswick, New Jersey, USA, October 14-16, 1991},
  series    = {{DIMACS} Series in Discrete Mathematics and Theoretical Computer Science},
  volume    = {12},
  publisher = {{DIMACS/AMS}},
  year      = {1993},
  url       = {http://dimacs.rutgers.edu/Volumes/Vol12.html},
  timestamp = {Fri, 15 Jan 2016 00:00:00 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/dimacs/dimacs12},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/stoc/STOC25,
  editor    = {S. Rao Kosaraju and
               David S. Johnson and
               Alok Aggarwal},
  title     = {Proceedings of the Twenty-Fifth Annual {ACM} Symposium on Theory of
               Computing, May 16-18, 1993, San Diego, CA, {USA}},
  publisher = {{ACM}},
  year      = {1993},
  isbn      = {0-89791-591-7},
  timestamp = {Mon, 17 Oct 2011 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/stoc/STOC25},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/jal/Johnson92,
  author    = {David S. Johnson},
  title     = {The NP-Completeness Column: An Ongoing Guide},
  journal   = {J. Algorithms},
  volume    = {13},
  number    = {3},
  pages     = {502--524},
  year      = {1992},
  url       = {https://doi.org/10.1016/0196-6774(92)90052-E},
  doi       = {10.1016/0196-6774(92)90052-E},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/jal/Johnson92},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/stoc/DahlhausJPSY92,
  author    = {Elias Dahlhaus and
               David S. Johnson and
               Christos H. Papadimitriou and
               Paul D. Seymour and
               Mihalis Yannakakis},
  title     = {The Complexity of Multiway Cuts (Extended Abstract)},
  booktitle = {Proceedings of the 24th Annual {ACM} Symposium on Theory of Computing,
               May 4-6, 1992, Victoria, British Columbia, Canada},
  pages     = {241--251},
  year      = {1992},
  crossref  = {DBLP:conf/stoc/STOC24},
  url       = {http://doi.acm.org/10.1145/129712.129736},
  doi       = {10.1145/129712.129736},
  timestamp = {Mon, 17 Oct 2011 15:55:10 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/stoc/DahlhausJPSY92},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/ior/JohnsonAMS91,
  author    = {David S. Johnson and
               Cecilia R. Aragon and
               Lyle A. McGeoch and
               Catherine Schevon},
  title     = {Optimization by Simulated Annealing: An Experimental Evaluation; Part
               II, Graph Coloring and Number Partitioning},
  journal   = {Operations Research},
  volume    = {39},
  number    = {3},
  pages     = {378--406},
  year      = {1991},
  url       = {https://doi.org/10.1287/opre.39.3.378},
  doi       = {10.1287/opre.39.3.378},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/ior/JohnsonAMS91},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/dimacs/Johnson91,
  author    = {David S. Johnson},
  title     = {Appendix {B:} Panel Discussion Highlights},
  booktitle = {Network Flows And Matching, Proceedings of a {DIMACS} Workshop, New
               Brunswick, New Jersey, USA, October 14-16, 1991},
  pages     = {583},
  year      = {1991},
  crossref  = {DBLP:conf/dimacs/dimacs12},
  timestamp = {Fri, 15 Jan 2016 22:46:17 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/dimacs/Johnson91},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/dimacs/JohnsonM91,
  author    = {David S. Johnson and
               Catherine C. McGeoch},
  title     = {Preface},
  booktitle = {Network Flows And Matching, Proceedings of a {DIMACS} Workshop, New
               Brunswick, New Jersey, USA, October 14-16, 1991},
  pages     = {xi},
  year      = {1991},
  crossref  = {DBLP:conf/dimacs/dimacs12},
  timestamp = {Fri, 15 Jan 2016 22:46:17 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/dimacs/JohnsonM91},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/soda/CsirikJ91,
  author    = {J{\'{a}}nos Csirik and
               David S. Johnson},
  title     = {Bounded Space On-Line Bin Packing: Best is Better than First},
  booktitle = {Proceedings of the Second Annual {ACM/SIGACT-SIAM} Symposium on Discrete
               Algorithms, 28-30 January 1991, San Francisco, California.},
  pages     = {309--319},
  year      = {1991},
  crossref  = {DBLP:conf/soda/1991},
  url       = {http://dl.acm.org/citation.cfm?id=127787.127846},
  timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/soda/CsirikJ91},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/stoc/CoffmanCGJMSWY91,
  author    = {Edward G. Coffman Jr. and
               Costas Courcoubetis and
               M. R. Garey and
               David S. Johnson and
               Lyle A. McGeoch and
               Peter W. Shor and
               Richard R. Weber and
               Mihalis Yannakakis},
  title     = {Fundamental Discrepancies between Average-Case Analyses under Discrete
               and Continuous Distributions: {A} Bin Packing Case Study},
  booktitle = {Proceedings of the 23rd Annual {ACM} Symposium on Theory of Computing,
               May 5-8, 1991, New Orleans, Louisiana, {USA}},
  pages     = {230--240},
  year      = {1991},
  crossref  = {DBLP:conf/stoc/STOC23},
  url       = {http://doi.acm.org/10.1145/103418.103446},
  doi       = {10.1145/103418.103446},
  timestamp = {Mon, 17 Oct 2011 15:55:10 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/stoc/CoffmanCGJMSWY91},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/dm/ClarkCJ90,
  author    = {Brent N. Clark and
               Charles J. Colbourn and
               David S. Johnson},
  title     = {Unit disk graphs},
  journal   = {Discrete Mathematics},
  volume    = {86},
  number    = {1-3},
  pages     = {165--177},
  year      = {1990},
  url       = {https://doi.org/10.1016/0012-365X(90)90358-O},
  doi       = {10.1016/0012-365X(90)90358-O},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/dm/ClarkCJ90},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/jal/Johnson90,
  author    = {David S. Johnson},
  title     = {The NP-Completeness Column: An Ongoing Guide},
  journal   = {J. Algorithms},
  volume    = {11},
  number    = {1},
  pages     = {144--151},
  year      = {1990},
  url       = {https://doi.org/10.1016/0196-6774(90)90035-D},
  doi       = {10.1016/0196-6774(90)90035-D},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/jal/Johnson90},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/jal/BermanJLSS90,
  author    = {Francine Berman and
               David S. Johnson and
               Frank Thomson Leighton and
               Peter W. Shor and
               Larry Snyder},
  title     = {Generalized Planar Matching},
  journal   = {J. Algorithms},
  volume    = {11},
  number    = {2},
  pages     = {153--184},
  year      = {1990},
  url       = {https://doi.org/10.1016/0196-6774(90)90001-U},
  doi       = {10.1016/0196-6774(90)90001-U},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/jal/BermanJLSS90},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/sigact/Johnson90,
  author    = {David S. Johnson},
  title     = {A stoc/focs bibliography: the last progress report},
  journal   = {{SIGACT} News},
  volume    = {21},
  number    = {2},
  pages     = {4},
  year      = {1990},
  url       = {http://doi.acm.org/10.1145/379172.379173},
  doi       = {10.1145/379172.379173},
  timestamp = {Mon, 25 Jan 2010 00:00:00 +0100},
  biburl    = {http://dblp.org/rec/bib/journals/sigact/Johnson90},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/icalp/Johnson90,
  author    = {David S. Johnson},
  title     = {Local Optimization and the Traveling Salesman Problem},
  booktitle = {Automata, Languages and Programming, 17th International Colloquium,
               ICALP90, Warwick University, England, July 16-20, 1990, Proceedings},
  pages     = {446--461},
  year      = {1990},
  crossref  = {DBLP:conf/icalp/1990},
  url       = {https://doi.org/10.1007/BFb0032050},
  doi       = {10.1007/BFb0032050},
  timestamp = {Fri, 19 May 2017 13:10:46 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/icalp/Johnson90},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/swat/Johnson90,
  author    = {David S. Johnson},
  title     = {Data Structures for Traveling Salesmen (Abstract)},
  booktitle = {{SWAT} 90, 2nd Scandinavian Workshop on Algorithm Theory, Bergen,
               Norway, July 11-14, 1990, Proceedings},
  pages     = {287},
  year      = {1990},
  crossref  = {DBLP:conf/swat/1990},
  url       = {https://doi.org/10.1007/3-540-52846-6_97},
  doi       = {10.1007/3-540-52846-6_97},
  timestamp = {Fri, 19 May 2017 13:10:48 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/swat/Johnson90},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@incollection{DBLP:books/el/leeuwen90/Johnson90,
  author    = {David S. Johnson},
  title     = {A Catalog of Complexity Classes},
  booktitle = {Handbook of Theoretical Computer Science, Volume {A:} Algorithms and
               Complexity {(A)}},
  pages     = {67--161},
  year      = {1990},
  timestamp = {Thu, 03 Jan 2002 00:00:00 +0100},
  biburl    = {http://dblp.org/rec/bib/books/el/leeuwen90/Johnson90},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/soda/1990,
  editor    = {David S. Johnson},
  title     = {Proceedings of the First Annual {ACM-SIAM} Symposium on Discrete Algorithms,
               22-24 January 1990, San Francisco, California},
  publisher = {{SIAM}},
  year      = {1990},
  url       = {http://dl.acm.org/citation.cfm?id=320176},
  isbn      = {0-89871-251-3},
  timestamp = {Fri, 07 Dec 2012 00:00:00 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/soda/1990},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/ior/JohnsonAMS89,
  author    = {David S. Johnson and
               Cecilia R. Aragon and
               Lyle A. McGeoch and
               Catherine Schevon},
  title     = {Optimization by Simulated Annealing: An Experimental Evaluation; Part
               I, Graph Partitioning},
  journal   = {Operations Research},
  volume    = {37},
  number    = {6},
  pages     = {865--892},
  year      = {1989},
  url       = {https://doi.org/10.1287/opre.37.6.865},
  doi       = {10.1287/opre.37.6.865},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/ior/JohnsonAMS89},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/stoc/STOC21,
  editor    = {David S. Johnson},
  title     = {Proceedings of the 21st Annual {ACM} Symposium on Theory of Computing,
               May 14-17, 1989, Seattle, Washigton, {USA}},
  publisher = {{ACM}},
  year      = {1989},
  isbn      = {0-89791-307-8},
  timestamp = {Mon, 17 Oct 2011 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/stoc/STOC21},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/ipl/JohnsonP88,
  author    = {David S. Johnson and
               Christos H. Papadimitriou and
               Mihalis Yannakakis},
  title     = {On Generating All Maximal Independent Sets},
  journal   = {Inf. Process. Lett.},
  volume    = {27},
  number    = {3},
  pages     = {119--123},
  year      = {1988},
  url       = {https://doi.org/10.1016/0020-0190(88)90065-8},
  doi       = {10.1016/0020-0190(88)90065-8},
  timestamp = {Fri, 26 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/ipl/JohnsonP88},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/jacm/MegiddoHGJP88,
  author    = {Nimrod Megiddo and
               S. Louis Hakimi and
               M. R. Garey and
               David S. Johnson and
               Christos H. Papadimitriou},
  title     = {The complexity of searching a graph},
  journal   = {J. {ACM}},
  volume    = {35},
  number    = {1},
  pages     = {18--44},
  year      = {1988},
  url       = {http://doi.acm.org/10.1145/42267.42268},
  doi       = {10.1145/42267.42268},
  timestamp = {Thu, 20 Nov 2003 00:00:00 +0100},
  biburl    = {http://dblp.org/rec/bib/journals/jacm/MegiddoHGJP88},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/jal/Johnson88,
  author    = {David S. Johnson},
  title     = {The NP-Completeness Column: An Ongoing Guide},
  journal   = {J. Algorithms},
  volume    = {9},
  number    = {3},
  pages     = {426--444},
  year      = {1988},
  url       = {https://doi.org/10.1016/0196-6774(88)90033-8},
  doi       = {10.1016/0196-6774(88)90033-8},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/jal/Johnson88},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/jcss/JohnsonPY88,
  author    = {David S. Johnson and
               Christos H. Papadimitriou and
               Mihalis Yannakakis},
  title     = {How Easy is Local Search?},
  journal   = {J. Comput. Syst. Sci.},
  volume    = {37},
  number    = {1},
  pages     = {79--100},
  year      = {1988},
  url       = {https://doi.org/10.1016/0022-0000(88)90046-3},
  doi       = {10.1016/0022-0000(88)90046-3},
  timestamp = {Sat, 20 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/jcss/JohnsonPY88},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/jal/Johnson87,
  author    = {David S. Johnson},
  title     = {The NP-Completeness Column: An Ongoing Guide},
  journal   = {J. Algorithms},
  volume    = {8},
  number    = {2},
  pages     = {285--303},
  year      = {1987},
  url       = {https://doi.org/10.1016/0196-6774(87)90043-5},
  doi       = {10.1016/0196-6774(87)90043-5},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/jal/Johnson87},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/jal/Johnson87a,
  author    = {David S. Johnson},
  title     = {The NP-Completeness Column: An Ongoing Guide},
  journal   = {J. Algorithms},
  volume    = {8},
  number    = {3},
  pages     = {438--448},
  year      = {1987},
  url       = {https://doi.org/10.1016/0196-6774(87)90021-6},
  doi       = {10.1016/0196-6774(87)90021-6},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/jal/Johnson87a},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/jc/CoffmanGJ87,
  author    = {Edward G. Coffman Jr. and
               M. R. Garey and
               David S. Johnson},
  title     = {Bin packing with divisible item sizes},
  journal   = {J. Complexity},
  volume    = {3},
  number    = {4},
  pages     = {406--428},
  year      = {1987},
  url       = {https://doi.org/10.1016/0885-064X(87)90009-4},
  doi       = {10.1016/0885-064X(87)90009-4},
  timestamp = {Fri, 26 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/jc/CoffmanGJ87},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/jgt/JohnsonP87,
  author    = {David S. Johnson and
               Henry O. Pollak},
  title     = {Hypergraph planarity and the complexity of drawing venn diagrams},
  journal   = {Journal of Graph Theory},
  volume    = {11},
  number    = {3},
  pages     = {309--325},
  year      = {1987},
  url       = {https://doi.org/10.1002/jgt.3190110306},
  doi       = {10.1002/jgt.3190110306},
  timestamp = {Thu, 18 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/jgt/JohnsonP87},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/jal/Johnson86,
  author    = {David S. Johnson},
  title     = {The NP-Completeness Column: An Ongoing Guide},
  journal   = {J. Algorithms},
  volume    = {7},
  number    = {2},
  pages     = {289--305},
  year      = {1986},
  url       = {https://doi.org/10.1016/0196-6774(86)90011-8},
  doi       = {10.1016/0196-6774(86)90011-8},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/jal/Johnson86},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/jal/Johnson86a,
  author    = {David S. Johnson},
  title     = {The NP-Completeness Column: An Ongoing Guide},
  journal   = {J. Algorithms},
  volume    = {7},
  number    = {4},
  pages     = {584--601},
  year      = {1986},
  url       = {https://doi.org/10.1016/0196-6774(86)90020-9},
  doi       = {10.1016/0196-6774(86)90020-9},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/jal/Johnson86a},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/jal/Johnson85,
  author    = {David S. Johnson},
  title     = {The NP-Completeness Column: An Ongoing Guide},
  journal   = {J. Algorithms},
  volume    = {6},
  number    = {1},
  pages     = {145--159},
  year      = {1985},
  url       = {https://doi.org/10.1016/0196-6774(85)90025-2},
  doi       = {10.1016/0196-6774(85)90025-2},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/jal/Johnson85},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/jal/Johnson85a,
  author    = {David S. Johnson},
  title     = {The NP-Completeness Column: An Ongoing Guide},
  journal   = {J. Algorithms},
  volume    = {6},
  number    = {2},
  pages     = {291--305},
  year      = {1985},
  url       = {https://doi.org/10.1016/0196-6774(85)90046-X},
  doi       = {10.1016/0196-6774(85)90046-X},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/jal/Johnson85a},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/jal/Johnson85b,
  author    = {David S. Johnson},
  title     = {The NP-Completeness Column: An Ongoing Guide},
  journal   = {J. Algorithms},
  volume    = {6},
  number    = {3},
  pages     = {434--451},
  year      = {1985},
  url       = {https://doi.org/10.1016/0196-6774(85)90012-4},
  doi       = {10.1016/0196-6774(85)90012-4},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/jal/Johnson85b},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/jc/JohnsonG85,
  author    = {David S. Johnson and
               M. R. Garey},
  title     = {A 71/60 theorem for bin packing},
  journal   = {J. Complexity},
  volume    = {1},
  number    = {1},
  pages     = {65--106},
  year      = {1985},
  url       = {https://doi.org/10.1016/0885-064X(85)90022-6},
  doi       = {10.1016/0885-064X(85)90022-6},
  timestamp = {Fri, 26 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/jc/JohnsonG85},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/siamcomp/GareyJ85,
  author    = {M. R. Garey and
               David S. Johnson},
  title     = {Composing Functions to Minimize Image Size},
  journal   = {{SIAM} J. Comput.},
  volume    = {14},
  number    = {2},
  pages     = {500--503},
  year      = {1985},
  url       = {https://doi.org/10.1137/0214037},
  doi       = {10.1137/0214037},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/siamcomp/GareyJ85},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/siamcomp/CoffmanGJL85,
  author    = {Edward G. Coffman Jr. and
               M. R. Garey and
               David S. Johnson and
               Andrea S. LaPaugh},
  title     = {Scheduling File Transfers},
  journal   = {{SIAM} J. Comput.},
  volume    = {14},
  number    = {3},
  pages     = {744--780},
  year      = {1985},
  url       = {https://doi.org/10.1137/0214054},
  doi       = {10.1137/0214054},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/siamcomp/CoffmanGJL85},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/focs/JohnsonPY85,
  author    = {David S. Johnson and
               Christos H. Papadimitriou and
               Mihalis Yannakakis},
  title     = {How Easy Is Local Search? (Extended Abstract)},
  booktitle = {26th Annual Symposium on Foundations of Computer Science, Portland,
               Oregon, USA, 21-23 October 1985},
  pages     = {39--42},
  year      = {1985},
  crossref  = {DBLP:conf/focs/FOCS26},
  url       = {https://doi.org/10.1109/SFCS.1985.31},
  doi       = {10.1109/SFCS.1985.31},
  timestamp = {Fri, 19 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/focs/JohnsonPY85},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/jal/Johnson84,
  author    = {David S. Johnson},
  title     = {The NP-Completeness Column: An Ongoing Guide},
  journal   = {J. Algorithms},
  volume    = {5},
  number    = {1},
  pages     = {147--160},
  year      = {1984},
  url       = {https://doi.org/10.1016/0196-6774(84)90045-2},
  doi       = {10.1016/0196-6774(84)90045-2},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/jal/Johnson84},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/jal/Johnson84a,
  author    = {David S. Johnson},
  title     = {The NP-Completeness Column: An Ongoing Guide},
  journal   = {J. Algorithms},
  volume    = {5},
  number    = {2},
  pages     = {284--299},
  year      = {1984},
  url       = {https://doi.org/10.1016/0196-6774(84)90032-4},
  doi       = {10.1016/0196-6774(84)90032-4},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/jal/Johnson84a},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/jal/Johnson84b,
  author    = {David S. Johnson},
  title     = {The NP-Completeness Column: An Ongoing Guide},
  journal   = {J. Algorithms},
  volume    = {5},
  number    = {3},
  pages     = {433--447},
  year      = {1984},
  url       = {https://doi.org/10.1016/0196-6774(84)90022-1},
  doi       = {10.1016/0196-6774(84)90022-1},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/jal/Johnson84b},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/jal/AssmannJKL84,
  author    = {Susan F. Assmann and
               David S. Johnson and
               Daniel J. Kleitman and
               Joseph Y.{-}T. Leung},
  title     = {On a Dual Version of the One-Dimensional Bin Packing Problem},
  journal   = {J. Algorithms},
  volume    = {5},
  number    = {4},
  pages     = {502--525},
  year      = {1984},
  url       = {https://doi.org/10.1016/0196-6774(84)90004-X},
  doi       = {10.1016/0196-6774(84)90004-X},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/jal/AssmannJKL84},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/jal/Johnson84c,
  author    = {David S. Johnson},
  title     = {The NP-Completeness Column: An Ongoing Guide},
  journal   = {J. Algorithms},
  volume    = {5},
  number    = {4},
  pages     = {595--609},
  year      = {1984},
  url       = {https://doi.org/10.1016/0196-6774(84)90010-5},
  doi       = {10.1016/0196-6774(84)90010-5},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/jal/Johnson84c},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/jcss/JohnsonK84,
  author    = {David S. Johnson and
               Anthony C. Klug},
  title     = {Testing Containment of Conjunctive Queries under Functional and Inclusion
               Dependencies},
  journal   = {J. Comput. Syst. Sci.},
  volume    = {28},
  number    = {1},
  pages     = {167--189},
  year      = {1984},
  url       = {https://doi.org/10.1016/0022-0000(84)90081-3},
  doi       = {10.1016/0022-0000(84)90081-3},
  timestamp = {Sat, 20 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/jcss/JohnsonK84},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BentleyJLMM84,
  author    = {Jon Louis Bentley and
               David S. Johnson and
               Frank Thomson Leighton and
               Catherine C. McGeoch and
               Lyle A. McGeoch},
  title     = {Some Unexpected Expected Behavior Results for Bin Packing},
  booktitle = {Proceedings of the 16th Annual {ACM} Symposium on Theory of Computing,
               April 30 - May 2, 1984, Washington, DC, {USA}},
  pages     = {279--288},
  year      = {1984},
  crossref  = {DBLP:conf/stoc/STOC16},
  url       = {http://doi.acm.org/10.1145/800057.808692},
  doi       = {10.1145/800057.808692},
  timestamp = {Mon, 17 Oct 2011 15:55:10 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/stoc/BentleyJLMM84},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/jal/Johnson83,
  author    = {David S. Johnson},
  title     = {The NP-Completeness Column: An Ongoing Guide},
  journal   = {J. Algorithms},
  volume    = {4},
  number    = {1},
  pages     = {87--100},
  year      = {1983},
  url       = {https://doi.org/10.1016/0196-6774(83)90038-X},
  doi       = {10.1016/0196-6774(83)90038-X},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/jal/Johnson83},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/jal/Johnson83a,
  author    = {David S. Johnson},
  title     = {The NP-Completeness Column: An Ongoing Guide},
  journal   = {J. Algorithms},
  volume    = {4},
  number    = {2},
  pages     = {189--203},
  year      = {1983},
  url       = {https://doi.org/10.1016/0196-6774(83)90045-7},
  doi       = {10.1016/0196-6774(83)90045-7},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/jal/Johnson83a},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/jal/Johnson83b,
  author    = {David S. Johnson},
  title     = {The NP-Completeness Column: An Ongoing Guide},
  journal   = {J. Algorithms},
  volume    = {4},
  number    = {3},
  pages     = {286--300},
  year      = {1983},
  url       = {https://doi.org/10.1016/0196-6774(83)90028-7},
  doi       = {10.1016/0196-6774(83)90028-7},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/jal/Johnson83b},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/jal/Johnson83c,
  author    = {David S. Johnson},
  title     = {The NP-Completeness Column: An Ongoing Guide},
  journal   = {J. Algorithms},
  volume    = {4},
  number    = {4},
  pages     = {397--411},
  year      = {1983},
  url       = {https://doi.org/10.1016/0196-6774(83)90019-6},
  doi       = {10.1016/0196-6774(83)90019-6},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/jal/Johnson83c},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/siamcomp/CoffmanGJ83,
  author    = {Edward G. Coffman Jr. and
               M. R. Garey and
               David S. Johnson},
  title     = {Dynamic Bin Packing},
  journal   = {{SIAM} J. Comput.},
  volume    = {12},
  number    = {2},
  pages     = {227--258},
  year      = {1983},
  url       = {https://doi.org/10.1137/0212014},
  doi       = {10.1137/0212014},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/siamcomp/CoffmanGJ83},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/siamcomp/JohnsonK83,
  author    = {David S. Johnson and
               Anthony C. Klug},
  title     = {Optimizing Conjunctive Queries that Contain Untyped Variables},
  journal   = {{SIAM} J. Comput.},
  volume    = {12},
  number    = {4},
  pages     = {616--640},
  year      = {1983},
  url       = {https://doi.org/10.1137/0212042},
  doi       = {10.1137/0212042},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/siamcomp/JohnsonK83},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/podc/CoffmanGJL83,
  author    = {Edward G. Coffman Jr. and
               M. R. Garey and
               David S. Johnson and
               Andrea S. LaPaugh},
  title     = {Scheduling File Transfers in a Distributed Network},
  booktitle = {Proceedings of the Second Annual {ACM} {SIGACT-SIGOPS} Symposium on
               Principles of Distributed Computing, Montreal, Quebec, Canada, August
               17-19, 1983},
  pages     = {254--266},
  year      = {1983},
  crossref  = {DBLP:conf/podc/1983},
  url       = {http://doi.acm.org/10.1145/800221.806726},
  doi       = {10.1145/800221.806726},
  timestamp = {Wed, 23 May 2012 14:26:11 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/podc/CoffmanGJL83},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/stoc/STOC15,
  editor    = {David S. Johnson and
               Ronald Fagin and
               Michael L. Fredman and
               David Harel and
               Richard M. Karp and
               Nancy A. Lynch and
               Christos H. Papadimitriou and
               Ronald L. Rivest and
               Walter L. Ruzzo and
               Joel I. Seiferas},
  title     = {Proceedings of the 15th Annual {ACM} Symposium on Theory of Computing,
               25-27 April, 1983, Boston, Massachusetts, {USA}},
  publisher = {{ACM}},
  year      = {1983},
  timestamp = {Mon, 17 Oct 2011 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/stoc/STOC15},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/jal/Johnson82c,
  author    = {David S. Johnson},
  title     = {The NP-Completeness Column: An Ongoing Guide},
  journal   = {J. Algorithms},
  volume    = {3},
  number    = {1},
  pages     = {89--99},
  year      = {1982},
  url       = {https://doi.org/10.1016/0196-6774(82)90011-6},
  doi       = {10.1016/0196-6774(82)90011-6},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/jal/Johnson82c},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/jal/Johnson82,
  author    = {David S. Johnson},
  title     = {The NP-Completeness Column: An Ongoing Guide},
  journal   = {J. Algorithms},
  volume    = {3},
  number    = {2},
  pages     = {182--195},
  year      = {1982},
  url       = {https://doi.org/10.1016/0196-6774(82)90018-9},
  doi       = {10.1016/0196-6774(82)90018-9},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/jal/Johnson82},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/jal/Johnson82a,
  author    = {David S. Johnson},
  title     = {The NP-Completeness Column: An Ongoing Guide},
  journal   = {J. Algorithms},
  volume    = {3},
  number    = {3},
  pages     = {288--300},
  year      = {1982},
  url       = {https://doi.org/10.1016/0196-6774(82)90026-8},
  doi       = {10.1016/0196-6774(82)90026-8},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/jal/Johnson82a},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/jal/Johnson82b,
  author    = {David S. Johnson},
  title     = {The NP-Completeness Column: An Ongoing Guide},
  journal   = {J. Algorithms},
  volume    = {3},
  number    = {4},
  pages     = {381--395},
  year      = {1982},
  url       = {https://doi.org/10.1016/0196-6774(82)90032-3},
  doi       = {10.1016/0196-6774(82)90032-3},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/jal/Johnson82b},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/tit/GareyJW82,
  author    = {M. R. Garey and
               David S. Johnson and
               Hans S. Witsenhausen},
  title     = {The complexity of the generalized Lloyd - Max problem},
  journal   = {{IEEE} Trans. Information Theory},
  volume    = {28},
  number    = {2},
  pages     = {255--256},
  year      = {1982},
  url       = {https://doi.org/10.1109/TIT.1982.1056488},
  doi       = {10.1109/TIT.1982.1056488},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/tit/GareyJW82},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/pods/JohnsonK82,
  author    = {David S. Johnson and
               Anthony C. Klug},
  title     = {Testing Containment of Conjunctive Queries Under Functional and Inclusion
               Dependencies},
  booktitle = {Proceedings of the {ACM} Symposium on Principles of Database Systems,
               March 29-31, 1982, Los Angeles, California, {USA}},
  pages     = {164--169},
  year      = {1982},
  crossref  = {DBLP:conf/pods/82},
  url       = {http://doi.acm.org/10.1145/588111.588138},
  doi       = {10.1145/588111.588138},
  timestamp = {Wed, 29 Mar 2017 16:45:25 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/pods/JohnsonK82},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/jal/Johnson81,
  author    = {David S. Johnson},
  title     = {The NP-Completeness Column: An Ongoing Guide},
  journal   = {J. Algorithms},
  volume    = {2},
  number    = {4},
  pages     = {393--405},
  year      = {1981},
  url       = {https://doi.org/10.1016/0196-6774(81)90037-7},
  doi       = {10.1016/0196-6774(81)90037-7},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/jal/Johnson81},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/siamcomp/GareyJST81,
  author    = {M. R. Garey and
               David S. Johnson and
               Barbara B. Simons and
               Robert Endre Tarjan},
  title     = {Scheduling Unit-Time Tasks with Arbitrary Release Times and Deadlines},
  journal   = {{SIAM} J. Comput.},
  volume    = {10},
  number    = {2},
  pages     = {256--269},
  year      = {1981},
  url       = {https://doi.org/10.1137/0210018},
  doi       = {10.1137/0210018},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/siamcomp/GareyJST81},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/focs/JohnsonK81,
  author    = {David S. Johnson and
               Anthony C. Klug},
  title     = {Optimizing Conjunctive Queries When Attribute Domains Are not Disjoint
               (Extended Abstract)},
  booktitle = {22nd Annual Symposium on Foundations of Computer Science, Nashville,
               Tennessee, USA, 28-30 October 1981},
  pages     = {203--211},
  year      = {1981},
  crossref  = {DBLP:conf/focs/FOCS22},
  url       = {https://doi.org/10.1109/SFCS.1981.33},
  doi       = {10.1109/SFCS.1981.33},
  timestamp = {Fri, 19 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/focs/JohnsonK81},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/focs/MegiddoHGJP81,
  author    = {Nimrod Megiddo and
               S. Louis Hakimi and
               M. R. Garey and
               David S. Johnson and
               Christos H. Papadimitriou},
  title     = {The Complexity of Searching a Graph (Preliminary Version)},
  booktitle = {22nd Annual Symposium on Foundations of Computer Science, Nashville,
               Tennessee, USA, 28-30 October 1981},
  pages     = {376--385},
  year      = {1981},
  crossref  = {DBLP:conf/focs/FOCS22},
  url       = {https://doi.org/10.1109/SFCS.1981.46},
  doi       = {10.1109/SFCS.1981.46},
  timestamp = {Fri, 19 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/focs/MegiddoHGJP81},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/siamcomp/CoffmanGJT80,
  author    = {Edward G. Coffman Jr. and
               M. R. Garey and
               David S. Johnson and
               Robert Endre Tarjan},
  title     = {Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms},
  journal   = {{SIAM} J. Comput.},
  volume    = {9},
  number    = {4},
  pages     = {808--826},
  year      = {1980},
  url       = {https://doi.org/10.1137/0209062},
  doi       = {10.1137/0209062},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/siamcomp/CoffmanGJT80},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/siammax/GareyJMP80,
  author    = {M. R. Garey and
               David S. Johnson and
               G. L. Miller and
               Christos H. Papadimitriou},
  title     = {The Complexity of Coloring Circular Arcs and Chords},
  journal   = {{SIAM} J. Matrix Analysis Applications},
  volume    = {1},
  number    = {2},
  pages     = {216--227},
  year      = {1980},
  url       = {https://doi.org/10.1137/0601025},
  doi       = {10.1137/0601025},
  timestamp = {Fri, 26 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/siammax/GareyJMP80},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@book{DBLP:books/fm/GareyJ79,
  author    = {M. R. Garey and
               David S. Johnson},
  title     = {Computers and Intractability: {A} Guide to the Theory of NP-Completeness},
  publisher = {W. H. Freeman},
  year      = {1979},
  isbn      = {0-7167-1044-7},
  timestamp = {Thu, 29 Mar 2007 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/books/fm/GareyJ79},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/ior/GareyGJ78,
  author    = {M. R. Garey and
               Ronald L. Graham and
               David S. Johnson},
  title     = {Performance Guarantees for Scheduling Algorithms},
  journal   = {Operations Research},
  volume    = {26},
  number    = {1},
  pages     = {3--21},
  year      = {1978},
  url       = {https://doi.org/10.1287/opre.26.1.3},
  doi       = {10.1287/opre.26.1.3},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/ior/GareyGJ78},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/ipl/GareyJPT78,
  author    = {M. R. Garey and
               David S. Johnson and
               Franco P. Preparata and
               Robert Endre Tarjan},
  title     = {Triangulating a Simple Polygon},
  journal   = {Inf. Process. Lett.},
  volume    = {7},
  number    = {4},
  pages     = {175--179},
  year      = {1978},
  url       = {https://doi.org/10.1016/0020-0190(78)90062-5},
  doi       = {10.1016/0020-0190(78)90062-5},
  timestamp = {Fri, 26 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/ipl/GareyJPT78},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/jacm/GareyJ78,
  author    = {M. R. Garey and
               David S. Johnson},
  title     = {"Strong" NP-Completeness Results: Motivation, Examples,
               and Implications},
  journal   = {J. {ACM}},
  volume    = {25},
  number    = {3},
  pages     = {499--508},
  year      = {1978},
  url       = {http://doi.acm.org/10.1145/322077.322090},
  doi       = {10.1145/322077.322090},
  timestamp = {Thu, 30 Mar 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/jacm/GareyJ78},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/networks/BoyceGJ78,
  author    = {William M. Boyce and
               M. R. Garey and
               David S. Johnson},
  title     = {A note on bisecting minimum spanning trees},
  journal   = {Networks},
  volume    = {8},
  number    = {3},
  pages     = {187--192},
  year      = {1978},
  url       = {https://doi.org/10.1002/net.3230080302},
  doi       = {10.1002/net.3230080302},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/networks/BoyceGJ78},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/networks/JohnsonLK78,
  author    = {David S. Johnson and
               Jan Karel Lenstra and
               A. H. G. Rinnooy Kan},
  title     = {The complexity of the network design problem},
  journal   = {Networks},
  volume    = {8},
  number    = {4},
  pages     = {279--285},
  year      = {1978},
  url       = {https://doi.org/10.1002/net.3230080402},
  doi       = {10.1002/net.3230080402},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/networks/JohnsonLK78},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/siamcomp/CoffmanGJ78,
  author    = {Edward G. Coffman Jr. and
               M. R. Garey and
               David S. Johnson},
  title     = {An Application of Bin-Packing to Multiprocessor Scheduling},
  journal   = {{SIAM} J. Comput.},
  volume    = {7},
  number    = {1},
  pages     = {1--17},
  year      = {1978},
  url       = {https://doi.org/10.1137/0207001},
  doi       = {10.1137/0207001},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/siamcomp/CoffmanGJ78},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/tcs/JohnsonP78,
  author    = {David S. Johnson and
               Franco P. Preparata},
  title     = {The Densest Hemisphere Problem},
  journal   = {Theor. Comput. Sci.},
  volume    = {6},
  pages     = {93--107},
  year      = {1978},
  url       = {https://doi.org/10.1016/0304-3975(78)90006-3},
  doi       = {10.1016/0304-3975(78)90006-3},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/tcs/JohnsonP78},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/focs/FraenkelGJSY78,
  author    = {Aviezri S. Fraenkel and
               M. R. Garey and
               David S. Johnson and
               T. Schaefer and
               Yaacov Yesha},
  title     = {The Complexity of Checkers on an {N} * {N} Board - Preliminary Report},
  booktitle = {19th Annual Symposium on Foundations of Computer Science, Ann Arbor,
               Michigan, USA, 16-18 October 1978},
  pages     = {55--64},
  year      = {1978},
  crossref  = {DBLP:conf/focs/FOCS19},
  url       = {https://doi.org/10.1109/SFCS.1978.36},
  doi       = {10.1109/SFCS.1978.36},
  timestamp = {Fri, 19 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/focs/FraenkelGJSY78},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/mor/BruckerGJ77,
  author    = {Peter Brucker and
               Michael R. Garey and
               David S. Johnson},
  title     = {Scheduling Equal-Length Tasks Under Treelike Precedence Constraints
               to Minimize Maximum Lateness},
  journal   = {Math. Oper. Res.},
  volume    = {2},
  number    = {3},
  pages     = {275--284},
  year      = {1977},
  url       = {https://doi.org/10.1287/moor.2.3.275},
  doi       = {10.1287/moor.2.3.275},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/mor/BruckerGJ77},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/siamam/GareyJ77,
  author    = {M. R. Garey and
               David S. Johnson},
  title     = {The Rectilinear Steiner Tree Problem in {NP} Complete},
  journal   = {{SIAM} Journal of Applied Mathematics},
  volume    = {32},
  pages     = {826--834},
  year      = {1977},
  timestamp = {Thu, 03 Jan 2002 00:00:00 +0100},
  biburl    = {http://dblp.org/rec/bib/journals/siamam/GareyJ77},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/siamcomp/GareyJ77,
  author    = {M. R. Garey and
               David S. Johnson},
  title     = {Two-Processor Scheduling with Start-Times and Deadlines},
  journal   = {{SIAM} J. Comput.},
  volume    = {6},
  number    = {3},
  pages     = {416--426},
  year      = {1977},
  url       = {https://doi.org/10.1137/0206029},
  doi       = {10.1137/0206029},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/siamcomp/GareyJ77},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/tc/GareyHJ77,
  author    = {M. R. Garey and
               Frank K. Hwang and
               David S. Johnson},
  title     = {Algorithms for a Set Partitioning Problem Arising in the Design of
               Multipurpose Units},
  journal   = {{IEEE} Trans. Computers},
  volume    = {26},
  number    = {4},
  pages     = {321--328},
  year      = {1977},
  url       = {https://doi.org/10.1109/TC.1977.1674841},
  doi       = {10.1109/TC.1977.1674841},
  timestamp = {Sat, 20 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/tc/GareyHJ77},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/jacm/GareyJ76a,
  author    = {M. R. Garey and
               David S. Johnson},
  title     = {The Complexity of Near-Optimal Graph Coloring},
  journal   = {J. {ACM}},
  volume    = {23},
  number    = {1},
  pages     = {43--49},
  year      = {1976},
  url       = {http://doi.acm.org/10.1145/321921.321926},
  doi       = {10.1145/321921.321926},
  timestamp = {Thu, 20 Nov 2003 00:00:00 +0100},
  biburl    = {http://dblp.org/rec/bib/journals/jacm/GareyJ76a},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/jacm/GareyJ76b,
  author    = {M. R. Garey and
               David S. Johnson},
  title     = {Scheduling Tasks with Nonuniform Deadlines on Two Processors},
  journal   = {J. {ACM}},
  volume    = {23},
  number    = {3},
  pages     = {461--467},
  year      = {1976},
  url       = {http://doi.acm.org/10.1145/321958.321967},
  doi       = {10.1145/321958.321967},
  timestamp = {Thu, 20 Nov 2003 00:00:00 +0100},
  biburl    = {http://dblp.org/rec/bib/journals/jacm/GareyJ76b},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/jct/GareyGJ76,
  author    = {M. R. Garey and
               Ronald L. Graham and
               David S. Johnson and
               Andrew Chi{-}Chih Yao},
  title     = {Resource Constrained Scheduling as Generalized Bin Packing},
  journal   = {J. Comb. Theory, Ser. {A}},
  volume    = {21},
  number    = {3},
  pages     = {257--298},
  year      = {1976},
  url       = {https://doi.org/10.1016/0097-3165(76)90001-7},
  doi       = {10.1016/0097-3165(76)90001-7},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/jct/GareyGJ76},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/mor/GareyJS76,
  author    = {Michael R. Garey and
               David S. Johnson and
               Ravi Sethi},
  title     = {The Complexity of Flowshop and Jobshop Scheduling},
  journal   = {Math. Oper. Res.},
  volume    = {1},
  number    = {2},
  pages     = {117--129},
  year      = {1976},
  url       = {https://doi.org/10.1287/moor.1.2.117},
  doi       = {10.1287/moor.1.2.117},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/mor/GareyJS76},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/siamcomp/GareyJT76,
  author    = {M. R. Garey and
               David S. Johnson and
               Robert Endre Tarjan},
  title     = {The Planar Hamiltonian Circuit Problem is NP-Complete},
  journal   = {{SIAM} J. Comput.},
  volume    = {5},
  number    = {4},
  pages     = {704--714},
  year      = {1976},
  url       = {https://doi.org/10.1137/0205049},
  doi       = {10.1137/0205049},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/siamcomp/GareyJT76},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/tcs/GareyJS76,
  author    = {M. R. Garey and
               David S. Johnson and
               Larry J. Stockmeyer},
  title     = {Some Simplified NP-Complete Graph Problems},
  journal   = {Theor. Comput. Sci.},
  volume    = {1},
  number    = {3},
  pages     = {237--267},
  year      = {1976},
  url       = {https://doi.org/10.1016/0304-3975(76)90059-1},
  doi       = {10.1016/0304-3975(76)90059-1},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/tcs/GareyJS76},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GareyGJ76,
  author    = {M. R. Garey and
               Ronald L. Graham and
               David S. Johnson},
  title     = {Some NP-Complete Geometric Problems},
  booktitle = {Proceedings of the 8th Annual {ACM} Symposium on Theory of Computing,
               May 3-5, 1976, Hershey, Pennsylvania, {USA}},
  pages     = {10--22},
  year      = {1976},
  crossref  = {DBLP:conf/stoc/STOC8},
  url       = {http://doi.acm.org/10.1145/800113.803626},
  doi       = {10.1145/800113.803626},
  timestamp = {Mon, 17 Oct 2011 15:55:10 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/stoc/GareyGJ76},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/siamcomp/GareyJ75,
  author    = {M. R. Garey and
               David S. Johnson},
  title     = {Complexity Results for Multiprocessor Scheduling under Resource Constraints},
  journal   = {{SIAM} J. Comput.},
  volume    = {4},
  number    = {4},
  pages     = {397--411},
  year      = {1975},
  url       = {https://doi.org/10.1137/0204035},
  doi       = {10.1137/0204035},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/siamcomp/GareyJ75},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/focs/GareyJS75,
  author    = {M. R. Garey and
               David S. Johnson and
               H. C. So},
  title     = {An Application of Graph Coloring to Printed Circuit Testing (Working
               Paper)},
  booktitle = {16th Annual Symposium on Foundations of Computer Science, Berkeley,
               California, USA, October 13-15, 1975},
  pages     = {178--183},
  year      = {1975},
  crossref  = {DBLP:conf/focs/FOCS16},
  url       = {https://doi.org/10.1109/SFCS.1975.3},
  doi       = {10.1109/SFCS.1975.3},
  timestamp = {Fri, 19 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/focs/GareyJS75},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/jcss/Johnson74,
  author    = {David S. Johnson},
  title     = {Fast Algorithms for Bin Packing},
  journal   = {J. Comput. Syst. Sci.},
  volume    = {8},
  number    = {3},
  pages     = {272--314},
  year      = {1974},
  url       = {https://doi.org/10.1016/S0022-0000(74)80026-7},
  doi       = {10.1016/S0022-0000(74)80026-7},
  timestamp = {Sat, 20 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/jcss/Johnson74},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/jcss/Johnson74a,
  author    = {David S. Johnson},
  title     = {Approximation Algorithms for Combinatorial Problems},
  journal   = {J. Comput. Syst. Sci.},
  volume    = {9},
  number    = {3},
  pages     = {256--278},
  year      = {1974},
  url       = {https://doi.org/10.1016/S0022-0000(74)80044-9},
  doi       = {10.1016/S0022-0000(74)80044-9},
  timestamp = {Sat, 20 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/jcss/Johnson74a},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/siamcomp/JohnsonDUGG74,
  author    = {David S. Johnson and
               Alan J. Demers and
               Jeffrey D. Ullman and
               M. R. Garey and
               Ronald L. Graham},
  title     = {Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms},
  journal   = {{SIAM} J. Comput.},
  volume    = {3},
  number    = {4},
  pages     = {299--325},
  year      = {1974},
  url       = {https://doi.org/10.1137/0203025},
  doi       = {10.1137/0203025},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/siamcomp/JohnsonDUGG74},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GareyJS74,
  author    = {M. R. Garey and
               David S. Johnson and
               Larry J. Stockmeyer},
  title     = {Some Simplified NP-Complete Problems},
  booktitle = {Proceedings of the 6th Annual {ACM} Symposium on Theory of Computing,
               April 30 - May 2, 1974, Seattle, Washington, {USA}},
  pages     = {47--63},
  year      = {1974},
  crossref  = {DBLP:conf/stoc/STOC6},
  url       = {http://doi.acm.org/10.1145/800119.803884},
  doi       = {10.1145/800119.803884},
  timestamp = {Mon, 17 Oct 2011 15:55:10 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/stoc/GareyJS74},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Johnson73,
  author    = {David S. Johnson},
  title     = {Approximation Algorithms for Combinatorial Problems},
  booktitle = {Proceedings of the 5th Annual {ACM} Symposium on Theory of Computing,
               April 30 - May 2, 1973, Austin, Texas, {USA}},
  pages     = {38--49},
  year      = {1973},
  crossref  = {DBLP:conf/stoc/STOC5},
  url       = {http://doi.acm.org/10.1145/800125.804034},
  doi       = {10.1145/800125.804034},
  timestamp = {Mon, 17 Oct 2011 15:55:10 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/stoc/Johnson73},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/focs/Johnson72,
  author    = {David S. Johnson},
  title     = {Fast Allocation Algorithms},
  booktitle = {13th Annual Symposium on Switching and Automata Theory, College Park,
               Maryland, USA, October 25-27, 1972},
  pages     = {144--154},
  year      = {1972},
  crossref  = {DBLP:conf/focs/FOCS13},
  url       = {https://doi.org/10.1109/SWAT.1972.4},
  doi       = {10.1109/SWAT.1972.4},
  timestamp = {Fri, 19 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/focs/Johnson72},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/tcc/2015-1,
  editor    = {Yevgeniy Dodis and
               Jesper Buus Nielsen},
  title     = {Theory of Cryptography - 12th Theory of Cryptography Conference, {TCC}
               2015, Warsaw, Poland, March 23-25, 2015, Proceedings, Part {I}},
  series    = {Lecture Notes in Computer Science},
  volume    = {9014},
  publisher = {Springer},
  year      = {2015},
  url       = {https://doi.org/10.1007/978-3-662-46494-6},
  doi       = {10.1007/978-3-662-46494-6},
  isbn      = {978-3-662-46493-9},
  timestamp = {Sat, 16 Sep 2017 12:07:36 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/tcc/2015-1},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/innovations/2013,
  editor    = {Robert D. Kleinberg},
  title     = {Innovations in Theoretical Computer Science, {ITCS} '13, Berkeley,
               CA, USA, January 9-12, 2013},
  publisher = {{ACM}},
  year      = {2013},
  url       = {http://dl.acm.org/citation.cfm?id=2422436},
  isbn      = {978-1-4503-1859-4},
  timestamp = {Sun, 17 Feb 2013 11:19:02 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/innovations/2013},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/alenex/2011,
  editor    = {Matthias M{\"{u}}ller{-}Hannemann and
               Renato Fonseca F. Werneck},
  title     = {Proceedings of the Thirteenth Workshop on Algorithm Engineering and
               Experiments, {ALENEX} 2011, Holiday Inn San Francisco Golden Gateway,
               San Francisco, California, USA, January 22, 2011},
  publisher = {{SIAM}},
  year      = {2011},
  url       = {https://doi.org/10.1137/1.9781611972917},
  doi       = {10.1137/1.9781611972917},
  isbn      = {978-1-61197-291-7},
  timestamp = {Thu, 01 Jun 2017 18:58:35 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/alenex/2011},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/dagstuhl/2010P10261,
  editor    = {Giuseppe F. Italiano and
               David S. Johnson and
               Petra Mutzel and
               Peter Sanders},
  title     = {Algorithm Engineering, 27.06. - 02.07.2010},
  series    = {Dagstuhl Seminar Proceedings},
  volume    = {10261},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik, Germany},
  year      = {2010},
  url       = {http://drops.dagstuhl.de/portals/10261/},
  timestamp = {Fri, 06 Jan 2017 14:45:30 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/dagstuhl/2010P10261},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@book{DBLP:reference/algo/2008,
  editor    = {Ming{-}Yang Kao},
  title     = {Encyclopedia of Algorithms},
  publisher = {Springer},
  year      = {2008},
  isbn      = {978-0-387-30162-4},
  timestamp = {Fri, 25 Nov 2011 18:23:31 +0100},
  biburl    = {http://dblp.org/rec/bib/reference/algo/2008},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/expcs/2007,
  title     = {Proceedings of the Workshop on Experimental Computer Science, Part
               of {ACM} FCRC, San Diego, 13-14 June 2007},
  publisher = {{ACM}},
  year      = {2007},
  isbn      = {978-1-59593-751-3},
  timestamp = {Wed, 02 Apr 2008 15:38:49 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/expcs/2007},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/soda/2007,
  editor    = {Nikhil Bansal and
               Kirk Pruhs and
               Clifford Stein},
  title     = {Proceedings of the Eighteenth Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, {SODA} 2007, New Orleans, Louisiana, USA, January 7-9,
               2007},
  publisher = {{SIAM}},
  year      = {2007},
  url       = {http://dl.acm.org/citation.cfm?id=1283383},
  isbn      = {978-0-898716-24-5},
  timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/soda/2007},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/vldb/2004,
  editor    = {Mario A. Nascimento and
               M. Tamer {\"{O}}zsu and
               Donald Kossmann and
               Ren{\'{e}}e J. Miller and
               Jos{\'{e}} A. Blakeley and
               K. Bernhard Schiefer},
  title     = {(e)Proceedings of the Thirtieth International Conference on Very Large
               Data Bases, Toronto, Canada, August 31 - September 3 2004},
  publisher = {Morgan Kaufmann},
  year      = {2004},
  isbn      = {0-12-088469-0},
  timestamp = {Mon, 17 Sep 2012 22:06:33 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/vldb/2004},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/alenex/2003,
  editor    = {Richard E. Ladner},
  title     = {Proceedings of the Fifth Workshop on Algorithm Engineering and Experiments,
               Baltimore, MD, USA, January 11, 2003},
  publisher = {{SIAM}},
  year      = {2003},
  isbn      = {0-89871-542-3},
  timestamp = {Fri, 10 Dec 2004 13:30:41 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/alenex/2003},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/alenex/2001,
  editor    = {Adam L. Buchsbaum and
               Jack Snoeyink},
  title     = {Algorithm Engineering and Experimentation, Third International Workshop,
               {ALENEX} 2001, Washington, DC, USA, January 5-6, 2001, Revised Papers},
  series    = {Lecture Notes in Computer Science},
  volume    = {2153},
  publisher = {Springer},
  year      = {2001},
  url       = {https://doi.org/10.1007/3-540-44808-X},
  doi       = {10.1007/3-540-44808-X},
  isbn      = {3-540-42560-8},
  timestamp = {Fri, 26 May 2017 14:09:14 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/alenex/2001},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/soda/2001,
  editor    = {S. Rao Kosaraju},
  title     = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms,
               January 7-9, 2001, Washington, DC, {USA}},
  publisher = {{ACM/SIAM}},
  year      = {2001},
  url       = {http://dl.acm.org/citation.cfm?id=365411},
  isbn      = {0-89871-490-7},
  timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/soda/2001},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/soda/2000,
  editor    = {David B. Shmoys},
  title     = {Proceedings of the Eleventh Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, January 9-11, 2000, San Francisco, CA, {USA}},
  publisher = {{ACM/SIAM}},
  year      = {2000},
  url       = {http://dl.acm.org/citation.cfm?id=338219},
  isbn      = {0-89871-453-2},
  timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/soda/2000},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/stoc/2000,
  editor    = {F. Frances Yao and
               Eugene M. Luks},
  title     = {Proceedings of the Thirty-Second Annual {ACM} Symposium on Theory
               of Computing, May 21-23, 2000, Portland, OR, {USA}},
  publisher = {{ACM}},
  year      = {2000},
  isbn      = {1-58113-184-4},
  timestamp = {Mon, 17 Oct 2011 15:55:10 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/stoc/2000},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/alenex/1999,
  editor    = {Michael T. Goodrich and
               Catherine C. McGeoch},
  title     = {Algorithm Engineering and Experimentation, International Workshop
               {ALENEX} '99, Baltimore, MD, USA, January 15-16, 1999, Selected Papers},
  series    = {Lecture Notes in Computer Science},
  volume    = {1619},
  publisher = {Springer},
  year      = {1999},
  url       = {https://doi.org/10.1007/3-540-48518-X},
  doi       = {10.1007/3-540-48518-X},
  isbn      = {3-540-66227-8},
  timestamp = {Thu, 15 Jun 2017 21:39:32 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/alenex/1999},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/dimacs/dimacs59,
  editor    = {Michael H. Goldwasser and
               David S. Johnson and
               Catherine C. McGeoch},
  title     = {Data Structures, Near Neighbor Searches, and Methodology: Fifth and
               Sixth {DIMACS} Implementation Challenges, Proceedings of a {DIMACS}
               Workshop, USA, 1999},
  series    = {{DIMACS} Series in Discrete Mathematics and Theoretical Computer Science},
  volume    = {59},
  publisher = {{DIMACS/AMS}},
  year      = {2002},
  url       = {http://dimacs.rutgers.edu/Volumes/Vol59.html},
  timestamp = {Tue, 15 Mar 2016 17:08:05 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/dimacs/dimacs59},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/soda/1999,
  editor    = {Robert Endre Tarjan and
               Tandy J. Warnow},
  title     = {Proceedings of the Tenth Annual {ACM-SIAM} Symposium on Discrete Algorithms,
               17-19 January 1999, Baltimore, Maryland},
  publisher = {{ACM/SIAM}},
  year      = {1999},
  url       = {http://dl.acm.org/citation.cfm?id=314500},
  isbn      = {0-89871-434-6},
  timestamp = {Mon, 14 Mar 2016 15:38:52 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/soda/1999},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/ipco/1998,
  editor    = {Robert E. Bixby and
               E. Andrew Boyd and
               Roger Z. R{\'{\i}}os{-}Mercado},
  title     = {Integer Programming and Combinatorial Optimization, 6th International
               {IPCO} Conference, Houston, Texas, USA, June 22-24, 1998, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {1412},
  publisher = {Springer},
  year      = {1998},
  url       = {https://doi.org/10.1007/3-540-69346-7},
  doi       = {10.1007/3-540-69346-7},
  isbn      = {3-540-64590-X},
  timestamp = {Sun, 04 Jun 2017 10:11:25 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/ipco/1998},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/pldi/1997,
  editor    = {Marina C. Chen and
               Ron K. Cytron and
               A. Michael Berman},
  title     = {Proceedings of the {ACM} {SIGPLAN} '97 Conference on Programming Language
               Design and Implementation (PLDI), Las Vegas, Nevada, June 15-18, 1997},
  publisher = {{ACM}},
  year      = {1997},
  url       = {http://dl.acm.org/citation.cfm?id=258915},
  isbn      = {0-89791-907-6},
  timestamp = {Mon, 21 May 2012 16:19:53 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/pldi/1997},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/soda/1996,
  editor    = {{\'{E}}va Tardos},
  title     = {Proceedings of the Seventh Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, 28-30 January 1996, Atlanta, Georgia},
  publisher = {{ACM/SIAM}},
  year      = {1996},
  url       = {http://dl.acm.org/citation.cfm?id=313852},
  isbn      = {0-89871-366-8},
  timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/soda/1996},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/ifip/1994-1,
  editor    = {Bj{\"{o}}rn Pehrson and
               Imre Simon},
  title     = {Technology and Foundations - Information Processing '94, Volume 1,
               Proceedings of the {IFIP} 13th World Computer Congress, Hamburg, Germany,
               28 August - 2 September, 1994},
  series    = {{IFIP} Transactions},
  volume    = {{A-51}},
  publisher = {North-Holland},
  year      = {1994},
  isbn      = {0-444-81989-4},
  timestamp = {Tue, 15 Mar 2016 13:03:03 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/ifip/1994-1},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/soda/1994,
  editor    = {Daniel Dominic Sleator},
  title     = {Proceedings of the Fifth Annual {ACM-SIAM} Symposium on Discrete Algorithms.
               23-25 January 1994, Arlington, Virginia},
  publisher = {{ACM/SIAM}},
  year      = {1994},
  url       = {http://dl.acm.org/citation.cfm?id=314464},
  isbn      = {0-89871-329-3},
  timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/soda/1994},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/dimacs/dimacs26,
  editor    = {David S. Johnson and
               Michael A. Trick},
  title     = {Cliques, Coloring, and Satisfiability, Proceedings of a {DIMACS} Workshop,
               New Brunswick, New Jersey, USA, October 11-13, 1993},
  series    = {{DIMACS} Series in Discrete Mathematics and Theoretical Computer Science},
  volume    = {26},
  publisher = {{DIMACS/AMS}},
  year      = {1996},
  url       = {http://dimacs.rutgers.edu/Volumes/Vol26.html},
  timestamp = {Fri, 12 Feb 2016 07:36:52 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/dimacs/dimacs26},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/soda/1993,
  editor    = {Vijaya Ramachandran},
  title     = {Proceedings of the Fourth Annual {ACM/SIGACT-SIAM} Symposium on Discrete
               Algorithms, 25-27 January 1993, Austin, Texas},
  publisher = {{ACM/SIAM}},
  year      = {1993},
  url       = {http://dl.acm.org/citation.cfm?id=313559},
  isbn      = {0-89791-562-3},
  timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/soda/1993},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/stoc/STOC25,
  editor    = {S. Rao Kosaraju and
               David S. Johnson and
               Alok Aggarwal},
  title     = {Proceedings of the Twenty-Fifth Annual {ACM} Symposium on Theory of
               Computing, May 16-18, 1993, San Diego, CA, {USA}},
  publisher = {{ACM}},
  year      = {1993},
  isbn      = {0-89791-591-7},
  timestamp = {Mon, 17 Oct 2011 15:55:10 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/stoc/STOC25},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/stoc/STOC24,
  editor    = {S. Rao Kosaraju and
               Mike Fellows and
               Avi Wigderson and
               John A. Ellis},
  title     = {Proceedings of the 24th Annual {ACM} Symposium on Theory of Computing,
               May 4-6, 1992, Victoria, British Columbia, Canada},
  publisher = {{ACM}},
  year      = {1992},
  isbn      = {0-89791-511-9},
  timestamp = {Mon, 17 Oct 2011 15:55:10 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/stoc/STOC24},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/dimacs/dimacs12,
  editor    = {David S. Johnson and
               Catherine C. McGeoch},
  title     = {Network Flows And Matching, Proceedings of a {DIMACS} Workshop, New
               Brunswick, New Jersey, USA, October 14-16, 1991},
  series    = {{DIMACS} Series in Discrete Mathematics and Theoretical Computer Science},
  volume    = {12},
  publisher = {{DIMACS/AMS}},
  year      = {1993},
  url       = {http://dimacs.rutgers.edu/Volumes/Vol12.html},
  timestamp = {Fri, 15 Jan 2016 22:46:17 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/dimacs/dimacs12},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/soda/1991,
  editor    = {Alok Aggarwal},
  title     = {Proceedings of the Second Annual {ACM/SIGACT-SIAM} Symposium on Discrete
               Algorithms, 28-30 January 1991, San Francisco, California},
  publisher = {{ACM/SIAM}},
  year      = {1991},
  url       = {http://dl.acm.org/citation.cfm?id=127787},
  isbn      = {0-89791-376-0},
  timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/soda/1991},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/stoc/STOC23,
  editor    = {Cris Koutsougeras and
               Jeffrey Scott Vitter},
  title     = {Proceedings of the 23rd Annual {ACM} Symposium on Theory of Computing,
               May 5-8, 1991, New Orleans, Louisiana, {USA}},
  publisher = {{ACM}},
  year      = {1991},
  isbn      = {0-89791-397-3},
  timestamp = {Mon, 17 Oct 2011 15:55:10 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/stoc/STOC23},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/icalp/1990,
  editor    = {Mike Paterson},
  title     = {Automata, Languages and Programming, 17th International Colloquium,
               ICALP90, Warwick University, England, July 16-20, 1990, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {443},
  publisher = {Springer},
  year      = {1990},
  url       = {https://doi.org/10.1007/BFb0032016},
  doi       = {10.1007/BFb0032016},
  isbn      = {3-540-52826-1},
  timestamp = {Fri, 19 May 2017 13:10:46 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/icalp/1990},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/swat/1990,
  editor    = {John R. Gilbert and
               Rolf G. Karlsson},
  title     = {{SWAT} 90, 2nd Scandinavian Workshop on Algorithm Theory, Bergen,
               Norway, July 11-14, 1990, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {447},
  publisher = {Springer},
  year      = {1990},
  url       = {https://doi.org/10.1007/3-540-52846-6},
  doi       = {10.1007/3-540-52846-6},
  isbn      = {3-540-52846-6},
  timestamp = {Fri, 19 May 2017 13:10:48 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/swat/1990},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/focs/FOCS26,
  title     = {26th Annual Symposium on Foundations of Computer Science, Portland,
               Oregon, USA, 21-23 October 1985},
  publisher = {{IEEE} Computer Society},
  year      = {1985},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=4568115},
  isbn      = {0-8186-0644-4},
  timestamp = {Wed, 17 Dec 2014 17:01:43 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/focs/FOCS26},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/stoc/STOC16,
  editor    = {Richard A. DeMillo},
  title     = {Proceedings of the 16th Annual {ACM} Symposium on Theory of Computing,
               April 30 - May 2, 1984, Washington, DC, {USA}},
  publisher = {{ACM}},
  year      = {1984},
  timestamp = {Mon, 17 Oct 2011 15:55:10 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/stoc/STOC16},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/podc/1983,
  editor    = {Robert L. Probert and
               Nancy A. Lynch and
               Nicola Santoro},
  title     = {Proceedings of the Second Annual {ACM} {SIGACT-SIGOPS} Symposium on
               Principles of Distributed Computing, Montreal, Quebec, Canada, August
               17-19, 1983},
  publisher = {{ACM}},
  year      = {1983},
  url       = {http://dl.acm.org/citation.cfm?id=800221},
  isbn      = {0-89791-110-5},
  timestamp = {Wed, 23 May 2012 14:26:11 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/podc/1983},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/pods/82,
  editor    = {Jeffrey D. Ullman and
               Alfred V. Aho},
  title     = {Proceedings of the {ACM} Symposium on Principles of Database Systems,
               March 29-31, 1982, Los Angeles, California, {USA}},
  publisher = {{ACM}},
  year      = {1982},
  url       = {http://dl.acm.org/citation.cfm?id=588111},
  isbn      = {0-89791-070-2},
  timestamp = {Wed, 29 Mar 2017 16:45:25 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/pods/82},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/focs/FOCS22,
  title     = {22nd Annual Symposium on Foundations of Computer Science, Nashville,
               Tennessee, USA, 28-30 October 1981},
  publisher = {{IEEE} Computer Society},
  year      = {1981},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=4568306},
  timestamp = {Mon, 15 Dec 2014 18:48:44 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/focs/FOCS22},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/focs/FOCS19,
  title     = {19th Annual Symposium on Foundations of Computer Science, Ann Arbor,
               Michigan, USA, 16-18 October 1978},
  publisher = {{IEEE} Computer Society},
  year      = {1978},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=4567951},
  timestamp = {Mon, 15 Dec 2014 18:48:44 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/focs/FOCS19},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/stoc/STOC8,
  editor    = {Ashok K. Chandra and
               Detlef Wotschke and
               Emily P. Friedman and
               Michael A. Harrison},
  title     = {Proceedings of the 8th Annual {ACM} Symposium on Theory of Computing,
               May 3-5, 1976, Hershey, Pennsylvania, {USA}},
  publisher = {{ACM}},
  year      = {1976},
  timestamp = {Mon, 17 Oct 2011 15:55:10 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/stoc/STOC8},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/focs/FOCS16,
  title     = {16th Annual Symposium on Foundations of Computer Science, Berkeley,
               California, USA, October 13-15, 1975},
  publisher = {{IEEE} Computer Society},
  year      = {1975},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=4567844},
  timestamp = {Mon, 15 Dec 2014 18:48:44 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/focs/FOCS16},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/stoc/STOC6,
  editor    = {Robert L. Constable and
               Robert W. Ritchie and
               Jack W. Carlyle and
               Michael A. Harrison},
  title     = {Proceedings of the 6th Annual {ACM} Symposium on Theory of Computing,
               April 30 - May 2, 1974, Seattle, Washington, {USA}},
  publisher = {{ACM}},
  year      = {1974},
  timestamp = {Mon, 17 Oct 2011 15:55:10 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/stoc/STOC6},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/stoc/STOC5,
  editor    = {Alfred V. Aho and
               Allan Borodin and
               Robert L. Constable and
               Robert W. Floyd and
               Michael A. Harrison and
               Richard M. Karp and
               H. Raymond Strong},
  title     = {Proceedings of the 5th Annual {ACM} Symposium on Theory of Computing,
               April 30 - May 2, 1973, Austin, Texas, {USA}},
  publisher = {{ACM}},
  year      = {1973},
  timestamp = {Mon, 17 Oct 2011 15:55:10 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/stoc/STOC5},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/focs/FOCS13,
  title     = {13th Annual Symposium on Switching and Automata Theory, College Park,
               Maryland, USA, October 25-27, 1972},
  publisher = {{IEEE} Computer Society},
  year      = {1972},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=4569685},
  timestamp = {Mon, 15 Dec 2014 18:48:45 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/focs/FOCS13},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
maintained by Schloss Dagstuhl LZI at University of Trier