BibTeX record conf/fsttcs/KolisettyLVY19

download as .bib file

@inproceedings{DBLP:conf/fsttcs/KolisettyLVY19,
  author       = {Sanjana Kolisetty and
                  Linh Le and
                  Ilya Volkovich and
                  Mihalis Yannakakis},
  editor       = {Arkadev Chattopadhyay and
                  Paul Gastin},
  title        = {The Complexity of Finding S-Factors in Regular Graphs},
  booktitle    = {39th {IARCS} Annual Conference on Foundations of Software Technology
                  and Theoretical Computer Science, {FSTTCS} 2019, December 11-13, 2019,
                  Bombay, India},
  series       = {LIPIcs},
  volume       = {150},
  pages        = {21:1--21:12},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2019},
  url          = {https://doi.org/10.4230/LIPIcs.FSTTCS.2019.21},
  doi          = {10.4230/LIPICS.FSTTCS.2019.21},
  timestamp    = {Wed, 21 Aug 2024 22:46:00 +0200},
  biburl       = {https://dblp.org/rec/conf/fsttcs/KolisettyLVY19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

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.