On the parameterized complexity of red-blue points separation

Conference paper

Bonnet, E., Giannopoulos, P. and Lampis, M. 2018. On the parameterized complexity of red-blue points separation. 12th International Symposium on Parameterized and Exact Computation (IPEC 2017). Vienna, Austria 06 - 08 Sep 2017 Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH. pp. 8:1-8:13 https://doi.org/10.4230/LIPIcs.IPEC.2017.8
TypeConference paper
TitleOn the parameterized complexity of red-blue points separation
AuthorsBonnet, E., Giannopoulos, P. and Lampis, M.
Research GroupFoundations of Computing group
Conference12th International Symposium on Parameterized and Exact Computation (IPEC 2017)
Page range8:1-8:13
ISSN1868-8969
ISBN
Hardcover9783959770514
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH
Publication dates
Online06 Sep 2017
Print2018
Publication process dates
Deposited03 Nov 2017
Accepted25 Jul 2017
Output statusPublished
Publisher's version
License
Accepted author manuscript
License
Digital Object Identifier (DOI)https://doi.org/10.4230/LIPIcs.IPEC.2017.8
LanguageEnglish
Book titleProceedings of the 12th International Symposium on Parameterized and Exact Computation (IPEC 2017)
Permalink -

https://repository.mdx.ac.uk/item/8745y

Log in to edit

Download files

Publisher's version
LIPIcs-IPEC-2017-8.pdf
License: CC BY 4.0

Accepted author manuscript
main.pdf
License: CC BY 4.0

  • 148
    total views
  • 126
    total downloads
  • 1
    views this month
  • 0
    downloads this month

Export as

Related outputs

Low-crossing spanning trees: an alternative proof and experiments
Giannopoulos, P., Konzack, M. and Mulzer, W. 2014. Low-crossing spanning trees: an alternative proof and experiments. European Workshop on Computational Geometry. Ein-Gedi, Israel 03 - 05 Mar 2014
Orthogonal terrain guarding is NP-complete
Bonnet, E. and Giannopoulos, P. 2018. Orthogonal terrain guarding is NP-complete. 34th International Symposium on Computational Geometry (SoCG 2018). Budapest, Hungary 11 - 14 Jun 2018 Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH. pp. 11:1-11:15 https://doi.org/10.4230/LIPIcs.SoCG.2018.11
QPTAS and subexponential algorithm for maximum clique on disk graphs
Bonnet, E., Giannopoulos, P., Kim, E., Rzążewski, P. and Sikora, F. 2018. QPTAS and subexponential algorithm for maximum clique on disk graphs. 34th International Symposium on Computational Geometry. Budapest, Hungary 11 - 14 Jun 2018 Dagstuhl, Germany Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH. pp. 12:1-12:15 https://doi.org/10.4230/LIPIcs.SoCG.2018.12
Minimum cell connection in line segment arrangements
Alt, H., Cabello, S., Giannopoulos, P. and Knauer, C. 2017. Minimum cell connection in line segment arrangements. International Journal of Computational Geometry and Applications. 27 (3), pp. 159-176. https://doi.org/10.1142/s0218195917500017
The complexity of separating points in the plane
Cabello, S. and Giannopoulos, P. 2016. The complexity of separating points in the plane. Algorithmica. 74 (2), pp. 643-663. https://doi.org/10.1007/s00453-014-9965-6