@article{DBLP:journals/mst/LackiS17,
  author       = {Jakub Lacki and
                  Piotr Sankowski},
  title        = {Optimal Decremental Connectivity in Planar Graphs},
  journal      = {Theory Comput. Syst.},
  volume       = {61},
  number       = {4},
  pages        = {1037--1053},
  year         = {2017},
  url          = {https://doi.org/10.1007/s00224-016-9709-x},
  doi          = {10.1007/S00224-016-9709-X},
  timestamp    = {Thu, 19 Oct 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mst/LackiS17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

{"_id":"LT5B4HpAQraGBGqkG","bibbaseid":"lacki-sankowski-optimaldecrementalconnectivityinplanargraphs-2017","downloads":0,"creationDate":"2017-10-20T18:35:27.657Z","title":"Optimal Decremental Connectivity in Planar Graphs","author_short":["Lacki, J.","Sankowski, P."],"year":2017,"bibtype":"article","biburl":"http://dblp.org/pers/tb2/s/Sankowski:Piotr","bibdata":{"bibtype":"article","type":"article","author":[{"firstnames":["Jakub"],"propositions":[],"lastnames":["Lacki"],"suffixes":[]},{"firstnames":["Piotr"],"propositions":[],"lastnames":["Sankowski"],"suffixes":[]}],"title":"Optimal Decremental Connectivity in Planar Graphs","journal":"Theory Comput. Syst.","volume":"61","number":"4","pages":"1037–1053","year":"2017","url":"https://doi.org/10.1007/s00224-016-9709-x","doi":"10.1007/S00224-016-9709-X","timestamp":"Thu, 19 Oct 2017 01:00:00 +0200","biburl":"https://dblp.org/rec/journals/mst/LackiS17.bib","bibsource":"dblp computer science bibliography, https://dblp.org","bibtex":"@article{DBLP:journals/mst/LackiS17,\n author = {Jakub Lacki and\n Piotr Sankowski},\n title = {Optimal Decremental Connectivity in Planar Graphs},\n journal = {Theory Comput. Syst.},\n volume = {61},\n number = {4},\n pages = {1037--1053},\n year = {2017},\n url = {https://doi.org/10.1007/s00224-016-9709-x},\n doi = {10.1007/S00224-016-9709-X},\n timestamp = {Thu, 19 Oct 2017 01:00:00 +0200},\n biburl = {https://dblp.org/rec/journals/mst/LackiS17.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n","author_short":["Lacki, J.","Sankowski, P."],"key":"DBLP:journals/mst/LackiS17","id":"DBLP:journals/mst/LackiS17","bibbaseid":"lacki-sankowski-optimaldecrementalconnectivityinplanargraphs-2017","role":"author","urls":{"Paper":"https://doi.org/10.1007/s00224-016-9709-x"},"metadata":{"authorlinks":{"sankowski, p":"https://duch.mimuw.edu.pl/~sank/wordpress/"}},"downloads":0},"search_terms":["optimal","decremental","connectivity","planar","graphs","lacki","sankowski"],"keywords":[],"authorIDs":["CjFap2PDtauEPd2Hu"],"dataSources":["YTqCu4ZwBgzPtoQwj","cZqX5Q2YyDsGWz96c"]}