"Linear Time Algorithms for NP-Hard Problems Restricted to GaTEx Graphs."

Marc Hellmuth, Guillaume E. Scholz (2023)

> Home

Details and statistics

DOI: 10.1007/978-3-031-49190-0_8

access: closed

type: Conference or Workshop Paper

metadata version: 2024-01-13

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/cocoon/HellmuthS23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cocoon/HellmuthS23
Marc Hellmuth, Guillaume E. Scholz:
Linear Time Algorithms for NP-Hard Problems Restricted to GaTEx Graphs. COCOON (1) 2023: 115-126

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.