On the public citation graph
Tree decomposition-based indexing for efficient shortest path and nearest neighbors query answering on graphs
0 signed · 60 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/11851561_25openalex-snapshot
Rapid ab initio RNA Folding Including Pseudoknots Via Graph Tree Decomposition
inferredcites →https://doi.org/10.1007/978-3-540-69507-3_6openalex-snapshot
Point-to-Point Shortest Path Algorithms with Preprocessing
inferredcites →https://doi.org/10.1007/978-3-642-20662-7_20openalex-snapshot
A Hub-Based Labeling Algorithm for Shortest Paths in Road Networks
inferredcites →https://doi.org/10.1007/bf01386390openalex-snapshot
A note on two problems in connexion with graphs
inferredcites →https://doi.org/10.1016/0095-8956(84)90013-3openalex-snapshot
Graph minors. III. Planar tree-width
inferredcites →https://doi.org/10.1016/b978-012722442-8/50076-8openalex-snapshot
Query Processing in Spatial Network Databases
inferredcites →https://doi.org/10.1016/j.artint.2005.04.004openalex-snapshot
Unifying tree decompositions for reasoning in graphical models
inferredcites →https://doi.org/10.1109/69.687976openalex-snapshot
Hierarchical encoded path views for path query processing: an optimal model and its performance evaluation
inferredcites →https://doi.org/10.1109/csb.2005.52openalex-snapshot
Tree decomposition based fast search of RNA structures including pseudoknots in genomes
inferredcites →https://doi.org/10.1109/icde.2005.57openalex-snapshot
Efficient Creation and Incremental Maintenance of the HOPI Index for Complex XML Document Collections
inferredcites →https://doi.org/10.1109/icde.2006.53openalex-snapshot
Dual Labeling: Answering Graph Reachability Queries in Constant Time
inferredcites →https://doi.org/10.1109/icde.2009.119openalex-snapshot
Top-k Exploration of Query Candidates for Efficient Keyword Search on Graph-Shaped (RDF) Data
inferredcites →https://doi.org/10.1126/science.286.5439.509openalex-snapshot
Emergence of Scaling in Random Networks
inferredcites →https://doi.org/10.1137/0608024openalex-snapshot
Complexity of Finding Embeddings in a k -Tree
inferredcites →https://doi.org/10.1137/s0097539702403098openalex-snapshot
Reachability and Distance Queries via 2-Hop Labels
inferredcites →https://doi.org/10.1145/102782.102788openalex-snapshot
Planar graph decomposition and all pairs shortest paths
inferredcites →https://doi.org/10.1145/1142351.1142370openalex-snapshot
Tractable database design through bounded treewidth
inferredcites →https://doi.org/10.1145/1247480.1247573openalex-snapshot
Fast and practical indexing and querying of very large graphs
inferredcites →https://doi.org/10.1145/1376616.1376623openalex-snapshot
Scalable network distance browsing in spatial databases
inferredcites →https://doi.org/10.1145/1376616.1376677openalex-snapshot
Efficiently answering reachability queries on very large directed graphs
inferredcites →https://doi.org/10.1145/1516360.1516418openalex-snapshot
Efficiently indexing shortest paths by exploiting symmetry in graphs
inferredcites →https://doi.org/10.1145/1807167openalex-snapshot
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
inferredcites →https://doi.org/10.1145/1951365openalex-snapshot
Proceedings of the 14th International Conference on Extending Database Technology
inferredcites →https://doi.org/10.1145/2213836openalex-snapshot
Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
inferredcites →https://doi.org/10.1145/2213836.2213887openalex-snapshot
A highway-centric labeling approach for answering distance queries on large sparse graphs
inferredcites →https://doi.org/10.1145/2247596.2247614openalex-snapshot
Shortest-path queries for complex networks
inferredcites →https://doi.org/10.1145/2320765openalex-snapshot
Proceedings of the 2012 Joint EDBT/ICDT Workshops
inferredcites →https://doi.org/10.1145/2424321openalex-snapshot
Proceedings of the 20th International Conference on Advances in Geographic Information Systems
inferredcites →https://doi.org/10.1145/2457317.2457355openalex-snapshot
Finding nearest neighbors in road networks
inferredcites →https://doi.org/10.1145/2463676.2465315openalex-snapshot
Fast exact shortest-path distance queries on large networks by pruned landmark labeling
inferredcites →https://doi.org/10.1145/2530531openalex-snapshot
Shortest-path queries in static networks
inferredcites →https://doi.org/10.1145/585147openalex-snapshot
Proceedings of the 10th ACM international symposium on Advances in geographic information systems
inferredcites →https://doi.org/10.1145/66926.66950openalex-snapshot
Efficient management of transitive relationships in large data and knowledge bases
inferredcites →https://doi.org/10.1145/956676.956677openalex-snapshot
Nearest neighbor queries in road networks
inferredcites →https://doi.org/10.1145/956676.956678openalex-snapshot
Processing in-route nearest neighbor queries
inferredcites →https://doi.org/10.1287/trsc.32.1.65openalex-snapshot
Shortest Path Algorithms: An Evaluation Using Real Road Networks
inferredcites →https://doi.org/10.14778/2732977.2732993openalex-snapshot
Hop doubling label indexing for point-to-point distance querying on scale-free networks
inferredcites →https://doi.org/10.5555/1036843.1036868openalex-snapshot
A complete anytime algorithm for treewidth
inferredcites →https://doi.org/10.5555/1070432.1070455openalex-snapshot
Computing the shortest path: A search meets graph theory
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-030-62005-9_17openalex-snapshot
A Hybrid Index for Distance Queries
inferred← citeshttps://doi.org/10.1007/978-3-031-47843-7_23openalex-snapshot
An Experimental Evaluation of Two Methods on Shortest Distance Queries over Small-World Graphs
inferred← citeshttps://doi.org/10.1007/s10586-018-2426-2openalex-snapshot
On-line modeling and monitoring for multi-operation batch processes with infinite data types
inferred← citeshttps://doi.org/10.1016/j.inffus.2017.02.009openalex-snapshot
BFSI-B: An improved K-hop graph reachability queries for cyber-physical systems
inferred← citeshttps://doi.org/10.1016/j.jcss.2015.09.001openalex-snapshot
Journal of Computer and System Sciences Special Issue on Query Answering on Graph-Structured Data
inferred← citeshttps://doi.org/10.1016/j.tcs.2023.114251openalex-snapshot
Space efficient algorithm for solving reachability using tree decomposition and separators
inferred← citeshttps://doi.org/10.1109/ccis.2018.8691206openalex-snapshot
Research on Optimizing Strategy of Database-oriented GIS Graph database Query
inferred← citeshttps://doi.org/10.1109/icnp.2016.7784419openalex-snapshot
Fast shortest-path queries on large-scale graphs
inferred← citeshttps://doi.org/10.1145/3769806openalex-snapshot
MAVIS: Materialized View for Subgraph Matching
inferred← citeshttps://doi.org/10.1145/3774904.3792534openalex-snapshot
Kleene Closure Property Path Query Optimization Based on Node Clustered Index
inferred← citeshttps://doi.org/10.14710/jwl.10.1.55-68openalex-snapshot
Optimasi Rute Pengangkutan Sampah dengan Menggunakan Metode Nearest Neighbour (Studi Kasus: Kabupaten Manokwari, Papua Barat)
inferred← citeshttps://doi.org/10.14778/3681954.3682008openalex-snapshot
DynaHB: A Communication-Avoiding Asynchronous Distributed Framework with Hybrid Batches for Dynamic GNN Training
inferred← citeshttps://doi.org/10.14778/3681954.3682009openalex-snapshot
Efficient k NN Search in Public Transportation Networks
inferred← citeshttps://doi.org/10.17485/ijst/2016/v9i39/92774openalex-snapshot
Research Directions on GIS Database Design and Management
inferred← citeshttps://doi.org/10.31449/inf.v43i1.2679openalex-snapshot
Incremental 2-D Nearest-Point Search with Evenly Populated Strips
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.