"On the Complexity of the Realisability Problem for Visit Events in ..."

Arthur Jansen, Bart Kuijpers (2025)

> Home

Details and statistics

DOI: 10.4230/LIPICS.TIME.2025.12

access: open

type: Conference or Workshop Paper

metadata version: 2025-10-21

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/time/JansenK25
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/time/JansenK25
Arthur Jansen, Bart Kuijpers:
On the Complexity of the Realisability Problem for Visit Events in Trajectory Sample Databases. TIME 2025: 12:1-12:14

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.