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.
Fine-grained complexity of integer programming: The case of bounded branch-width and rank [link]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