BibTeX record conf/mfcs/FigueiredoMO021

download as .bib file

@inproceedings{DBLP:conf/mfcs/FigueiredoMO021,
  author       = {Celina M. H. de Figueiredo and
                  Alexsander Andrade de Melo and
                  Fabiano de S. Oliveira and
                  Ana Silva},
  editor       = {Filippo Bonchi and
                  Simon J. Puglisi},
  title        = {Maximum Cut on Interval Graphs of Interval Count Four Is NP-Complete},
  booktitle    = {46th International Symposium on Mathematical Foundations of Computer
                  Science, {MFCS} 2021, August 23-27, 2021, Tallinn, Estonia},
  series       = {LIPIcs},
  volume       = {202},
  pages        = {38:1--38:15},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2021},
  url          = {https://doi.org/10.4230/LIPIcs.MFCS.2021.38},
  doi          = {10.4230/LIPICS.MFCS.2021.38},
  timestamp    = {Sun, 02 Oct 2022 16:11:39 +0200},
  biburl       = {https://dblp.org/rec/conf/mfcs/FigueiredoMO021.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.