License: Creative Commons Attribution 3.0 Unported license (CC-BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.MFCS.2020.2
URN: urn:nbn:de:0030-drops-126734
URL: https://drops.dagstuhl.de/opus/volltexte/2020/12673/
Go to the corresponding LIPIcs Volume Portal


Cabello, Sergio

Some Open Problems in Computational Geometry (Invited Talk)

pdf-format:
LIPIcs-MFCS-2020-2.pdf (0.5 MB)


Abstract

In this paper we shall encounter three open problems in Computational Geometry that are, in my opinion, interesting for a general audience interested in algorithms.

BibTeX - Entry

@InProceedings{cabello:LIPIcs:2020:12673,
  author =	{Sergio Cabello},
  title =	{{Some Open Problems in Computational Geometry (Invited Talk)}},
  booktitle =	{45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)},
  pages =	{2:1--2:6},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-159-7},
  ISSN =	{1868-8969},
  year =	{2020},
  volume =	{170},
  editor =	{Javier Esparza and Daniel Kr{\'a}ΔΎ},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/opus/volltexte/2020/12673},
  URN =		{urn:nbn:de:0030-drops-126734},
  doi =		{10.4230/LIPIcs.MFCS.2020.2},
  annote =	{Keywords: barrier resilience, maximum matching, geometric graphs, fixed-parameter tractability, stochastic computational geometry}
}

Keywords: barrier resilience, maximum matching, geometric graphs, fixed-parameter tractability, stochastic computational geometry
Collection: 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)
Issue Date: 2020
Date of publication: 18.08.2020


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI