Decremental single-source reachability in planar digraphs

Giuseppe F. Italiano, Adam Karczmarz, Jakub Lacki, Piotr Sankowski. Decremental single-source reachability in planar digraphs. In Hamed Hatami, Pierre McKenzie, Valerie King, editors, Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2017, Montreal, QC, Canada, June 19-23, 2017. pages 1108-1121, ACM, 2017. [doi]

@inproceedings{ItalianoKLS17,
  title = {Decremental single-source reachability in planar digraphs},
  author = {Giuseppe F. Italiano and Adam Karczmarz and Jakub Lacki and Piotr Sankowski},
  year = {2017},
  doi = {10.1145/3055399.3055480},
  url = {http://doi.acm.org/10.1145/3055399.3055480},
  researchr = {https://researchr.org/publication/ItalianoKLS17},
  cites = {0},
  citedby = {0},
  pages = {1108-1121},
  booktitle = {Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2017, Montreal, QC, Canada, June 19-23, 2017},
  editor = {Hamed Hatami and Pierre McKenzie and Valerie King},
  publisher = {ACM},
  isbn = {978-1-4503-4528-6},
}