Angelo Monti

Papers

Total Citations

101

H-Index

About

Angelo Monti has made foundational contributions to algorithmic graph theory and combinatorial reconfiguration, with his most celebrated work centering on the pebble motion problem on trees. In his landmark 1999 paper, cited 78 times, Monti introduced a linear-time algorithm for determining the feasibility of moving pebbles among vertices on a tree—a problem with deep implications for robot motion planning, puzzle solving, and distributed computing. This work, building on an earlier 1996 version (23 citations), provides an elegant, efficient solution to a classic NP-hard problem in restricted graph classes, demonstrating Monti’s knack for distilling complex combinatorial constraints into tractable algorithms. His research spans graph algorithms, computational complexity, and reconfiguration problems, where he has consistently delivered tight complexity bounds and novel algorithmic techniques. Monti’s impact is evident in the sustained citation of his work by researchers in artificial intelligence, operations research, and theoretical computer science. Beyond his algorithmic breakthroughs, he has contributed to the broader understanding of pebble motion as a model for resource allocation and rearrangement, cementing his reputation as a key figure in the study of reconfiguration problems.