On the public citation graph

Mutually Beneficial Confluent Routing

0 signed · 37 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-3-642-24455-1_34openalex-snapshot
Calculating Meeting Points for Multi User Pedestrian Navigation Systems
inferredcites →https://doi.org/10.1007/978-3-642-40235-7_15openalex-snapshot
Group Trip Planning Queries in Spatial Databases
inferredcites →https://doi.org/10.1007/978-3-662-44777-2_27openalex-snapshot
Robust Distance Queries on Massive Networks
inferredcites →https://doi.org/10.1007/bf00288933openalex-snapshot
Quad trees a data structure for retrieval on composite keys
inferredcites →https://doi.org/10.1007/s10115-013-0686-yopenalex-snapshot
Efficient processing of optimal meeting point queries in Euclidean space and road networks
inferredcites →https://doi.org/10.1007/s10732-012-9214-6openalex-snapshot
Concave minimum cost network flow problems solved with a colony of ants
inferredcites →https://doi.org/10.1007/s11301-008-0033-7openalex-snapshot
A survey on pickup and delivery problems
inferredcites →https://doi.org/10.1007/s11301-008-0036-4openalex-snapshot
A survey on pickup and delivery problems
inferredcites →https://doi.org/10.1016/j.asoc.2013.05.009openalex-snapshot
The travelling salesman problem with time windows: Adapting algorithms from travel-time to makespan optimization
inferredcites →https://doi.org/10.1016/j.ijpe.2013.07.016openalex-snapshot
Optimal algorithm for the demand routing problem in multicommodity flow distribution networks with diversification constraints and concave costs
inferredcites →https://doi.org/10.1109/mdm.2015.12openalex-snapshot
SHAREK: A Scalable Dynamic Ride Sharing System
inferredcites →https://doi.org/10.1109/mdm.2015.49openalex-snapshot
A Mixed Breadth-Depth First Search Strategy for Sequenced Group Trip Planning Queries
inferredcites →https://doi.org/10.1109/mdm.2015.68openalex-snapshot
Efficient Computation of Group Optimal Sequenced Routes in Road Networks
inferredcites →https://doi.org/10.1137/0116001openalex-snapshot
Steiner Minimal Trees
inferredcites →https://doi.org/10.1137/070702370openalex-snapshot
The Price of Routing Unsplittable Flow
inferredcites →https://doi.org/10.1137/090750317openalex-snapshot
Approximation Algorithms for Nonuniform Buy-at-Bulk Network Design
inferredcites →https://doi.org/10.1137/120868360openalex-snapshot
A Constant-Factor Approximation Algorithm for Unsplittable Flow on Paths
inferredcites →https://doi.org/10.1145/2525314.2525342openalex-snapshot
Parameterized algorithms for generalized traveling salesman problems in road networks
inferredcites →https://doi.org/10.1287/trsc.29.1.17openalex-snapshot
The General Pickup and Delivery Problem
inferredcites →https://doi.org/10.14778/2140436.2140438openalex-snapshot
Shortest path and distance queries on road networks
inferredcites →https://doi.org/10.14778/2732939.2732945openalex-snapshot
Path problems in temporal graphs
inferredcites →https://doi.org/10.1609/socs.v4i1.18279openalex-snapshot
Multi-Hop Ride Sharing
inferredcites →https://doi.org/10.4230/oasics.atmos.2010.88openalex-snapshot
Fast Detour Computation for Ride Sharing
inferredcites →https://doi.org/10.48550/arxiv.0907.5269openalex-snapshot
Fast Detour Computation for Ride Sharing
inferredcites →https://doi.org/10.48550/arxiv.1305.5030openalex-snapshot
Towards Rational Deployment of Multiple Heuristics in A*

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-319-64367-0_1openalex-snapshot
Multi-user Itinerary Planning for Optimal Group Preference
inferred← citeshttps://doi.org/10.1007/s10707-018-0331-8openalex-snapshot
Optimal group route query: Finding itinerary for group of users in spatial databases
inferred← citeshttps://doi.org/10.1007/s10707-020-00411-0openalex-snapshot
SHAREK*: A Scalable Matching Method for Dynamic Ride Sharing
inferred← citeshttps://doi.org/10.1016/j.sna.2021.113240openalex-snapshot
Wearable human-machine interaction device integrated by all-textile-based tactile sensors array via facile cross-stitch
inferred← citeshttps://doi.org/10.1109/icde.2017.28openalex-snapshot
Mutually beneficial confluent routing (extended abstract)
inferred← citeshttps://doi.org/10.1109/ictai.2019.00022openalex-snapshot
Multi-agent Path Planning with Heterogeneous Cooperation
inferred← citeshttps://doi.org/10.1109/icws.2018.00009openalex-snapshot
URoad: An Efficient Algorithm for Large-Scale Dynamic Ridesharing Service
inferred← citeshttps://doi.org/10.1109/iucc/dsci/smartcns.2019.00111openalex-snapshot
Carpooling Algorithm with the Common Departure
inferred← citeshttps://doi.org/10.1142/s2737599424400115openalex-snapshot
Optimization to release net zero emission in built environment from newly developed natural fiber–hybrid composite
inferred← citeshttps://doi.org/10.1145/2996913.2997018openalex-snapshot
Multi-user routing to single destination with confluence
inferred← citeshttps://doi.org/10.1145/3144457.3144483openalex-snapshot
From Ride-Sourcing to Ride-Sharing through Hot-Spots
inferred← citeshttps://doi.org/10.18196/jgpp.72130openalex-snapshot
The Uttilization of Jogja Smart Service Application: an E-Readiness Approach
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.