"Geometric Thickness of Multigraphs is $\exists \mathbb {R}$-Complete."

Henry Förster et al. (2026)

> Home

Details and statistics

DOI: 10.1007/S00453-025-01351-7

access: closed

type: Journal Article

metadata version: 2025-11-24

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/algorithmica/ForsterKMPTV26
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithmica/ForsterKMPTV26
Henry Förster, Philipp Kindermann, Tillmann Miltzow, Irene Parada, Soeren Terziadis, Birgit Vogtenhuber:
Geometric Thickness of Multigraphs is $\exists \mathbb {R}$-Complete. Algorithmica 88(1): 3 (2026)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.