Anders Dessmark

Papers

Total Citations

H-Index

About

Anders Dessmark is a computer scientist whose research centers on algorithmic graph theory, with a particular focus on the fundamental problem of graph exploration. His most influential work, the 2004 paper "Optimal Graph Exploration without Good Maps," has garnered 66 citations, establishing a cornerstone in the field of autonomous agent navigation. In this seminal contribution, Dessmark and his co-authors addressed a critical challenge: how can a mobile agent systematically explore an unknown graph when it lacks a reliable map or distance information? They developed optimal algorithms that guarantee complete exploration while minimizing the number of edge traversals, providing tight bounds on performance. This work, building on an earlier 2002 version with 23 citations, has proven essential for applications in robotics, network discovery, and search-and-rescue operations. Dessmark’s contributions lie in bridging theoretical optimality with practical constraints of limited knowledge, offering elegant solutions that have inspired subsequent research in online algorithms and distributed computing. His research continues to shape how we understand and design efficient strategies for autonomous systems operating in uncertain environments.