"Graph Search Trees and the Intermezzo Problem."

Jesse Beisegel et al. (2024)

> Home

Details and statistics

DOI: 10.4230/LIPICS.MFCS.2024.22

access: open

type: Conference or Workshop Paper

metadata version: 2024-10-06

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/mfcs/BeisegelKR0024
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/mfcs/BeisegelKR0024
Jesse Beisegel, Ekkehard Köhler, Fabienne Ratajczak, Robert Scheffler, Martin Strehler:
Graph Search Trees and the Intermezzo Problem. MFCS 2024: 22:1-22:18

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.