Jesper Jansson
Papers
1
Total Citations
7
H-Index
1
About
Jesper Jansson is a theoretical computer scientist whose research centers on graph algorithms, distributed computing, and combinatorial optimization. His work has made significant contributions to understanding traversal and exploration in anonymous networks—systems where nodes lack unique identifiers. In his most-cited paper, "More Efficient Periodic Traversal in Anonymous Undirected Graphs" (2010), Jansson introduced novel algorithms that reduce the overhead of periodic exploration, a fundamental problem in distributed systems. This work, with 7 citations, has influenced subsequent studies on robot navigation and network discovery. Jansson's broader impact includes advancing the theory of graph searching and developing efficient solutions for problems in network design and bioinformatics. His research is notable for its mathematical rigor and practical relevance, often bridging gaps between theoretical models and real-world applications. Jansson's achievements reflect a career dedicated to solving complex problems in graph theory and distributed algorithms, making him a respected figure in his field.
Research Focus
Key Achievements
Top Papers
- 1More Efficient Periodic Traversal in Anonymous Undirected Graphs7 citations · 2010