Worst-Case Optimal BGPs on Temporal Graphs | Paper Citation Record

Observation f59abcf3-7cb8-4ec9-b60e-15197d7bea9d · outbound

This paper cites Emptyheaded: A relational engine for graph processing.

Worst-Case Optimal BGPs on Temporal Graphs Emptyheaded: A relational engine for graph processing

Reference 1

Resolution: unresolved; no resolver link, observed 2026-08-01T10:14:41.381235Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 3b826eb8-957f-4623-8217-81daba703a03 · outbound

This paper cites The complexity of boolean conjunctive queries with intersection joins.

Worst-Case Optimal BGPs on Temporal Graphs The complexity of boolean conjunctive queries with intersection joins

Reference 2

Resolution: unresolved; no resolver link, observed 2026-08-01T10:14:41.472384Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 6991e996-aaae-4db3-88d5-75e4822fee60 · outbound

This paper cites What do Shannon-type inequalities, submodular width, and disjunctive datalog have to do with one another? InProc.

Worst-Case Optimal BGPs on Temporal Graphs What do Shannon-type inequalities, submodular width, and disjunctive datalog have to do with one another? InProc

Reference 3

Resolution: unresolved; no resolver link, observed 2026-08-01T10:14:41.619008Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0afb6c3c-2218-4d66-9535-e3704f095ffa · outbound

This paper cites Index maintenance for time-travel text search.

Worst-Case Optimal BGPs on Temporal Graphs Index maintenance for time-travel text search

Reference 4

Resolution: unresolved; no resolver link, observed 2026-08-01T10:14:41.762544Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b62fdaa8-0ba7-460d-8fa8-caafa70d3d87 · outbound

This paper cites Foundations of modern query languages for graph databases.

Worst-Case Optimal BGPs on Temporal Graphs Foundations of modern query languages for graph databases

Reference 5

Resolution: unresolved; no resolver link, observed 2026-08-01T10:14:41.906281Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 43d30dff-3227-4afd-876f-f112e2a1d20c · outbound

This paper cites Temporal regular path queries.

Worst-Case Optimal BGPs on Temporal Graphs Temporal regular path queries

Reference 6

Resolution: unresolved; no resolver link, observed 2026-08-01T10:14:42.051380Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 63e86371-2f64-4b5f-8fc8-2fa8faa72c10 · outbound

This paper cites CompactLTJ: Space & time efficient Leapfrog Triejoin on graph databases.The Very Large Databases Journal, 34:article 67, 2025.

Worst-Case Optimal BGPs on Temporal Graphs CompactLTJ: Space & time efficient Leapfrog Triejoin on graph databases.The Very Large Databases Journal, 34:article 67, 2025

Reference 7

Resolution: unresolved; no resolver link, observed 2026-08-01T10:14:42.190000Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation fe7cf0d1-5b78-482f-b17d-31430a85894c · outbound

This paper cites Reutter, Javiel Rojas-Ledesma, and Adriá Soto.

Worst-Case Optimal BGPs on Temporal Graphs Reutter, Javiel Rojas-Ledesma, and Adriá Soto

Reference 8

Resolution: unresolved; no resolver link, observed 2026-08-01T10:14:42.386669Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c02b8d3e-9643-4167-bbf2-75e06fa789ef · outbound

This paper cites Size bounds and query plans for relational joins.SIAM Journal on Computing, 42(4):1737–1767, 2013.

Worst-Case Optimal BGPs on Temporal Graphs Size bounds and query plans for relational joins.SIAM Journal on Computing, 42(4):1737–1767, 2013

Reference 9

Resolution: unresolved; no resolver link, observed 2026-08-01T10:14:42.519852Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ba465c5b-bb7d-44d1-88ba-f95116482a6c · outbound

This paper cites A time machine for text search.

Worst-Case Optimal BGPs on Temporal Graphs A time machine for text search

Reference 10

Resolution: unresolved; no resolver link, observed 2026-08-01T10:14:42.638013Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4e96fcf1-ccc5-43ec-bceb-25884cb8d8f4 · outbound

This paper cites Temporal statement modifiers.ACM Transactions on Database Systems, 25(4):407–456, 2000.

Worst-Case Optimal BGPs on Temporal Graphs Temporal statement modifiers.ACM Transactions on Database Systems, 25(4):407–456, 2000

Reference 11

Resolution: unresolved; no resolver link, observed 2026-08-01T10:14:42.752361Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c30bf67a-0985-4989-9708-ca1dda5d29a5 · outbound

This paper cites Demaine, J.

Worst-Case Optimal BGPs on Temporal Graphs Demaine, J

Reference 12

Resolution: unresolved; no resolver link, observed 2026-08-01T10:14:42.886930Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c57ec377-e4b1-42e3-a134-5f94e096ae2b · outbound

This paper cites Temporal Knowledge Graph Completion: A Survey.

Worst-Case Optimal BGPs on Temporal Graphs Temporal Knowledge Graph Completion: A Survey

Reference 13

Resolution: unresolved; no resolver link, observed 2026-08-01T10:14:43.047511Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b1fee889-80c3-49bc-8d8f-b6454c314e77 · outbound

This paper cites A Survey on Temporal Knowledge Graph: Representation Learning and Applications.

Worst-Case Optimal BGPs on Temporal Graphs A Survey on Temporal Knowledge Graph: Representation Learning and Applications

Reference 14

Resolution: unresolved; no resolver link, observed 2026-08-01T10:14:43.187548Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 32241c25-aacc-46c4-a9f7-49ee09d8d620 · outbound

This paper cites Indexing temporal relations for range-duration queries.

Worst-Case Optimal BGPs on Temporal Graphs Indexing temporal relations for range-duration queries

Reference 15

Resolution: unresolved; no resolver link, observed 2026-08-01T10:14:43.294116Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ae4825d5-4ac3-45ec-933a-43d2aa9f04c7 · outbound

This paper cites Chan, Kasper G.

Worst-Case Optimal BGPs on Temporal Graphs Chan, Kasper G

Reference 16

Resolution: unresolved; no resolver link, observed 2026-08-01T10:14:43.427184Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2f936bb9-9ed6-4383-83de-86b0eb402cd1 · outbound

This paper cites Clark.Compact PAT Trees.

Worst-Case Optimal BGPs on Temporal Graphs Clark.Compact PAT Trees

Reference 17

Resolution: unresolved; no resolver link, observed 2026-08-01T10:14:43.498386Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 71686e66-789f-462b-a0ca-9bff202411ff · outbound

This paper cites The wavelet matrix: An efficient wavelet tree for large alphabets.Information Systems, 47:15–32, 2015.

Worst-Case Optimal BGPs on Temporal Graphs The wavelet matrix: An efficient wavelet tree for large alphabets.Information Systems, 47:15–32, 2015

Reference 18

Resolution: unresolved; no resolver link, observed 2026-08-01T10:14:43.630742Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation cddb0e19-48f9-400c-bbe8-40d5f704ec48 · outbound

This paper cites On completeness of historical relational data models.

Worst-Case Optimal BGPs on Temporal Graphs On completeness of historical relational data models

Reference 19

Resolution: unresolved; no resolver link, observed 2026-08-01T10:14:43.713306Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 030855f8-0668-46d5-a75c-f8e0a5255108 · outbound

This paper cites Versioned queries over RDF archives: All you need is SPARQL? InMEPDaW@ ISWC, pages 43–52, 2020.

Worst-Case Optimal BGPs on Temporal Graphs Versioned queries over RDF archives: All you need is SPARQL? InMEPDaW@ ISWC, pages 43–52, 2020

Reference 20

Resolution: unresolved; no resolver link, observed 2026-08-01T10:14:43.844295Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f0f35c6c-de00-40d4-8467-8f9330ed3fbe · outbound

This paper cites Temporal alignment.

Worst-Case Optimal BGPs on Temporal Graphs Temporal alignment

Reference 21

Resolution: unresolved; no resolver link, observed 2026-08-01T10:14:43.966056Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4b5710dd-a6f4-425b-a38a-c21685b09842 · outbound

This paper cites A researcher’s digest of GQL.

Worst-Case Optimal BGPs on Temporal Graphs A researcher’s digest of GQL

Reference 22

Resolution: unresolved; no resolver link, observed 2026-08-01T10:14:44.103311Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2b44b0e8-e7f8-4fe2-a3e0-d6ebc8dd13db · outbound

This paper cites Freitag, Maximilian Bandle, Tobias Schmidt, Alfons Kemper, and Thomas Neumann.

Worst-Case Optimal BGPs on Temporal Graphs Freitag, Maximilian Bandle, Tobias Schmidt, Alfons Kemper, and Thomas Neumann

Reference 23

Resolution: unresolved; no resolver link, observed 2026-08-01T10:14:44.213657Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation be6c262d-7f1d-40f2-96c3-9f36ebd58de2 · outbound

This paper cites Time-respecting flow graph pattern matching on temporal graphs.IEEE Trans- actions on Knowledge and Data Engineering, 33(10):3453–3467, 2020.

Worst-Case Optimal BGPs on Temporal Graphs Time-respecting flow graph pattern matching on temporal graphs.IEEE Trans- actions on Knowledge and Data Engineering, 33(10):3453–3467, 2020

Reference 24

Resolution: unresolved; no resolver link, observed 2026-08-01T10:14:44.325233Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4d667a7c-bd6d-4558-be9e-87cc82868931 · outbound

This paper cites Eventkg: A multilingual event-centric temporal knowledge graph.

Worst-Case Optimal BGPs on Temporal Graphs Eventkg: A multilingual event-centric temporal knowledge graph

Reference 25

Resolution: unresolved; no resolver link, observed 2026-08-01T10:14:44.421302Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d5bdec6b-240c-46f8-8667-4c30f7152333 · outbound

This paper cites Multi-temporal RDF ontology versioning.

Worst-Case Optimal BGPs on Temporal Graphs Multi-temporal RDF ontology versioning

Reference 26

Resolution: unresolved; no resolver link, observed 2026-08-01T10:14:44.568050Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation fbca0644-b41e-4fee-9d2e-69cbcb9f531f · outbound

This paper cites T-SPARQL: A TSQL2-like temporal query language for RDF.

Worst-Case Optimal BGPs on Temporal Graphs T-SPARQL: A TSQL2-like temporal query language for RDF

Reference 27

Resolution: unresolved; no resolver link, observed 2026-08-01T10:14:44.684722Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a086511d-e226-44a1-a6bf-f5131e8c5097 · outbound

This paper cites A worst-case optimal join algorithm for SPARQL.

Worst-Case Optimal BGPs on Temporal Graphs A worst-case optimal join algorithm for SPARQL

Reference 28

Resolution: unresolved; no resolver link, observed 2026-08-01T10:14:44.780633Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 12fa1689-b710-4a55-9b1d-de76195ddbcd · outbound

This paper cites An efficient and scalable graph database with built-in temporal support: J.

Worst-Case Optimal BGPs on Temporal Graphs An efficient and scalable graph database with built-in temporal support: J

Reference 29

Resolution: unresolved; no resolver link, observed 2026-08-01T10:14:44.916702Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 21cf3105-2e17-4f06-aaf7-c38de4c107d0 · outbound

This paper cites Agarwal, and Jun Yang.

Worst-Case Optimal BGPs on Temporal Graphs Agarwal, and Jun Yang

Reference 30

Resolution: unresolved; no resolver link, observed 2026-08-01T10:14:45.010464Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation cad5983b-1438-4f01-b6f8-f24217d798cc · outbound

This paper cites TeMatch: A fast temporal sub- graph matching framework with temporal-aware subgraph matching algorithms.

Worst-Case Optimal BGPs on Temporal Graphs TeMatch: A fast temporal sub- graph matching framework with temporal-aware subgraph matching algorithms

Reference 31

Resolution: unresolved; no resolver link, observed 2026-08-01T10:14:45.116343Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7318ee12-f1ed-4d4c-a777-9f0318f0d783 · outbound

This paper cites Space-efficient static trees and graphs.

Worst-Case Optimal BGPs on Temporal Graphs Space-efficient static trees and graphs

Reference 32

Resolution: unresolved; no resolver link, observed 2026-08-01T10:14:45.219732Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 720467af-19fd-4455-829e-f6d14be9e01e · outbound

This paper cites Khamis, Hung Q.

Worst-Case Optimal BGPs on Temporal Graphs Khamis, Hung Q

Reference 33

Resolution: unresolved; no resolver link, observed 2026-08-01T10:14:45.314319Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 49ffc2dd-c017-4146-9f49-c32d95a27c79 · outbound

This paper cites Storing and analyzing historical graph data at scale.

Worst-Case Optimal BGPs on Temporal Graphs Storing and analyzing historical graph data at scale

Reference 34

Resolution: unresolved; no resolver link, observed 2026-08-01T10:14:45.471551Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 306242f0-fa28-4e21-9b31-ce6734b22f39 · outbound

This paper cites Modeling and querying metadata in the semantic sensor web: The model stRDF and the query language stSPARQL.

Worst-Case Optimal BGPs on Temporal Graphs Modeling and querying metadata in the semantic sensor web: The model stRDF and the query language stSPARQL

Reference 35

Resolution: unresolved; no resolver link, observed 2026-08-01T10:14:45.641665Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5c53992d-1494-4575-afd8-b2ab81103950 · outbound

This paper cites Managing intervals effi- ciently in object-relational databases.

Worst-Case Optimal BGPs on Temporal Graphs Managing intervals effi- ciently in object-relational databases

Reference 36

Resolution: unresolved; no resolver link, observed 2026-08-01T10:14:45.803149Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e1687a31-b4e7-4bb5-aa62-1fb460e78401 · outbound

This paper cites Temporal features in SQL: 2011.ACM Sigmod Record, 41(3):34–43, 2012.

Worst-Case Optimal BGPs on Temporal Graphs Temporal features in SQL: 2011.ACM Sigmod Record, 41(3):34–43, 2012

Reference 37

Resolution: unresolved; no resolver link, observed 2026-08-01T10:14:45.919965Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9eb73680-c32d-4758-a0d0-56cb23b69797 · outbound

This paper cites Durable subgraph matching on tem- poral graphs.IEEE Transactions on Knowledge and Data Engineering, 35(5):4713– 4726, 2022.

Worst-Case Optimal BGPs on Temporal Graphs Durable subgraph matching on tem- poral graphs.IEEE Transactions on Knowledge and Data Engineering, 35(5):4713– 4726, 2022

Reference 38

Resolution: unresolved; no resolver link, observed 2026-08-01T10:14:46.086701Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7afd9ad2-e25a-4857-a0c6-4825dc13e521 · outbound

This paper cites Temporal multi-query subgraph matching in cybersecurity.Technologies, 13(8):335, 2025.

Worst-Case Optimal BGPs on Temporal Graphs Temporal multi-query subgraph matching in cybersecurity.Technologies, 13(8):335, 2025

Reference 39

Resolution: unresolved; no resolver link, observed 2026-08-01T10:14:46.198184Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b74bec9e-8a25-48d7-a7f4-ab25402db55b · outbound

This paper cites Getting the most out of Wikidata: Semantic technology usage in Wikipedia’s knowledge graph.

Worst-Case Optimal BGPs on Temporal Graphs Getting the most out of Wikidata: Semantic technology usage in Wikipedia’s knowledge graph

Reference 40

Resolution: unresolved; no resolver link, observed 2026-08-01T10:14:46.325085Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a075bfd3-7312-4462-830e-0ce0a9246d15 · outbound

This paper cites Optimizing subgraph queries by combin- ing binary and worst-case optimal joins.Proceedings of the VLDB Endowment, 12(11):1692–1704, 2019.

Worst-Case Optimal BGPs on Temporal Graphs Optimizing subgraph queries by combin- ing binary and worst-case optimal joins.Proceedings of the VLDB Endowment, 12(11):1692–1704, 2019

Reference 41

Resolution: unresolved; no resolver link, observed 2026-08-01T10:14:46.420762Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8a5122ed-da92-4849-b9a3-2111f2294408 · outbound

This paper cites Temporal graph algebra.

Worst-Case Optimal BGPs on Temporal Graphs Temporal graph algebra

Reference 42

Resolution: unresolved; no resolver link, observed 2026-08-01T10:14:46.535395Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1a528242-ecc8-4fb9-a18f-c257f84e8b18 · outbound

This paper cites Ian Munro.

Worst-Case Optimal BGPs on Temporal Graphs Ian Munro

Reference 43

Resolution: unresolved; no resolver link, observed 2026-08-01T10:14:46.647046Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7cb5682a-f99a-4199-bbac-59e3b8513dce · outbound

This paper cites an unresolved cited work.

Worst-Case Optimal BGPs on Temporal Graphs Unresolved cited work

Reference 44

Resolution: unresolved; no resolver link, observed 2026-08-01T10:14:46.788893Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 90125516-fe83-43c3-b23e-5c8da6a78156 · outbound

This paper cites Ngo, Ely Porat, Cristopher Ré, and Atri Rudra.

Worst-Case Optimal BGPs on Temporal Graphs Ngo, Ely Porat, Cristopher Ré, and Atri Rudra

Reference 45

Resolution: unresolved; no resolver link, observed 2026-08-01T10:14:46.904648Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 87db4c0d-3469-4002-bf33-a86aa5f7aa4c · outbound

This paper cites Motifs in temporal networks.

Worst-Case Optimal BGPs on Temporal Graphs Motifs in temporal networks

Reference 46

Resolution: unresolved; no resolver link, observed 2026-08-01T10:14:47.045581Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 63823115-c7df-4f41-b7d2-691f9dff5692 · outbound

This paper cites GLENDA: Querying RDF archives with full SPARQL.

Worst-Case Optimal BGPs on Temporal Graphs GLENDA: Querying RDF archives with full SPARQL

Reference 47

Resolution: unresolved; no resolver link, observed 2026-08-01T10:14:47.157365Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8da177ba-9b86-4b05-a283-2b203f770df4 · outbound

This paper cites SPARQL-st: Extending SPARQL to support spatiotemporal queries.

Worst-Case Optimal BGPs on Temporal Graphs SPARQL-st: Extending SPARQL to support spatiotemporal queries

Reference 48

Resolution: unresolved; no resolver link, observed 2026-08-01T10:14:47.321496Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8d8f0b83-17c2-4884-a0eb-2cf8b48e4089 · outbound

This paper cites Top-𝑘 durable graph pattern queries on temporal graphs.IEEE Transactions on Knowledge and Data Engineer- ing, 31(1):181–194, 2018.

Worst-Case Optimal BGPs on Temporal Graphs Top-𝑘 durable graph pattern queries on temporal graphs.IEEE Transactions on Knowledge and Data Engineer- ing, 31(1):181–194, 2018

Reference 49

Resolution: unresolved; no resolver link, observed 2026-08-01T10:14:47.465964Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 57c5b4ec-7a72-48b1-a28b-b5e5c4c47583 · outbound

This paper cites The temporal query language TQuel.ACM Transactions on Database Systems, 12(2):247–298, 1987.

Worst-Case Optimal BGPs on Temporal Graphs The temporal query language TQuel.ACM Transactions on Database Systems, 12(2):247–298, 1987

Reference 50

Resolution: unresolved; no resolver link, observed 2026-08-01T10:14:47.613897Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d0045c07-bbe6-4082-abc8-aa790d8b6562 · outbound

This paper cites Veldhuizen.

Worst-Case Optimal BGPs on Temporal Graphs Veldhuizen

Reference 51

Resolution: unresolved; no resolver link, observed 2026-08-01T10:14:47.735549Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 60691047-4a07-4815-a258-e44dd3bd8368 · outbound

This paper cites Wikidata: a free collaborative knowl- edgebase.Commun.

Worst-Case Optimal BGPs on Temporal Graphs Wikidata: a free collaborative knowl- edgebase.Commun

Reference 52

Resolution: unresolved; no resolver link, observed 2026-08-01T10:14:47.846410Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 13600ad3-400d-430d-8327-d86a54f47fa8 · outbound

This paper cites ADOPT: Adaptively optimizing attribute orders for worst-case optimal join algorithms 13 via reinforcement learning.Proceedings of the VLDB Endowment, 16(11):2805– 2817, 2023.

Worst-Case Optimal BGPs on Temporal Graphs ADOPT: Adaptively optimizing attribute orders for worst-case optimal join algorithms 13 via reinforcement learning.Proceedings of the VLDB Endowment, 16(11):2805– 2817, 2023

Reference 53

Resolution: unresolved; no resolver link, observed 2026-08-01T10:14:47.975637Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d4f553eb-d62f-44b3-8fba-e45f7e5d9d75 · outbound

This paper cites Free Join: Unifying worst-case optimal and traditional joins.Proceedings of the ACM on Management of Data (SIGMOD), 1(2):150:1–150:23, 2023.

Worst-Case Optimal BGPs on Temporal Graphs Free Join: Unifying worst-case optimal and traditional joins.Proceedings of the ACM on Management of Data (SIGMOD), 1(2):150:1–150:23, 2023

Reference 54

Resolution: unresolved; no resolver link, observed 2026-08-01T10:14:48.140073Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f90ecf76-152a-4e30-a8cd-cd00aaefe357 · outbound

This paper cites Path problems in temporal graphs.Proceedings of the VLDB Endowment, 7(9):721–732, 2014.

Worst-Case Optimal BGPs on Temporal Graphs Path problems in temporal graphs.Proceedings of the VLDB Endowment, 7(9):721–732, 2014

Reference 55

Resolution: unresolved; no resolver link, observed 2026-08-01T10:14:48.266795Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 938bb174-db4b-4014-9f9d-2037d6edb41f · outbound

This paper cites Algorithms for acyclic database schemes.

Worst-Case Optimal BGPs on Temporal Graphs Algorithms for acyclic database schemes

Reference 56

Resolution: unresolved; no resolver link, observed 2026-08-01T10:14:48.401199Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 08c47db3-fe2b-48c2-ab92-10381a186293 · outbound

This paper cites join-first.

Worst-Case Optimal BGPs on Temporal Graphs join-first

Reference 57

Resolution: unresolved; no resolver link, observed 2026-08-01T10:14:48.573532Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Coverage vector

Reference resolution

Outbound references

Pith citing papers