Pino Persiano

Papers

Total Citations

106

H-Index

About

Pino Persiano is a leading researcher in theoretical computer science, with a focus on algorithmic graph theory, motion planning, and combinatorial optimization. His most significant contributions center on the pebble motion problem—a classic model for coordinating multiple agents or robots moving along the vertices of a graph without collisions. Persiano’s landmark 1999 paper, “A Linear-Time Algorithm for the Feasibility of Pebble Motion on Trees,” which has garnered 78 citations, introduced an efficient method to determine whether a given configuration of pebbles on a tree can be rearranged into a target configuration. This work, building on his earlier 1996 study (23 citations), provided a foundational algorithm that is both elegant and practical, with applications in robotics, logistics, and distributed computing. His 1996 paper on optimal robot motion planning on trees with obstacles (5 citations) further extended these ideas, offering new strategies for navigating constrained environments. Persiano’s research has had a lasting impact, influencing subsequent work in multi-agent pathfinding and graph algorithms. His ability to distill complex motion problems into linear-time solutions demonstrates a rare blend of theoretical depth and practical insight, making his contributions essential reading for students and researchers in algorithmic robotics and discrete mathematics.