@article{DBLP:journals/corr/abs-1708-03962,
  author    = {Danupon Nanongkai and
               Thatchaphol Saranurak and
               Christian Wulff{-}Nilsen},
  title     = {Dynamic Minimum Spanning Forest with Subpolynomial Worst-case Update
               Time},
  journal   = {CoRR},
  volume    = {abs/1708.03962},
  year      = {2017},
  url       = {http://arxiv.org/abs/1708.03962},
  archivePrefix = {arXiv},
  eprint    = {1708.03962},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/abs-1708-03962.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

{"_id":"tx4DhgD7SyXKCe63Z","bibbaseid":"nanongkai-saranurak-wulffnilsen-dynamicminimumspanningforestwithsubpolynomialworstcaseupdatetime-2017","author_short":["Nanongkai, D.","Saranurak, T.","Wulff-Nilsen, C."],"bibdata":{"bibtype":"article","type":"article","author":[{"firstnames":["Danupon"],"propositions":[],"lastnames":["Nanongkai"],"suffixes":[]},{"firstnames":["Thatchaphol"],"propositions":[],"lastnames":["Saranurak"],"suffixes":[]},{"firstnames":["Christian"],"propositions":[],"lastnames":["Wulff-Nilsen"],"suffixes":[]}],"title":"Dynamic Minimum Spanning Forest with Subpolynomial Worst-case Update Time","journal":"CoRR","volume":"abs/1708.03962","year":"2017","url":"http://arxiv.org/abs/1708.03962","archiveprefix":"arXiv","eprint":"1708.03962","timestamp":"Mon, 13 Aug 2018 01:00:00 +0200","biburl":"https://dblp.org/rec/journals/corr/abs-1708-03962.bib","bibsource":"dblp computer science bibliography, https://dblp.org","bibtex":"@article{DBLP:journals/corr/abs-1708-03962,\n author = {Danupon Nanongkai and\n Thatchaphol Saranurak and\n Christian Wulff{-}Nilsen},\n title = {Dynamic Minimum Spanning Forest with Subpolynomial Worst-case Update\n Time},\n journal = {CoRR},\n volume = {abs/1708.03962},\n year = {2017},\n url = {http://arxiv.org/abs/1708.03962},\n archivePrefix = {arXiv},\n eprint = {1708.03962},\n timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},\n biburl = {https://dblp.org/rec/journals/corr/abs-1708-03962.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n","author_short":["Nanongkai, D.","Saranurak, T.","Wulff-Nilsen, C."],"key":"DBLP:journals/corr/abs-1708-03962","id":"DBLP:journals/corr/abs-1708-03962","bibbaseid":"nanongkai-saranurak-wulffnilsen-dynamicminimumspanningforestwithsubpolynomialworstcaseupdatetime-2017","role":"author","urls":{"Paper":"http://arxiv.org/abs/1708.03962"},"metadata":{"authorlinks":{}}},"bibtype":"article","biburl":"https://dblp.org/pid/123/4694.bib","dataSources":["aRHngFmcNsyNxZ9Rj"],"keywords":[],"search_terms":["dynamic","minimum","spanning","forest","subpolynomial","worst","case","update","time","nanongkai","saranurak","wulff-nilsen"],"title":"Dynamic Minimum Spanning Forest with Subpolynomial Worst-case Update Time","year":2017}