BibTeX record conf/stacs/AgrawalKP0021

download as .bib file

@inproceedings{DBLP:conf/stacs/AgrawalKP0021,
  author       = {Akanksha Agrawal and
                  Lawqueen Kanesh and
                  Fahad Panolan and
                  M. S. Ramanujan and
                  Saket Saurabh},
  editor       = {Markus Bl{\"{a}}ser and
                  Benjamin Monmege},
  title        = {An {FPT} Algorithm for Elimination Distance to Bounded Degree Graphs},
  booktitle    = {38th International Symposium on Theoretical Aspects of Computer Science,
                  {STACS} 2021, March 16-19, 2021, Saarbr{\"{u}}cken, Germany (Virtual
                  Conference)},
  series       = {LIPIcs},
  volume       = {187},
  pages        = {5:1--5:11},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2021},
  url          = {https://doi.org/10.4230/LIPIcs.STACS.2021.5},
  doi          = {10.4230/LIPICS.STACS.2021.5},
  timestamp    = {Mon, 05 Feb 2024 20:30:48 +0100},
  biburl       = {https://dblp.org/rec/conf/stacs/AgrawalKP0021.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.