Piecemeal learning of an unknown environment
COLT '93 Proceedings of the sixth annual conference on Computational learning theory
Competitive searching in a generalized street
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Motion planning for a steering-constrained robot through moderate obstacles
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Piecemeal graph exploration by a mobile robot (extended abstract)
COLT '95 Proceedings of the eighth annual conference on Computational learning theory
Learning branches and learning to win closed games
COLT '96 Proceedings of the ninth annual conference on Computational learning theory
Exploring unknown environments
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
How to learn an unknown environment. I: the rectilinear case
Journal of the ACM (JACM)
The power of a pebble: exploring and mapping directed graphs
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Polylogarithmic-overhead piecemeal graph exploration
COLT' 98 Proceedings of the eleventh annual conference on Computational learning theory
On algorithm design for metrical task systems
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Localizing a robot with minimum travel
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Randomized robot navigation algorithms
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
On-line search in a simple polygon
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Exploring unknown undirected graphs
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Optimal constrained graph exploration
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Optimal robot localization in trees
Information and Computation
Routing with guaranteed delivery in geometric and wireless networks
Handbook of wireless networks and mobile computing
Tree exploration with little memory
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
The power of a pebble: exploring and mapping directed graphs
Information and Computation
Improved exploration of rectilinear polygons
Nordic Journal of Computing
A New Competitive Strategy for Reaching the Kernel of an Unknown Polygon
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
Searching Rectilinear Streets Completely
WADS '99 Proceedings of the 6th International Workshop on Algorithms and Data Structures
Robot Map Verification of a Graph World
WADS '99 Proceedings of the 6th International Workshop on Algorithms and Data Structures
Locating Information with Uncertainty in Fully Interconnected Networks
DISC '00 Proceedings of the 14th International Conference on Distributed Computing
Online Routing in Convex Subdivisions
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
The CNN Problem and Other k-Server Variants
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Lifelong Planning for Mobile Robots
Revised Papers from the International Seminar on Advances in Plan-Based Control of Robotic Agents,
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Performance bounds for planning in unknown terrain
Artificial Intelligence - special issue on planning with uncertainty and incomplete information
SIGACT news online algorithms column 1
ACM SIGACT News
A princess swimming in the fog looking for a monster cow
ACM SIGACT News
On-line path planning in an unknown polygonal environment
Information Sciences—Informatics and Computer Science: An International Journal
Competitive online routing in geometric graphs
Theoretical Computer Science - Special issue: Online algorithms in memoriam, Steve Seiden
Theoretical Computer Science - Special issue: Online algorithms in memoriam, Steve Seiden
The CNN problem and other k-server variants
Theoretical Computer Science - Special issue: Online algorithms in memoriam, Steve Seiden
A near-tight approximation lower bound and algorithm for the kidnapped robot problem
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Competitive exploration of rectilinear polygons
Theoretical Computer Science - Foundations of computation theory (FCT 2003)
Optimal constrained graph exploration
ACM Transactions on Algorithms (TALG)
Theoretical Computer Science
Research note: A representation theorem for minmax regret policies
Artificial Intelligence
Stochastic shortest paths via Quasi-convex maximization
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
International Journal of Robotics Research
Graph balancing: a special case of scheduling unrelated parallel machines
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
A note on the k-Canadian Traveller Problem
Information Processing Letters
Weighted Nearest Neighbor Algorithms for the Graph Exploration Problem on Cycles
SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
A Risk-Reward Competitive Analysis for the Recoverable Canadian Traveller Problem
COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
Information and Computation
On the two-dimensional cow search problem
Information Processing Letters
Steps toward self-aware networks
Communications of the ACM - Barbara Liskov: ACM's A.M. Turing Award Winner
Approximating Matches Made in Heaven
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Route planning under uncertainty: the Canadian traveller problem
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 2
Utility-based on-line exploration for repeated navigation in an embedded graph
Artificial Intelligence
Canadian traveler problem with remote sensing
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Weighted nearest neighbor algorithms for the graph exploration problem on cycles
Information Processing Letters
Multi-robot tree and graph exploration
ICRA'09 Proceedings of the 2009 IEEE international conference on Robotics and Automation
ACM Transactions on Algorithms (TALG)
Ant colony optimization for stochastic shortest path problems
Proceedings of the 12th annual conference on Genetic and evolutionary computation
Algorithms and theory of computation handbook
The k-canadian travelers problem with communication
FAW-AAIM'11 Proceedings of the 5th joint international frontiers in algorithmics, and 7th international conference on Algorithmic aspects in information and management
Online graph exploration: new results on old and new algorithms
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
SSTD'11 Proceedings of the 12th international conference on Advances in spatial and temporal databases
Exploring an unknown graph efficiently
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Online algorithms for the vehicle scheduling problem with time objective
WINE'05 Proceedings of the First international conference on Internet and Network Economics
Efficiently answering probability threshold-based shortest path queries over uncertain graphs
DASFAA'10 Proceedings of the 15th international conference on Database Systems for Advanced Applications - Volume Part I
Tree exploration with an oracle
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
High-Performance heuristics for optimization in stochastic traffic engineering problems
LSSC'09 Proceedings of the 7th international conference on Large-Scale Scientific Computing
Optimal competitive online ray search with an error-prone robot
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
Optimal exploration of terrains with obstacles
SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
Computational Geometry: Theory and Applications
Survey: Online algorithms for searching and exploration in the plane
Computer Science Review
Survey: A glimpse at Christos H. Papadimitriou
Computer Science Review
Computer Science Review
Online multi-robot exploration of grid graphs with rectangular obstacles
Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures
Stochastic matching with commitment
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Online graph exploration: New results on old and new algorithms
Theoretical Computer Science
Worst-case optimal exploration of terrains with obstacles
Information and Computation
Analytical models for risk-based intrusion response
Computer Networks: The International Journal of Computer and Telecommunications Networking
The k-Canadian Travelers Problem with communication
Journal of Combinatorial Optimization
| Hi-index | 5.23 |