{"user_id":"15415","citation":{"chicago":"Fomin, Fedor V., and Dimitrios M. Thilikos. “Dominating Sets in Planar Graphs: Branch-Width and Exponential Speed-Up.” In <i>Proceedings of the 14th ACM-SIAM Symposium on Discrete Algorithms (SODA 2003)</i>, 2003. <a href=\"https://doi.org/10.1137/s0097539702419649\">https://doi.org/10.1137/s0097539702419649</a>.","apa":"Fomin, F. V., &#38; Thilikos, D. M. (2003). Dominating Sets in Planar Graphs: Branch-Width and Exponential Speed-Up. In <i>Proceedings of the 14th ACM-SIAM Symposium on Discrete Algorithms (SODA 2003)</i>. <a href=\"https://doi.org/10.1137/s0097539702419649\">https://doi.org/10.1137/s0097539702419649</a>","short":"F.V. Fomin, D.M. Thilikos, in: Proceedings of the 14th ACM-SIAM Symposium on Discrete Algorithms (SODA 2003), 2003.","ieee":"F. V. Fomin and D. M. Thilikos, “Dominating Sets in Planar Graphs: Branch-Width and Exponential Speed-Up,” in <i>Proceedings of the 14th ACM-SIAM Symposium on Discrete Algorithms (SODA 2003)</i>, 2003.","ama":"Fomin FV, Thilikos DM. Dominating Sets in Planar Graphs: Branch-Width and Exponential Speed-Up. In: <i>Proceedings of the 14th ACM-SIAM Symposium on Discrete Algorithms (SODA 2003)</i>. ; 2003. doi:<a href=\"https://doi.org/10.1137/s0097539702419649\">10.1137/s0097539702419649</a>","mla":"Fomin, Fedor V., and Dimitrios M. Thilikos. “Dominating Sets in Planar Graphs: Branch-Width and Exponential Speed-Up.” <i>Proceedings of the 14th ACM-SIAM Symposium on Discrete Algorithms (SODA 2003)</i>, 2003, doi:<a href=\"https://doi.org/10.1137/s0097539702419649\">10.1137/s0097539702419649</a>.","bibtex":"@inproceedings{Fomin_Thilikos_2003, title={Dominating Sets in Planar Graphs: Branch-Width and Exponential Speed-Up}, DOI={<a href=\"https://doi.org/10.1137/s0097539702419649\">10.1137/s0097539702419649</a>}, booktitle={Proceedings of the 14th ACM-SIAM Symposium on Discrete Algorithms (SODA 2003)}, author={Fomin, Fedor V. and Thilikos, Dimitrios M.}, year={2003} }"},"date_created":"2020-10-08T10:31:48Z","title":"Dominating Sets in Planar Graphs: Branch-Width and Exponential Speed-Up","_id":"19952","department":[{"_id":"63"}],"publication_identifier":{"issn":["0097-5397","1095-7111"]},"abstract":[{"text":"Graph minors theory, developed by Robertson & Seymour, provides a list of powerful theoretical results and tools. However, the wide spread opinion in Graph Algorithms community about this theory is that it is mainly of theoretical importance. The main purpose of this paper is to show how very deep min-max and duality theorems from Graph Minors can be used to obtain essential speed-up to many known algorithms on different domination problems.","lang":"eng"}],"author":[{"full_name":"Fomin, Fedor V.","last_name":"Fomin","first_name":"Fedor V."},{"first_name":"Dimitrios M.","full_name":"Thilikos, Dimitrios M.","last_name":"Thilikos"}],"status":"public","year":"2003","type":"conference","date_updated":"2022-01-06T06:54:16Z","publication":"Proceedings of the 14th ACM-SIAM Symposium on Discrete Algorithms (SODA 2003)","doi":"10.1137/s0097539702419649","publication_status":"published","language":[{"iso":"eng"}]}