{"_id":{"_str":"525bb53a7e98fada74000100"},"__v":0,"authorIDs":[],"author_short":["Agnarsson, G.","Halldórsson, M. M.","Losievskaja, E."],"bibbaseid":"agnarsson-halldrsson-losievskaja-sdpbasedalgorithmsformaximumindependentsetproblemsonhypergraphs-2013","bibdata":{"html":"<div class=\"bibbase_paper\">\n\n\n<span class=\"bibbase_paper_titleauthoryear\">\n\t<span class=\"bibbase_paper_title\"><a name=\"dblp1428758\"> </a>SDP-based algorithms for maximum independent set problems on hypergraphs.</span>\n\t<span class=\"bibbase_paper_author\">\nAgnarsson, G.; Halldórsson, M. M.; and Losievskaja, E.</span>\n\t<!-- <span class=\"bibbase_paper_year\">2013</span>. -->\n</span>\n\n\n\n<i>Theor. Comput. Sci. (TCS)</i>,\n\n470:1-9.\n\n 2013.\n\n\n\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content\">\n \n \n <!-- <i -->\n <!-- onclick=\"javascript:log_download('agnarsson-halldrsson-losievskaja-sdpbasedalgorithmsformaximumindependentsetproblemsonhypergraphs-2013', 'http://dx.doi.org/10.1016/j.tcs.2012.11.025')\">DEBUG -->\n <!-- </i> -->\n\n <a href=\"http://dx.doi.org/10.1016/j.tcs.2012.11.025\"\n onclick=\"javascript:log_download('agnarsson-halldrsson-losievskaja-sdpbasedalgorithmsformaximumindependentsetproblemsonhypergraphs-2013', 'http://dx.doi.org/10.1016/j.tcs.2012.11.025')\">\n <img src=\"http://bibbase.org/img/filetypes/blank.png\"\n\t alt=\"SDP-based algorithms for maximum independent set problems on hypergraphs [.025]\" \n\t class=\"bibbase_icon\"\n\t style=\"width: 24px; height: 24px; border: 0px; vertical-align: text-top\" ><span class=\"bibbase_icon_text\">Paper</span></a> \n \n \n <a href=\"javascript:showBib('dblp1428758')\">\n <img src=\"http://bibbase.org/img/filetypes/bib.png\" \n\t alt=\"SDP-based algorithms for maximum independent set problems on hypergraphs [bib]\" \n\t class=\"bibbase_icon\"\n\t style=\"width: 24px; height: 24px; border: 0px; vertical-align: text-top\"><span class=\"bibbase_icon_text\">Bibtex</span></a>\n \n \n\n \n \n \n \n \n\n \n \n</span>\n\n<!-- -->\n\n</div>\n","downloads":0,"bibbaseid":"agnarsson-halldrsson-losievskaja-sdpbasedalgorithmsformaximumindependentsetproblemsonhypergraphs-2013","urls":{"Paper":"http://dx.doi.org/10.1016/j.tcs.2012.11.025"},"role":"author","bibtex":"@article{ dblp1428758,\n title = {SDP-based algorithms for maximum independent set problems on hypergraphs},\n author = {Geir Agnarsson and Magnús M. Halldórsson and Elena Losievskaja},\n author_short = {Agnarsson, G. and Halldórsson, M. M. and Losievskaja, E.},\n bibtype = {article},\n type = {article},\n year = {2013},\n key = {dblp1428758},\n id = {dblp1428758},\n biburl = {http://www.dblp.org/rec/bibtex/journals/tcs/AgnarssonHL13},\n url = {http://dx.doi.org/10.1016/j.tcs.2012.11.025},\n journal = {Theor. Comput. Sci. (TCS)},\n pages = {1-9},\n volume = {470},\n text = {Theor. Comput. Sci. (TCS) 470:1-9 (2013)}\n}","text":"Theor. Comput. Sci. (TCS) 470:1-9 (2013)","volume":"470","pages":"1-9","journal":"Theor. Comput. Sci. (TCS)","url":"http://dx.doi.org/10.1016/j.tcs.2012.11.025","biburl":"http://www.dblp.org/rec/bibtex/journals/tcs/AgnarssonHL13","id":"dblp1428758","key":"dblp1428758","year":"2013","type":"article","bibtype":"article","author_short":["Agnarsson, G.","Halldórsson, M. M.","Losievskaja, E."],"author":["Geir Agnarsson","Magnús M. Halldórsson","Elena Losievskaja"],"title":"SDP-based algorithms for maximum independent set problems on hypergraphs"},"bibtype":"article","biburl":"http://www.dblp.org/rec/bibtex/journals/tcs/AgnarssonHL13","downloads":0,"search_terms":["sdp","based","algorithms","maximum","independent","set","problems","hypergraphs","agnarsson","halldórsson","losievskaja"],"title":"SDP-based algorithms for maximum independent set problems on hypergraphs","year":2013,"dataSources":["G7xE2jCp3HEvFtgK8"]}