Fine-grained complexity of integer programming: The case of bounded branch-width and rank. Fomin, F. V., Panolan, F., Ramanujan, M. S., & Saurabh, S. CoRR, 2016. Paper bibtex @article{DBLP:journals/corr/FominPRS16,
author = {Fedor V. Fomin and
Fahad Panolan and
M. S. Ramanujan and
Saket Saurabh},
title = {Fine-grained complexity of integer programming: The case of bounded
branch-width and rank},
journal = {CoRR},
volume = {abs/1607.05342},
year = {2016},
url = {http://arxiv.org/abs/1607.05342},
timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},
biburl = {http://dblp.uni-trier.de/rec/bib/journals/corr/FominPRS16},
bibsource = {dblp computer science bibliography, http://dblp.org}
}
Downloads: 0
{"_id":"hwogqqQWPLwund4Tn","bibbaseid":"fomin-panolan-ramanujan-saurabh-finegrainedcomplexityofintegerprogrammingthecaseofboundedbranchwidthandrank-2016","downloads":0,"creationDate":"2017-10-05T10:55:41.428Z","title":"Fine-grained complexity of integer programming: The case of bounded branch-width and rank","author_short":["Fomin, F. V.","Panolan, F.","Ramanujan, M. S.","Saurabh, S."],"year":2016,"bibtype":"article","biburl":"https://www2.warwick.ac.uk/fac/sci/dcs/people/ramanujan_sridharan/publications/ramanujan-m_s_2.bib","bibdata":{"bibtype":"article","type":"article","author":[{"firstnames":["Fedor","V."],"propositions":[],"lastnames":["Fomin"],"suffixes":[]},{"firstnames":["Fahad"],"propositions":[],"lastnames":["Panolan"],"suffixes":[]},{"firstnames":["M.","S."],"propositions":[],"lastnames":["Ramanujan"],"suffixes":[]},{"firstnames":["Saket"],"propositions":[],"lastnames":["Saurabh"],"suffixes":[]}],"title":"Fine-grained complexity of integer programming: The case of bounded branch-width and rank","journal":"CoRR","volume":"abs/1607.05342","year":"2016","url":"http://arxiv.org/abs/1607.05342","timestamp":"Wed, 07 Jun 2017 01:00:00 +0200","biburl":"http://dblp.uni-trier.de/rec/bib/journals/corr/FominPRS16","bibsource":"dblp computer science bibliography, http://dblp.org","bibtex":"@article{DBLP:journals/corr/FominPRS16,\n author = {Fedor V. Fomin and\n Fahad Panolan and\n M. S. Ramanujan and\n Saket Saurabh},\n title = {Fine-grained complexity of integer programming: The case of bounded\n branch-width and rank},\n journal = {CoRR},\n volume = {abs/1607.05342},\n year = {2016},\n url = {http://arxiv.org/abs/1607.05342},\n timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},\n biburl = {http://dblp.uni-trier.de/rec/bib/journals/corr/FominPRS16},\n bibsource = {dblp computer science bibliography, http://dblp.org}\n}\n\n","author_short":["Fomin, F. V.","Panolan, F.","Ramanujan, M. S.","Saurabh, S."],"key":"DBLP:journals/corr/FominPRS16","id":"DBLP:journals/corr/FominPRS16","bibbaseid":"fomin-panolan-ramanujan-saurabh-finegrainedcomplexityofintegerprogrammingthecaseofboundedbranchwidthandrank-2016","role":"author","urls":{"Paper":"http://arxiv.org/abs/1607.05342"},"downloads":0,"html":""},"search_terms":["fine","grained","complexity","integer","programming","case","bounded","branch","width","rank","fomin","panolan","ramanujan","saurabh"],"keywords":[],"authorIDs":[],"dataSources":["PcRMxrFhXmTXzZCRh"]}