Mimmo Parente

University of Pisa, University of Salerno

Papers

Total Citations

101

H-Index

About

Mimmo Parente is a leading figure in theoretical computer science, with a core focus on algorithmic graph theory, pebble motion problems, and computational complexity. His most celebrated contribution is the development of a linear-time algorithm for determining the feasibility of pebble motion on trees, a foundational result that has garnered over 100 combined citations across its two landmark publications (1996 and 1999). This work elegantly solves a classic problem in robotics and reconfiguration, proving that for tree-structured graphs, the question of whether pebbles can be moved to target positions can be decided in time proportional to the graph’s size—a significant leap from earlier exponential approaches. Parente’s research has profound implications for automated planning, warehouse logistics, and modular robotics, where efficient movement of agents or resources is critical. Beyond this, his broader investigations into combinatorial algorithms and distributed computing continue to influence the design of scalable, provably correct systems. His ability to distill complex reconfiguration challenges into elegant, practical solutions marks him as a key innovator in algorithmic problem-solving.