BibTeX record conf/soda/Kanevsky90

download as .bib file

@inproceedings{DBLP:conf/soda/Kanevsky90,
  author       = {Arkady Kanevsky},
  editor       = {David S. Johnson},
  title        = {On the Number of Minimum Size Separating Vertex Sets in a Graph and
                  How to Find All of Them},
  booktitle    = {Proceedings of the First Annual {ACM-SIAM} Symposium on Discrete Algorithms,
                  22-24 January 1990, San Francisco, California, {USA}},
  pages        = {411--421},
  publisher    = {{SIAM}},
  year         = {1990},
  url          = {http://dl.acm.org/citation.cfm?id=320176.320227},
  timestamp    = {Thu, 05 Jul 2018 07:28:50 +0200},
  biburl       = {https://dblp.org/rec/conf/soda/Kanevsky90.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.