BibTeX record conf/fct/BorowieckiDO21

download as .bib file

@inproceedings{DBLP:conf/fct/BorowieckiDO21,
  author       = {Piotr Borowiecki and
                  Dariusz Dereniowski and
                  Dorota Osula},
  editor       = {Evripidis Bampis and
                  Aris Pagourtzis},
  title        = {The Complexity of Bicriteria Tree-Depth},
  booktitle    = {Fundamentals of Computation Theory - 23rd International Symposium,
                  {FCT} 2021, Athens, Greece, September 12-15, 2021, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {12867},
  pages        = {100--113},
  publisher    = {Springer},
  year         = {2021},
  url          = {https://doi.org/10.1007/978-3-030-86593-1\_7},
  doi          = {10.1007/978-3-030-86593-1\_7},
  timestamp    = {Mon, 03 Jan 2022 22:37:12 +0100},
  biburl       = {https://dblp.org/rec/conf/fct/BorowieckiDO21.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.