Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links, observed 2026-08-09T21:48:59.349796Z
Paper Citation Record · LEDGER
Better late, then? The hardness of choosing delays to meet passenger demands in temporal graphs
As of 20 August 2026, this Paper Citation Record lists 33 of 33 outbound references and 1 inbound Pith citation observation for arXiv:2501.18987.
A citation records a reference. It does not transfer a finding from one paper to another.
Coverage vector
One-hop event checks from named stored sources.
Source: scholarly_work_events, retraction_status_cache, observed 2026-08-20T06:33:59.587034+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links, observed 2026-08-07T15:44:28.905413Z
A source-named dated measurement, never combined with another source.
Source: pith, observed 2026-08-07T15:44:33.756622Z
Reference resolution
33 of 33 outbound references displayed
- verified exact19
- verified fuzzy4
- unresolved8
- parse uncertain0
- malformed identifier0
- metadata mismatch2
External citation measurements
No source-named external measurement is stored.
Outbound references
Observation 07385451-f10b-4ee5-9f61-bbc41d10fd09 · outbound
This paper cites The multi-objective railway timetable rescheduling problem.
Better late, then? The hardness of choosing delays to meet passenger demands in temporal graphs The multi-objective railway timetable rescheduling problem
Reference 1
- Resolution
- unresolved
- no resolver link, observed 2026-08-09T21:48:59.222528Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation cf4b3bd4-b046-470e-a9e3-30178c569ad8 · outbound
This paper cites An overview of recovery models and algorithms for real-time railway rescheduling.
Better late, then? The hardness of choosing delays to meet passenger demands in temporal graphs An overview of recovery models and algorithms for real-time railway rescheduling
Reference 2
- Resolution
- verified exact
- doi, observed 2026-08-09T21:48:59.518433Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.
Observation 7ca4c705-a791-4377-bbc8-f62736351600 · outbound
This paper cites Carosi, S.
Better late, then? The hardness of choosing delays to meet passenger demands in temporal graphs Carosi, S
Reference 3
- Resolution
- verified exact
- doi, observed 2026-08-09T21:48:59.507933Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.
Observation 6414a389-ff14-4f5a-8430-c502ab0697b0 · outbound
This paper cites Simple, strict, proper, happy: A study of reachability in temporal graphs.
Better late, then? The hardness of choosing delays to meet passenger demands in temporal graphs Simple, strict, proper, happy: A study of reachability in temporal graphs
Reference 4
- Resolution
- verified exact
- local_arxiv, observed 2026-08-09T21:49:00.179115Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.
Observation 3a447473-63c0-4791-b9e2-ef8a049824c0 · outbound
This paper cites Minimizing Reachability Times on Temporal Graphs via Shifting Labels.
Better late, then? The hardness of choosing delays to meet passenger demands in temporal graphs Minimizing Reachability Times on Temporal Graphs via Shifting Labels
Reference 5
- Resolution
- unresolved
- no resolver link, observed 2026-08-09T21:48:59.241035Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation dded939a-7605-4026-8daa-e3c2df7eae2d · outbound
This paper cites Optimizing reachability sets in temporal graphs by delaying.
Better late, then? The hardness of choosing delays to meet passenger demands in temporal graphs Optimizing reachability sets in temporal graphs by delaying
Reference 6
- Resolution
- unresolved
- no resolver link, observed 2026-08-09T21:48:59.245363Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 82abf2a1-28e2-4616-87a4-616d08bd9c42 · outbound
This paper cites https://zbir.deutschebahn.com/2024/en/interim-group-management-report-unaudited/product-quality-and-digitalization/punctuality/.
Better late, then? The hardness of choosing delays to meet passenger demands in temporal graphs https://zbir.deutschebahn.com/2024/en/interim-group-management-report-unaudited/product-quality-and-digitalization/punctuality/
Reference 7
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-09T21:49:00.223309Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.
Observation 2d901ef7-98ba-4dbe-9179-65a9cdfb6675 · outbound
This paper cites $J/\psi \rightarrow p\bar{p}\phi$ decay in the isobar resonance model.
Better late, then? The hardness of choosing delays to meet passenger demands in temporal graphs $J/\psi \rightarrow p\bar{p}\phi$ decay in the isobar resonance model
Reference 8
- Resolution
- unresolved
- no resolver link, observed 2026-08-09T21:48:59.253378Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation b3894b6c-899d-4c3c-a446-3823d914a59c · outbound
This paper cites Reachability in temporal graphs under perturbation.
Better late, then? The hardness of choosing delays to meet passenger demands in temporal graphs Reachability in temporal graphs under perturbation
Reference 9
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-09T21:49:00.212315Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.
Observation c466c053-0fd9-401f-9615-ae78ef8d9432 · outbound
This paper cites Characterizing Boolean satisfiability variants.
Better late, then? The hardness of choosing delays to meet passenger demands in temporal graphs Characterizing Boolean satisfiability variants
Reference 10
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-09T21:49:00.201961Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.
Observation c3684bc6-a8ab-4bb7-ad02-b8ca8d09d829 · outbound
This paper cites Delay-Robust Routes in Temporal Graphs.
Better late, then? The hardness of choosing delays to meet passenger demands in temporal graphs Delay-Robust Routes in Temporal Graphs
Reference 11
- Resolution
- verified exact
- local_arxiv, observed 2026-08-09T21:49:00.093163Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.
Observation dd2b2d8e-90c6-4661-8472-4a73e7eefa22 · outbound
This paper cites Temporal Connectivity: Coping with Foreseen and Unforeseen Delays.
Better late, then? The hardness of choosing delays to meet passenger demands in temporal graphs Temporal Connectivity: Coping with Foreseen and Unforeseen Delays
Reference 12
- Resolution
- verified exact
- local_arxiv, observed 2026-08-09T21:49:00.078715Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.
Observation 40a9652f-43a9-4fe5-9575-4842e9f74da9 · outbound
This paper cites Railway Delay Management : Exploring Its Algorithmic Complexity.
Better late, then? The hardness of choosing delays to meet passenger demands in temporal graphs Railway Delay Management : Exploring Its Algorithmic Complexity
Reference 13
- Resolution
- verified exact
- doi, observed 2026-08-09T21:48:59.490289Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.
Observation b971b32e-c732-410f-8fea-1da57bef9cd2 · outbound
This paper cites The Computational Complexity of Delay Management.
Better late, then? The hardness of choosing delays to meet passenger demands in temporal graphs The Computational Complexity of Delay Management
Reference 14
- Resolution
- verified exact
- doi, observed 2026-08-09T21:48:59.478462Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.
Observation ad2d9555-b28f-4171-9f4c-4ca8d0fcf013 · outbound
This paper cites To Wait or Not to Wait ? The Bicriteria Delay Management Problem in Public Transportation.
Better late, then? The hardness of choosing delays to meet passenger demands in temporal graphs To Wait or Not to Wait ? The Bicriteria Delay Management Problem in Public Transportation
Reference 15
- Resolution
- verified exact
- raw_fallback, observed 2026-08-09T21:49:00.063420Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.
Observation 97e6f6bc-99b8-4388-b8a4-67281a90c29b · outbound
This paper cites Optimization models for the single delay management problem in public transportation.
Better late, then? The hardness of choosing delays to meet passenger demands in temporal graphs Optimization models for the single delay management problem in public transportation
Reference 16
- Resolution
- verified exact
- doi, observed 2026-08-09T21:48:59.467204Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.
Observation 9ee1a353-9f47-4ed8-8471-244f34260546 · outbound
This paper cites an unresolved cited work.
Better late, then? The hardness of choosing delays to meet passenger demands in temporal graphs Unresolved cited work
Reference 17
- Resolution
- unresolved
- no resolver link, observed 2026-08-09T21:48:59.290202Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation e74d1a19-334a-4aae-a3ff-c3ec6c179e73 · outbound
This paper cites Karmarkar.
Better late, then? The hardness of choosing delays to meet passenger demands in temporal graphs Karmarkar
Reference 18
- Resolution
- metadata mismatch
- raw_fallback, observed 2026-08-09T21:48:59.940032Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.
Observation 5303b5bb-2b59-4f1c-94fb-9eadabd20810 · outbound
This paper cites Kroon, Rommert Dekker, and Michiel J.
Better late, then? The hardness of choosing delays to meet passenger demands in temporal graphs Kroon, Rommert Dekker, and Michiel J
Reference 19
- Resolution
- verified exact
- doi, observed 2026-08-09T21:48:59.455928Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.
Observation 81b7328a-f065-4128-a39d-ba35351e1c78 · outbound
This paper cites Temporal Reachability Dominating Sets: contagion in temporal graphs.
Better late, then? The hardness of choosing delays to meet passenger demands in temporal graphs Temporal Reachability Dominating Sets: contagion in temporal graphs
Reference 20
- Resolution
- metadata mismatch
- local_arxiv, observed 2026-08-09T21:48:59.878449Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.
Observation 801d6516-688d-41fd-81ec-3d80e49ffd3d · outbound
This paper cites A review on railway delay management.
Better late, then? The hardness of choosing delays to meet passenger demands in temporal graphs A review on railway delay management
Reference 21
- Resolution
- verified exact
- doi, observed 2026-08-09T21:48:59.444020Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.
Observation 4d69c43b-f9d7-4d10-ae9c-30929b88e5f9 · outbound
This paper cites Delay and disruption management in local public transportation via real-time vehicle and crew re-scheduling: a case study.
Better late, then? The hardness of choosing delays to meet passenger demands in temporal graphs Delay and disruption management in local public transportation via real-time vehicle and crew re-scheduling: a case study
Reference 22
- Resolution
- verified exact
- doi, observed 2026-08-09T21:48:59.433333Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.
Observation 41e83da1-8191-43e9-af37-ea34feb8e8ec · outbound
This paper cites NP -completeness of list coloring and precoloring extension on the edges of planar graphs.
Better late, then? The hardness of choosing delays to meet passenger demands in temporal graphs NP -completeness of list coloring and precoloring extension on the edges of planar graphs
Reference 23
- Resolution
- verified exact
- doi, observed 2026-08-09T21:48:59.420283Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.
Observation 7430588a-77b6-4f93-9b6c-1c4007fc525f · outbound
This paper cites Temporal reachability minimization: Delaying vs.
Better late, then? The hardness of choosing delays to meet passenger demands in temporal graphs Temporal reachability minimization: Delaying vs
Reference 24
- Resolution
- unresolved
- no resolver link, observed 2026-08-09T21:48:59.316122Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 5974a1b0-91dc-4352-97fa-b12110a44bd9 · outbound
This paper cites an unresolved cited work.
Better late, then? The hardness of choosing delays to meet passenger demands in temporal graphs Unresolved cited work
Reference 25
- Resolution
- verified exact
- raw_fallback, observed 2026-08-09T21:48:59.806836Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.
Observation 249542b2-818c-4a19-bc07-ee79769fe9a6 · outbound
This paper cites Delay Management in Public Transportation : Capacities , Robustness , and Integration.
Better late, then? The hardness of choosing delays to meet passenger demands in temporal graphs Delay Management in Public Transportation : Capacities , Robustness , and Integration
Reference 26
- Resolution
- verified exact
- doi, observed 2026-08-09T21:48:59.409511Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.
Observation 7acff287-db66-4268-8276-32d70137ea8e · outbound
This paper cites A Model for the Delay Management Problem based on Mixed - Integer - Programming.
Better late, then? The hardness of choosing delays to meet passenger demands in temporal graphs A Model for the Delay Management Problem based on Mixed - Integer - Programming
Reference 27
- Resolution
- verified exact
- doi, observed 2026-08-09T21:48:59.398334Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.
Observation d5794467-cf33-4604-84dc-e41fa67da392 · outbound
This paper cites Optimization in Public Transportation , volume 3 of Springer Optimization and Its Applications.
Better late, then? The hardness of choosing delays to meet passenger demands in temporal graphs Optimization in Public Transportation , volume 3 of Springer Optimization and Its Applications
Reference 28
- Resolution
- verified exact
- doi, observed 2026-08-09T21:48:59.387746Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.
Observation 742975da-636c-4a92-bb31-126ef017cb33 · outbound
This paper cites Optimizing air-rail travel connections: A data-driven delay management strategy for seamless passenger journeys.
Better late, then? The hardness of choosing delays to meet passenger demands in temporal graphs Optimizing air-rail travel connections: A data-driven delay management strategy for seamless passenger journeys
Reference 29
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-09T21:49:00.191946Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.
Observation 66ea4380-57ee-4261-bf84-ec67762d253b · outbound
This paper cites Veelenturf, Martin P.
Better late, then? The hardness of choosing delays to meet passenger demands in temporal graphs Veelenturf, Martin P
Reference 30
- Resolution
- verified exact
- raw_fallback, observed 2026-08-09T21:48:59.732804Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.
Observation b464b1ee-0995-4ea7-a2c5-1f4a19c5f1f1 · outbound
This paper cites Path problems in temporal graphs.
Better late, then? The hardness of choosing delays to meet passenger demands in temporal graphs Path problems in temporal graphs
Reference 31
- Resolution
- unresolved
- no resolver link, observed 2026-08-09T21:48:59.343296Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation ca25d06b-a5c0-4d26-b8da-6fd4ec7341da · outbound
This paper cites Train rescheduling for large-scale disruptions in a large-scale railway network.
Better late, then? The hardness of choosing delays to meet passenger demands in temporal graphs Train rescheduling for large-scale disruptions in a large-scale railway network
Reference 32
- Resolution
- unresolved
- no resolver link, observed 2026-08-09T21:48:59.346673Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 1db4c5c0-049f-473a-8730-c4acb31ac57a · outbound
This paper cites an unresolved cited work.
Better late, then? The hardness of choosing delays to meet passenger demands in temporal graphs Unresolved cited work
Reference 33
- Resolution
- verified exact
- doi, observed 2026-08-09T21:48:59.375139Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.
Pith citing papers
Observation a79fa560-860b-401c-83a8-02a586e91ccd · inbound
Exploring Temporal Graphs with Frequent and Regular Edges cites this paper.
Exploring Temporal Graphs with Frequent and Regular Edges Better late, then? The hardness of choosing delays to meet passenger demands in temporal graphs
Reference 1
- Resolution
- verified exact
- local_arxiv, observed 2026-08-07T15:44:33.888599Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.