On the public citation graph

A Linear-Time Algorithm for the Feasibility of Pebble Motion on Trees

0 signed · 70 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/3-540-61680-2_80openalex-snapshot

A new approach to optimal planning of robot motion on a tree with obstacles

inferredcites →https://doi.org/10.1016/0095-8956(74)90098-7openalex-snapshot

Graph puzzles, homotopy, and the alternating group

inferredcites →https://doi.org/10.1016/0196-6774(89)90037-0openalex-snapshot

Reversing trains: A turn of the century sorting problem

inferredcites →https://doi.org/10.1016/s0747-7171(08)80001-6openalex-snapshot

The (n2−1)-puzzle and related relocation problems

inferredcites →https://doi.org/10.1109/sfcs.1984.715921openalex-snapshot

Coordinating Pebble Motion On Graphs, The Diameter Of Permutation Groups, And Applications

inferredcites →https://doi.org/10.1109/sfcs.1994.365740openalex-snapshot

Motion planning on a graph

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/jgt.22856openalex-snapshot

Reconfiguration of connected graph partitions

inferred← citeshttps://doi.org/10.1006/inco.2000.3005openalex-snapshot

Optimal Pebble Motion on a Tree

inferred← citeshttps://doi.org/10.1007/11682462_27openalex-snapshot

Reconfigurations in Graphs and Grids

inferred← citeshttps://doi.org/10.1007/978-1-4614-0110-0_11openalex-snapshot

Mover Problems

inferred← citeshttps://doi.org/10.1007/978-3-319-16595-0_42openalex-snapshot

Pebble Motion on Graphs with Rotations: Efficient Feasibility Tests and Planning Algorithms

inferred← citeshttps://doi.org/10.1007/978-3-319-67308-0_24openalex-snapshot

Comparison of IP and CNF Models for Control of Automated Valet Parking Systems

inferred← citeshttps://doi.org/10.1007/978-3-642-41610-1_232-1openalex-snapshot

Multi-agent Pathfinding

inferred← citeshttps://doi.org/10.1007/s00373-011-1055-9openalex-snapshot

Token Graphs

inferred← citeshttps://doi.org/10.1007/s00373-018-1913-9openalex-snapshot

The Connectivity of Token Graphs

inferred← citeshttps://doi.org/10.1007/s00373-021-02301-0openalex-snapshot

The Edge-Connectivity of Token Graphs

inferred← citeshttps://doi.org/10.1007/s00453-009-9290-7openalex-snapshot

Multi-Color Pebble Motion on Graphs

inferred← citeshttps://doi.org/10.1007/s10514-018-9714-9openalex-snapshot

Dynamic teams of robots as ad hoc distributed computers: reducing the complexity of multi-robot motion planning via subspace selection

inferred← citeshttps://doi.org/10.1007/s10514-019-09858-zopenalex-snapshot

Average case constant factor time and distance optimal multi-robot path planning in well-connected environments

inferred← citeshttps://doi.org/10.1007/s10626-019-00284-yopenalex-snapshot

Efficient generation of performance bounds for a class of traffic scheduling problems

inferred← citeshttps://doi.org/10.1016/j.artint.2025.104372openalex-snapshot

Multi-agent pathfinding on strongly connected digraphs: Feasibility and solution algorithms

inferred← citeshttps://doi.org/10.1016/j.automatica.2024.111593openalex-snapshot

Constrained Motion Planning and Multi-Agent Path Finding on directed graphs

inferred← citeshttps://doi.org/10.1016/j.dam.2010.02.001openalex-snapshot

Feasibility of motion planning on acyclic and strongly connected directed graphs

inferred← citeshttps://doi.org/10.1016/j.dam.2013.03.009openalex-snapshot

Pebble exchange on graphs

inferred← citeshttps://doi.org/10.1016/j.ejc.2011.09.019openalex-snapshot

Colored pebble motion on graphs

inferred← citeshttps://doi.org/10.1016/j.ejc.2021.103325openalex-snapshot

Pebble exchange group of graphs

inferred← citeshttps://doi.org/10.1016/j.nahs.2021.101058openalex-snapshot

Polynomial-time optimal liveness enforcement for guidepath-based transport systems

inferred← citeshttps://doi.org/10.1016/j.robot.2021.103728openalex-snapshot

Multi-UAV trajectory planning using gradient-based sequence minimal optimization

inferred← citeshttps://doi.org/10.1017/cbo9780511902499.016openalex-snapshot

On the permutational power of token passing networks

inferred← citeshttps://doi.org/10.1017/cbo9781139506748.005openalex-snapshot

The complexity of change

inferred← citeshttps://doi.org/10.1109/cdc51059.2022.9992727openalex-snapshot

Multi-Agent Path Finding on Strongly Connected Digraphs

inferred← citeshttps://doi.org/10.1109/humanoids.2014.7041499openalex-snapshot

Rearranging similar objects with a manipulator using pebble graphs

inferred← citeshttps://doi.org/10.1109/iros.2009.5354148openalex-snapshot

Solvability of multi robot motion planning problems on Trees

inferred← citeshttps://doi.org/10.1109/iros.2012.6386147openalex-snapshot

Finding graph topologies for feasible multirobot motion planning

inferred← citeshttps://doi.org/10.1109/iros.2018.8594417openalex-snapshot

SEAR: A Polynomial- Time Multi-Robot Path Planning Algorithm with Expected Constant-Factor Optimality Guarantee

inferred← citeshttps://doi.org/10.1109/iros47612.2022.9981807openalex-snapshot

Multi-Robot Path Planning Using Medial-Axis-Based Pebble-Graph Embedding

inferred← citeshttps://doi.org/10.1109/iros51168.2021.9636088openalex-snapshot

Decentralized, Unlabeled Multi-Agent Navigation in Obstacle-Rich Environments using Graph Neural Networks

inferred← citeshttps://doi.org/10.1109/lra.2018.2800116openalex-snapshot

Efficient, High-Quality Stack Rearrangement

inferred← citeshttps://doi.org/10.1109/mrs.2017.8250930openalex-snapshot

Expected constant-factor optimal multi-robot path planning in well-connected environments

inferred← citeshttps://doi.org/10.1109/robot.2009.5152326openalex-snapshot

A novel approach to path planning for multiple robots in bi-connected graphs

inferred← citeshttps://doi.org/10.1109/tac.2019.2934427openalex-snapshot

Efficient Liveness Assessment for Traffic States in Open, Irreversible, Dynamically Routed, Zone-Controlled Guidepath-Based Transport Systems

inferred← citeshttps://doi.org/10.1109/tase.2018.2798630openalex-snapshot

Optimized Multiagent Routing for a Class of Guidepath-Based Transport Systems

inferred← citeshttps://doi.org/10.1109/tcns.2021.3124167openalex-snapshot

Min-Time Coverage in Constricted Environments: Problem Formulations and Complexity Analysis

inferred← citeshttps://doi.org/10.1109/tro.2022.3197013openalex-snapshot

Algorithms and Systems for Manipulating Multiple Objects

inferred← citeshttps://doi.org/10.1137/060652063openalex-snapshot

Reconfigurations in Graphs and Grids

inferred← citeshttps://doi.org/10.1142/s1793830915500597openalex-snapshot

On reachability in graphs with obstacles

inferred← citeshttps://doi.org/10.1177/0278364918780999openalex-snapshot

Complexity Results and Fast Methods for Optimal Tabletop Rearrangement with Overhand Grasps

inferred← citeshttps://doi.org/10.15607/rss.2017.xiii.051openalex-snapshot

High-Quality Tabletop Rearrangement with Overhand Grasps: Hardness Results and Fast Methods

inferred← citeshttps://doi.org/10.15607/rss.2018.xiv.013openalex-snapshot

Constant Factor Time Optimal Multi-Robot Routing on High-Dimensional Grids

inferred← citeshttps://doi.org/10.1609/aaai.v37i10.26362openalex-snapshot

The Multi-Agent Transportation Problem

inferred← citeshttps://doi.org/10.1609/aaai.v38i9.28895openalex-snapshot

On Computing Makespan-Optimal Solutions for Generalized Sliding-Tile Puzzles

inferred← citeshttps://doi.org/10.1609/icaps.v33i1.27208openalex-snapshot

The Small Solution Hypothesis for MAPF on Strongly Connected Directed Graphs Is True

inferred← citeshttps://doi.org/10.1609/icaps.v33i1.27228openalex-snapshot

Moving Trains like Pebbles: A Feasibility Study on Tree Yards

inferred← citeshttps://doi.org/10.1609/socs.v17i1.31562openalex-snapshot

Optimal Unlabeled Pebble Motion on Trees

inferred← citeshttps://doi.org/10.1609/socs.v4i1.18289openalex-snapshot

From Feasibility Tests to Path Planners for Multi-Agent Pathfinding

inferred← citeshttps://doi.org/10.1613/jair.1.15249openalex-snapshot

An Algorithm with Improved Complexity for Pebble Motion/Multi-Agent Path Finding on Trees

inferred← citeshttps://doi.org/10.1613/jair.4447openalex-snapshot

Push and Rotate: a Complete Multi-agent Pathfinding Algorithm

inferred← citeshttps://doi.org/10.3390/a11040052openalex-snapshot

Introduction to Reconfiguration

inferred← citeshttps://doi.org/10.46298/dmtcs.8383openalex-snapshot

Token Swapping on Trees

inferred← citeshttps://doi.org/10.47836/mjms.17.4.12openalex-snapshot

On the 2-Token Graphs of Some Disjoint Union of Graphs

inferred← citeshttps://doi.org/10.48550/arxiv.1301.2342openalex-snapshot

A Linear Time Algorithm for the Feasibility of Pebble Motion on Graphs

inferred← citeshttps://doi.org/10.48550/arxiv.1404.6573openalex-snapshot

Similar Part Rearrangement With Pebble Graphs

inferred← citeshttps://doi.org/10.48550/arxiv.1706.07255openalex-snapshot

Average Case Constant Factor Time and Distance Optimal Multi-Robot Path Planning in Well-Connected Environments

inferred← citeshttps://doi.org/10.48550/arxiv.1801.10465openalex-snapshot

Constant Factor Time Optimal Multi-Robot Routing on High-Dimensional Grids in Mostly Sub-Quadratic Time

inferred← citeshttps://doi.org/10.48550/arxiv.1912.09503openalex-snapshot

Multi-Robot Path Planning Via Genetic Programming

inferred← citeshttps://doi.org/10.48550/arxiv.2108.03368openalex-snapshot

Multi-Robot Path Planning in Complex Environments via Graph Embedding

inferred← citeshttps://doi.org/10.5772/12859openalex-snapshot

Graph-Based Multi Robot Motion Planning: Feasibility and Structural Properties

inferred← citeshttps://doi.org/10.5772/4788openalex-snapshot

Motion Planning and Reconfiguration for Systems of Multiple Objects

inferred← citeshttps://doi.org/10.70675/1d366b25z29b0z4b44zaef4z87e889a6ee49openalex-snapshot

Graph domination and reconfiguration problems

inferred← citeshttps://doi.org/10.7939/r3m340openalex-snapshot

Solving multi-agent pathfinding problems in polynomial time using tree decompositions

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.