Home  Issues  About JGAA  Instructions for Authors 
DOI: 10.7155/jgaa.00557
On the Complexity of Some Geometric Problems With Fixed Parameters
Vol. 25, no. 1, pp. 195218, 2021. Regular paper.
Abstract The following graphdrawing problems are known to be complete for the existential theory of the reals (${\exists \mathbb{R}}$complete) as long as the parameter $k$ is unbounded. Do they remain ${\exists \mathbb{R}}$complete for a fixed value $k$?
This work is licensed under the terms of the CCBY license.

Submitted: July 2020.
Reviewed: December 2020.
Revised: January 2021.
Accepted: January 2021.
Final: January 2021.
Published: January 2021.
Communicated by
Martin Nöllenburg
