"Geometric Thickness of Multigraphs is ∃ ℝ-Complete."

Henry Förster et al. (2024)

> Home

Details and statistics

DOI: 10.1007/978-3-031-55598-5_22

access: closed

type: Conference or Workshop Paper

metadata version: 2024-07-19

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/latin/ForsterKMPTV24
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/latin/ForsterKMPTV24
Henry Förster, Philipp Kindermann, Tillmann Miltzow, Irene Parada, Soeren Terziadis, Birgit Vogtenhuber:
Geometric Thickness of Multigraphs is ∃ ℝ-Complete. LATIN (1) 2024: 336-349

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.