BibTeX record conf/focs/0006PS21

download as .bib file

@inproceedings{DBLP:conf/focs/0006PS21,
  author       = {Jason Li and
                  Debmalya Panigrahi and
                  Thatchaphol Saranurak},
  title        = {A Nearly Optimal All-Pairs Min-Cuts Algorithm in Simple Graphs},
  booktitle    = {62nd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
                  2021, Denver, CO, USA, February 7-10, 2022},
  pages        = {1124--1134},
  publisher    = {{IEEE}},
  year         = {2021},
  url          = {https://doi.org/10.1109/FOCS52979.2021.00111},
  doi          = {10.1109/FOCS52979.2021.00111},
  timestamp    = {Sun, 12 Nov 2023 02:15:43 +0100},
  biburl       = {https://dblp.org/rec/conf/focs/0006PS21.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.