On the public citation graph
Regime Structure in Tree Search: Theory and Experimental Cross-Domain Behavioural Analysis
0 signed · 24 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.1016/0004-3702(75)90019-3openalex-snapshot
An analysis of alpha-beta pruning
inferredcites →https://doi.org/10.1016/0004-3702(85)90084-0openalex-snapshot
Depth-first iterative-deepening
inferredcites →https://doi.org/10.1016/0004-3702(93)90045-dopenalex-snapshot
Linear-space best-first search
inferredcites →https://doi.org/10.1016/j.artint.2011.08.001openalex-snapshot
Learning heuristic functions for large state spaces
inferredcites →https://doi.org/10.1016/j.artint.2012.11.006openalex-snapshot
The increasing cost tree search for optimal multi-agent pathfinding
inferredcites →https://doi.org/10.1016/j.artint.2014.11.006openalex-snapshot
Conflict-based search for optimal multi-agent pathfinding
inferredcites →https://doi.org/10.1038/nature16961openalex-snapshot
Mastering the game of Go with deep neural networks and tree search
inferredcites →https://doi.org/10.1038/s41586-020-03051-4openalex-snapshot
Mastering Atari, Go, chess and shogi by planning with a learned model
inferredcites →https://doi.org/10.1109/4235.585893openalex-snapshot
No free lunch theorems for optimization
inferredcites →https://doi.org/10.1109/lra.2021.3062803openalex-snapshot
PRIMAL$_2$: Pathfinding Via Reinforcement and Imitation Multi-Agent Learning - Lifelong
inferredcites →https://doi.org/10.1109/tssc.1968.300136openalex-snapshot
A Formal Basis for the Heuristic Determination of Minimum Cost Paths
inferredcites →https://doi.org/10.1145/3828.3830openalex-snapshot
Generalized best-first search strategies and the optimality of A*
inferredcites →https://doi.org/10.1609/aaai.v30i1.10436openalex-snapshot
Bidirectional Search That Is Guaranteed to Meet in the Middle
inferredcites →https://doi.org/10.1609/aaai.v36i9.21266openalex-snapshot
MAPF-LNS2: Fast Repairing for Multi-Agent Path Finding via Large Neighborhood Search
inferredcites →https://doi.org/10.1609/aaai.v37i10.26377openalex-snapshot
LaCAM: Search-Based Algorithm for Quick Multi-Agent Pathfinding
inferredcites →https://doi.org/10.1609/socs.v10i1.18510openalex-snapshot
Multi-Agent Pathfinding: Definitions, Variants, and Benchmarks
inferredcites →https://doi.org/10.1609/socs.v1i1.18160openalex-snapshot
Common Misconceptions Concerning Heuristic Search
inferredcites →https://doi.org/10.1609/socs.v6i1.18364openalex-snapshot
The Grid-Based Path Planning Competition: 2014 Entries and Results
inferredcites →https://doi.org/10.1613/jair.1480openalex-snapshot
Additive Pattern Database Heuristics
inferredcites →https://doi.org/10.9734/ajrcos/2025/v18i11778openalex-snapshot
ACBS: A Bounded-Suboptimal Multi-Agent Path Finding Solver for Search-Based Problems
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.