BibTeX record conf/soda/JenssenKP19

download as .bib file

@inproceedings{DBLP:conf/soda/JenssenKP19,
  author       = {Matthew Jenssen and
                  Peter Keevash and
                  Will Perkins},
  editor       = {Timothy M. Chan},
  title        = {Algorithms for {\#}BIS-hard problems on expander graphs},
  booktitle    = {Proceedings of the Thirtieth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, {SODA} 2019, San Diego, California, USA, January 6-9,
                  2019},
  pages        = {2235--2247},
  publisher    = {{SIAM}},
  year         = {2019},
  url          = {https://doi.org/10.1137/1.9781611975482.135},
  doi          = {10.1137/1.9781611975482.135},
  timestamp    = {Fri, 08 Jul 2022 23:03:26 +0200},
  biburl       = {https://dblp.org/rec/conf/soda/JenssenKP19.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.