Online Parallel Heuristics and Robot Searching under the Competitive Framework
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
Theoretical Computer Science
Online searching with turn cost
Theoretical Computer Science - Approximation and online algorithms
Ranking hypotheses to minimize the search cost in probabilistic inference models
Discrete Applied Mathematics
Introduction to the SIGACT news online algorithms column
ACM SIGACT News
On Developing New Models, with Paging as a Case Study
ACM SIGACT News
On the optimality of spiral search
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Searching for an axis-parallel shoreline
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part I
Multi-target ray searching problems
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
Competitive search in symmetric trees
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
Optimal competitive online ray search with an error-prone robot
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
Survey: Online algorithms for searching and exploration in the plane
Computer Science Review
Searching for an axis-parallel shoreline
Theoretical Computer Science
Hi-index | 5.23 |