BibTeX Export for Space-Efficient Algorithms for Reachability in Directed Geometric Graphs

Copy to Clipboard Download

@InProceedings{bhore_et_al:LIPIcs.ISAAC.2021.63,
  author =	{Bhore, Sujoy and Jain, Rahul},
  title =	{{Space-Efficient Algorithms for Reachability in Directed Geometric Graphs}},
  booktitle =	{32nd International Symposium on Algorithms and Computation (ISAAC 2021)},
  pages =	{63:1--63:17},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-214-3},
  ISSN =	{1868-8969},
  year =	{2021},
  volume =	{212},
  editor =	{Ahn, Hee-Kap and Sadakane, Kunihiko},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2021.63},
  URN =		{urn:nbn:de:0030-drops-154961},
  doi =		{10.4230/LIPIcs.ISAAC.2021.63},
  annote =	{Keywords: Reachablity, Geometric intersection graphs, Space-efficient algorithms}
}

The metadata provided by Dagstuhl Publishing on its webpages, as well as their export formats (such as XML or BibTeX) available at our website, is released under the CC0 1.0 Public Domain Dedication license. That is, you are free to copy, distribute, use, modify, transform, build upon, and produce derived works from our data, even for commercial purposes, all without asking permission. Of course, we are always happy if you provide a link to us as the source of the data.

Read the full CC0 1.0 legal code for the exact terms that apply: https://creativecommons.org/publicdomain/zero/1.0/legalcode