@article{DBLP:journals/ipl/BansalU17,
  author    = {Nikhil Bansal and
               Seeun William Umboh},
  title     = {Tight approximation bounds for dominating set on graphs of bounded
               arboricity},
  journal   = {Inf. Process. Lett.},
  volume    = {122},
  pages     = {21--24},
  year      = {2017},
  url       = {https://doi.org/10.1016/j.ipl.2017.01.011},
  timestamp = {Tue, 15 Feb 2022 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/ipl/BansalU17.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

{"_id":"999ELaR2gaWeMeRq9","bibbaseid":"bansal-umboh-tightapproximationboundsfordominatingsetongraphsofboundedarboricity-2017","author_short":["Bansal, N.","Umboh, S. W."],"bibdata":{"bibtype":"article","type":"article","author":[{"firstnames":["Nikhil"],"propositions":[],"lastnames":["Bansal"],"suffixes":[]},{"firstnames":["Seeun","William"],"propositions":[],"lastnames":["Umboh"],"suffixes":[]}],"title":"Tight approximation bounds for dominating set on graphs of bounded arboricity","journal":"Inf. Process. Lett.","volume":"122","pages":"21–24","year":"2017","url":"https://doi.org/10.1016/j.ipl.2017.01.011","timestamp":"Tue, 15 Feb 2022 00:00:00 +0100","biburl":"https://dblp.org/rec/journals/ipl/BansalU17.bib","bibsource":"dblp computer science bibliography, https://dblp.org","bibtex":"@article{DBLP:journals/ipl/BansalU17,\n author = {Nikhil Bansal and\n Seeun William Umboh},\n title = {Tight approximation bounds for dominating set on graphs of bounded\n arboricity},\n journal = {Inf. Process. Lett.},\n volume = {122},\n pages = {21--24},\n year = {2017},\n url = {https://doi.org/10.1016/j.ipl.2017.01.011},\n timestamp = {Tue, 15 Feb 2022 00:00:00 +0100},\n biburl = {https://dblp.org/rec/journals/ipl/BansalU17.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n","author_short":["Bansal, N.","Umboh, S. W."],"key":"DBLP:journals/ipl/BansalU17","id":"DBLP:journals/ipl/BansalU17","bibbaseid":"bansal-umboh-tightapproximationboundsfordominatingsetongraphsofboundedarboricity-2017","role":"author","urls":{"Paper":"https://doi.org/10.1016/j.ipl.2017.01.011"},"metadata":{"authorlinks":{}}},"bibtype":"article","biburl":"https://bibbase.org/network/files/qyK8KPx6JHiBjGaRs","dataSources":["fMqRtzLgM2KNfkNW2","eg2vynTaAy9aRwMje","JstqMqR72gLdioEdx","wztYpFajAHupX7543","SQ5YPvQM68JoyAMKQ"],"keywords":[],"search_terms":["tight","approximation","bounds","dominating","set","graphs","bounded","arboricity","bansal","umboh"],"title":"Tight approximation bounds for dominating set on graphs of bounded arboricity","year":2017}