On the public citation graph
Bi-Directional and Heuristic Search in Path Problems [Thesis]
0 signed · 120 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 points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/mma.7090openalex-snapshot
District metered area design through multicriteria and multiobjective optimization
inferred← citeshttps://doi.org/10.1002/net.21960openalex-snapshot
An exact bidirectional pulse algorithm for the constrained shortest path
inferred← citeshttps://doi.org/10.1007/3-540-07623-9_283openalex-snapshot
An integrated theory of problems as an algebraic base for complexity understanding and automatic problem solving
inferred← citeshttps://doi.org/10.1007/3-540-36224-x_2openalex-snapshot
From Dynamic Programming to RRTs: Algorithmic Design of Feasible Trajectories
inferred← citeshttps://doi.org/10.1007/978-3-030-22871-2_3openalex-snapshot
Fast Replanning Incremental Shortest Path Algorithm for Dynamic Transportation Networks
inferred← citeshttps://doi.org/10.1007/978-3-030-34080-3_83openalex-snapshot
Robot Operating System Based Path Planning
inferred← citeshttps://doi.org/10.1007/978-3-030-39469-1_3openalex-snapshot
Efficient kNN Search with Occupation in Large-Scale On-demand Ride-Hailing
inferred← citeshttps://doi.org/10.1007/978-3-030-64834-3_14openalex-snapshot
Cryptographic Group Actions and Applications
inferred← citeshttps://doi.org/10.1007/978-3-032-06732-6_22openalex-snapshot
Clustering Applications in Water Distribution Networks—A Review
inferred← citeshttps://doi.org/10.1007/978-3-319-49487-6_2openalex-snapshot
Route Planning in Transportation Networks
inferred← citeshttps://doi.org/10.1007/978-3-540-24838-5_20openalex-snapshot
Combining Speed-Up Techniques for Shortest-Path Computations
inferred← citeshttps://doi.org/10.1007/978-3-540-40031-8_23openalex-snapshot
Perimeter Search Performance
inferred← citeshttps://doi.org/10.1007/978-3-540-70918-3_3openalex-snapshot
Speed-Up Techniques for Shortest-Path Computations
inferred← citeshttps://doi.org/10.1007/978-3-642-04128-0_52openalex-snapshot
Counting Paths and Packings in Halves
inferred← citeshttps://doi.org/10.1007/978-3-642-21004-4_2openalex-snapshot
Problem Solving by Search
inferred← citeshttps://doi.org/10.1007/978-3-642-21004-4_3openalex-snapshot
Informed (Heuristic) Search
inferred← citeshttps://doi.org/10.1007/978-3-642-23719-5_38openalex-snapshot
Scope-Based Route Planning
inferred← citeshttps://doi.org/10.1007/978-3-642-25929-6_15openalex-snapshot
Generalized Maneuvers in Route Planning
inferred← citeshttps://doi.org/10.1007/978-3-642-46745-5_13openalex-snapshot
Ein Expertensystem zur Auftragsreihenfolgeplanung für eine roboterisierte Packstraße in der Lebensmittelindustrie
inferred← citeshttps://doi.org/10.1007/978-3-7091-8389-2_2openalex-snapshot
Vorbemerkungen zu einer Theorie der Effizienz von Beweisverfahren
inferred← citeshttps://doi.org/10.1007/978-3-7091-8389-2_5openalex-snapshot
Heuristische Suche: Konzepte und Methoden
inferred← citeshttps://doi.org/10.1007/bf00977413openalex-snapshot
A procedure to determine intersections between polyhedral objects
inferred← citeshttps://doi.org/10.1007/bf00987151openalex-snapshot
An approximation method for solving the sofa problem
inferred← citeshttps://doi.org/10.1007/bf01299142openalex-snapshot
The one-to-one shortest-path problem: An empirical analysis with the two-tree Dijkstra algorithm
inferred← citeshttps://doi.org/10.1007/bf01932817openalex-snapshot
On a programming language for graph algorithms
inferred← citeshttps://doi.org/10.1007/s00200-013-0185-0openalex-snapshot
Improved algorithm for the isogeny problem for ordinary elliptic curves
inferred← citeshttps://doi.org/10.1007/s00224-019-09928-wopenalex-snapshot
Optimal Path Discovery Problem with Homogeneous Knowledge
inferred← citeshttps://doi.org/10.1007/s10589-021-00303-5openalex-snapshot
Two new bidirectional search algorithms
inferred← citeshttps://doi.org/10.1007/s10618-015-0423-0openalex-snapshot
Fast approximation of betweenness centrality through sampling
inferred← citeshttps://doi.org/10.1007/s10623-014-0010-1openalex-snapshot
Computing isogenies between supersingular elliptic curves over $${\mathbb {F}}_p$$ F p
inferred← citeshttps://doi.org/10.1007/s10846-021-01508-wopenalex-snapshot
Shape-Aware and G2 Continuous Path Planning Based on Bidirectional Hybrid A∗ for Car-Like Vehicles
inferred← citeshttps://doi.org/10.1007/s11128-018-2023-6openalex-snapshot
Computational problems in supersingular elliptic curve isogenies
inferred← citeshttps://doi.org/10.1016/0004-3702(70)90009-3openalex-snapshot
Heuristically guided search and chromosome matching
inferred← citeshttps://doi.org/10.1016/0004-3702(83)90002-4openalex-snapshot
A new basis for state-space learning systems and a successful implementation
inferred← citeshttps://doi.org/10.1016/0004-3702(89)90069-6openalex-snapshot
BS∗: An admissible bidirectional staged heuristic search algorithm
inferred← citeshttps://doi.org/10.1016/0020-0190(71)90005-6openalex-snapshot
An n2 algorithm for determining the bridges of a graph
inferred← citeshttps://doi.org/10.1016/0169-023x(90)90010-bopenalex-snapshot
Satisficing in knowledge-based systems
inferred← citeshttps://doi.org/10.1016/j.artint.2016.10.001openalex-snapshot
Efficient symbolic search for cost-optimal planning
inferred← citeshttps://doi.org/10.1016/j.artint.2017.05.004openalex-snapshot
MM: A bidirectional search algorithm that is guaranteed to meet in the middle
inferred← citeshttps://doi.org/10.1016/j.ejor.2017.04.058openalex-snapshot
A double oracle approach to minmax regret optimization problems with interval data
inferred← citeshttps://doi.org/10.1016/j.envsoft.2011.01.006openalex-snapshot
Topological clustering for water distribution systems analysis
inferred← citeshttps://doi.org/10.1016/j.jbi.2019.103141openalex-snapshot
A survey on literature based discovery approaches in biomedical domain
inferred← citeshttps://doi.org/10.1016/j.proeng.2014.02.006openalex-snapshot
A Procedure for the Design of District Metered Areas in Water Distribution Systems
inferred← citeshttps://doi.org/10.1016/j.proeng.2014.11.248openalex-snapshot
Simplification of Water Distribution Network Simulation by Topological Clustering – Investigation of its Potential Use in Copenhagen's Water Supply Monitoring and Contamination Contingency Plans
inferred← citeshttps://doi.org/10.1016/s0020-7373(72)80040-3openalex-snapshot
Descriptions and plans in an interactive robot simulation system
inferred← citeshttps://doi.org/10.1021/acs.est.5b03331openalex-snapshot
Flexible Reconfiguration of Existing Urban Water Infrastructure Systems
inferred← citeshttps://doi.org/10.1049/cit2.12102openalex-snapshot
A dynamic bidirectional heuristic trust path search algorithm
inferred← citeshttps://doi.org/10.1049/el:19890257openalex-snapshot
Hardware rip-up router with concurrent wavefront propagation
inferred← citeshttps://doi.org/10.1061/(asce)wr.1943-5452.0000173openalex-snapshot
Water-Distribution Systems Simplifications through Clustering
inferred← citeshttps://doi.org/10.1061/(asce)wr.1943-5452.0000288openalex-snapshot
Bayesian Networks for Source Intrusion Detection
inferred← citeshttps://doi.org/10.1061/(asce)wr.1943-5452.0000364openalex-snapshot
Water Network Sectorization Based on Graph Theory and Energy Performance Indices
inferred← citeshttps://doi.org/10.1061/(asce)wr.1943-5452.0000424openalex-snapshot
Graph-Theoretic Approach and Sound Engineering Principles for Design of District Metered Areas
inferred← citeshttps://doi.org/10.1061/(asce)wr.1943-5452.0000639openalex-snapshot
Elementary DMA Design of Looped Water Distribution Networks with Multiple Sources
inferred← citeshttps://doi.org/10.1061/(asce)wr.1943-5452.0001465openalex-snapshot
Optimized DMA Partition to Reduce Background Leakage Rate in Water Distribution Networks
inferred← citeshttps://doi.org/10.1109/92.250195openalex-snapshot
General gate array routing using a k-terminal net routing algorithm with failure prediction
inferred← citeshttps://doi.org/10.1109/asiancon55314.2022.9909251openalex-snapshot
Path-finding and Planning in a 3D Environment An Analysis Using Bidirectional Versions of Dijkstra’s, Weighted A*, and Greedy Best First Search Algorithms
inferred← citeshttps://doi.org/10.1109/cdc42340.2020.9303909openalex-snapshot
Lasso formulation of the shortest path problem
inferred← citeshttps://doi.org/10.1109/csaiee54046.2021.9543111openalex-snapshot
Comparison of Strategies for Optimizing Bi-RRT* on Mobile Robots
inferred← citeshttps://doi.org/10.1109/hicss.1989.49174openalex-snapshot
A satisficing knowledge-based system
inferred← citeshttps://doi.org/10.1109/hicss.1989.49290openalex-snapshot
A relational algebra for assertion management
inferred← citeshttps://doi.org/10.1109/ic-etite58242.2024.10493326openalex-snapshot
The Quest for Efficient Search Algorithms: Uninformed vs Informed Approaches
inferred← citeshttps://doi.org/10.1109/icmae70752.2026.11709043openalex-snapshot
A Deterministic Dual Mode Path Planner for Robust Navigation
inferred← citeshttps://doi.org/10.1109/icra.2016.7487437openalex-snapshot
A*-Connect: Bounded suboptimal bidirectional heuristic search
inferred← citeshttps://doi.org/10.1109/icvd.1993.669644openalex-snapshot
A Multiple Terminal Net Routing Algorithm using Failure Prediction
inferred← citeshttps://doi.org/10.1109/icves.2019.8906306openalex-snapshot
Advanced Mapping and Localization for Autonomous Vehicles using OSM
inferred← citeshttps://doi.org/10.1109/innovations.2018.8606025openalex-snapshot
Dynamic Area Search with Shared Memory: A Meta-Framework to Improve Pathfinding Algorithms
inferred← citeshttps://doi.org/10.1109/iros.2015.7353652openalex-snapshot
An asymptotically-optimal sampling-based algorithm for Bi-directional motion planning
inferred← citeshttps://doi.org/10.1109/iros40897.2019.8967796openalex-snapshot
Bidirectional Heuristic Search for Motion Planning with an Extend Operator
inferred← citeshttps://doi.org/10.1109/lra.2018.2800116openalex-snapshot
Efficient, High-Quality Stack Rearrangement
inferred← citeshttps://doi.org/10.1109/mdm.2016.45openalex-snapshot
ParDiSP: A Partition-Based Framework for Distance and Shortest Path Queries on Road Networks
inferred← citeshttps://doi.org/10.1109/smc.2018.00567openalex-snapshot
Memory-Restricted Routing with Tiled Map Data
inferred← citeshttps://doi.org/10.1109/t-c.1971.223083openalex-snapshot
Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters
inferred← citeshttps://doi.org/10.1109/t-c.1974.224054openalex-snapshot
The Lee Path Connection Algorithm
inferred← citeshttps://doi.org/10.1109/tits.2022.3207499openalex-snapshot
An Efficient Algorithm for Maximum Trajectory Coverage Query With Approximation Guarantee
inferred← citeshttps://doi.org/10.1109/tits.2024.3510532openalex-snapshot
Efficient Algorithms for Approximate k -Radius Coverage Query on Large-Scale Road Networks
inferred← citeshttps://doi.org/10.1109/tkde.2019.2942585openalex-snapshot
GLAD: A Grid and Labeling Framework with Scheduling for Conflict-Aware NN Queries
inferred← citeshttps://doi.org/10.1145/1064546.1180616openalex-snapshot
Combining speed-up techniques for shortest-path computations
inferred← citeshttps://doi.org/10.1145/2525314.2525342openalex-snapshot
Parameterized algorithms for generalized traveling salesman problems in road networks
inferred← citeshttps://doi.org/10.1145/2556195.2556224openalex-snapshot
Fast approximation of betweenness centrality through sampling
inferred← citeshttps://doi.org/10.1145/322003.322004openalex-snapshot
An Improved Bidirectional Heuristic Search Algorithm
inferred← citeshttps://doi.org/10.1145/322917.322919openalex-snapshot
Analysis of heurisitc search models
inferred← citeshttps://doi.org/10.1145/324634.325438openalex-snapshot
A technique for comparing search algorithm run-times
inferred← citeshttps://doi.org/10.1145/3284359openalex-snapshot
KADABRA is an ADaptive Algorithm for Betweenness via Random Approximation
inferred← citeshttps://doi.org/10.1145/3468791.3468844openalex-snapshot
Online Landmark-Based Batch Processing of Shortest Path Queries
inferred← citeshttps://doi.org/10.1145/3694906.3743311openalex-snapshot
Parallel Point-to-Point Shortest Paths and Batch Queries
inferred← citeshttps://doi.org/10.1145/3701551.3703512openalex-snapshot
A Sublinear Algorithm for Approximate Shortest Paths in Large Networks
inferred← citeshttps://doi.org/10.1145/51909.51939openalex-snapshot
An application of heuristic search techniques to the problem of flight path generation in a military hostile environment
inferred← citeshttps://doi.org/10.1177/02783640122067453openalex-snapshot
Randomized Kinodynamic Planning
inferred← citeshttps://doi.org/10.1177/02783649211069572openalex-snapshot
Adaptively Informed Trees (AIT*) and Effort Informed Trees (EIT*): Asymmetric bidirectional sampling-based path planning
inferred← citeshttps://doi.org/10.1186/2193-1801-2-291openalex-snapshot
Algorithm for shortest path search in Geographic Information Systems by using reduced graphs
inferred← citeshttps://doi.org/10.1186/s13326-015-0021-5openalex-snapshot
Discovering relations between indirectly connected biomedical concepts
inferred← citeshttps://doi.org/10.1609/aaai.v25i1.7829openalex-snapshot
Optimal Graph Search with Iterated Graph Cuts
inferred← citeshttps://doi.org/10.1609/aaai.v30i1.10436openalex-snapshot
Bidirectional Search That Is Guaranteed to Meet in the Middle
inferred← citeshttps://doi.org/10.1609/aaai.v32i1.12218openalex-snapshot
A Brief History and Recent Achievements in Bidirectional Search
inferred← citeshttps://doi.org/10.1609/aaai.v34i03.5611openalex-snapshot
A Unifying View on Individual Bounds and Heuristic Inaccuracies in Bidirectional Search
inferred← citeshttps://doi.org/10.1609/icaps.v31i1.15950openalex-snapshot
S*: A Heuristic Information-Based Approximation Framework for Multi-Goal Path Finding
inferred← citeshttps://doi.org/10.1609/socs.v1i1.18160openalex-snapshot
Common Misconceptions Concerning Heuristic Search
inferred← citeshttps://doi.org/10.2166/hydro.2015.144openalex-snapshot
Water distribution network sectorisation using graph theory and many-objective optimisation
inferred← citeshttps://doi.org/10.2200/s00618ed1v01y201412tcs001openalex-snapshot
The Shortest-Path Problem: Analysis and Comparison of Methods
inferred← citeshttps://doi.org/10.2495/wrm210111openalex-snapshot
GRAPH THEORY AND COMMUNITY DETECTION FOR ELEMENTARY DMA DESIGN
inferred← citeshttps://doi.org/10.33448/rsd-v10i12.20330openalex-snapshot
Setorização em redes de distribuição de água: uma revisão bibliográfica sistemática
inferred← citeshttps://doi.org/10.3390/futuretransp6040134openalex-snapshot
Optimized Customizable Route Planning in Large Road Networks with Batch Processing
inferred← citeshttps://doi.org/10.3390/ijgi2040996openalex-snapshot
Using the Hierarchical Pathfinding A* Algorithm in GIS to Find Paths through Rasters with Nonuniform Traversal Cost
inferred← citeshttps://doi.org/10.3390/math11061455openalex-snapshot
Autonomous Navigation System of Indoor Mobile Robots Using 2D Lidar
inferred← citeshttps://doi.org/10.3390/w8040160openalex-snapshot
Optimal Node Grouping for Water Distribution System Demand Estimation
inferred← citeshttps://doi.org/10.4233/uuid:5437884e-0078-4b36-b2c7-c6edfea3b418openalex-snapshot
The Intersection of Planning and Learning
inferred← citeshttps://doi.org/10.48550/arxiv.0904.3093openalex-snapshot
Counting Paths and Packings in Halves
inferred← citeshttps://doi.org/10.48550/arxiv.1101.3182openalex-snapshot
Multi-Stage Improved Route Planning Approach: theoretical foundations
inferred← citeshttps://doi.org/10.48550/arxiv.1310.7789openalex-snapshot
Computing isogenies between supersingular elliptic curves over F_p
inferred← citeshttps://doi.org/10.48550/arxiv.1602.01764openalex-snapshot
A double oracle approach for minmax regret optimization problems with interval data
inferred← citeshttps://doi.org/10.48550/arxiv.1703.02582openalex-snapshot
Efficient motion planning for problems lacking optimal substructure
inferred← citeshttps://doi.org/10.48550/arxiv.1907.12185openalex-snapshot
Endomorphism rings of supersingular elliptic curves over $\mathbb{F}_p$
inferred← citeshttps://doi.org/10.48550/arxiv.2111.01877openalex-snapshot
AIT* and EIT*: Asymmetric bidirectional sampling-based path planning
inferred← citeshttps://doi.org/10.4995/thesis/10251/192474openalex-snapshot
Nuevas herramientas para la gestión técnica de redes de distribución de agua basadas en el modelo matemático y la topología de la red.
inferred← citeshttps://doi.org/10.7302/60openalex-snapshot
Algebraic Frameworks for Cryptographic Primitives
inferred← citeshttps://doi.org/10.7939/r3348gj05openalex-snapshot
Bidirectional Search That Is Guaranteed to Meet in the Middle: Extended Version
inferred← citeshttps://doi.org/10.7939/r3j09wb0gopenalex-snapshot
Effective Bidirectional A* with Frontier Search and External-Memory Utilization
inferred← citeshttps://doi.org/10.9746/ve.sicetr1965.43.277openalex-snapshot
Real Time Motion Planning in Dynamic Environment Containing Moving Obstacles Using Spatiotemporal RRT
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.