@InProceedings{dumitrescu_et_al:LIPIcs.STACS.2010.2465,
  author =	{Dumitrescu, Adrian and T\'{o}th, Csaba D.},
  title =	{{Long Non-crossing Configurations in the Plane}},
  booktitle =	{27th International Symposium on Theoretical Aspects of Computer Science},
  pages =	{311--322},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-16-3},
  ISSN =	{1868-8969},
  year =	{2010},
  volume =	{5},
  editor =	{Marion, Jean-Yves and Schwentick, Thomas},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2010.2465},
  URN =		{urn:nbn:de:0030-drops-24655},
  doi =		{10.4230/LIPIcs.STACS.2010.2465},
  annote =	{Keywords: Longest non-crossing Hamiltonian path, longest non-crossing Hamiltonian cycle, longest non-crossing spanning tree, approximation algorithm.}
}