A heuristic with worst-case analysis for minimax routing of two travelling salesmen on a tree

A 2-Approximation Algorithm for the Multi-vehicle Scheduling Problem on a Path with Release and Handling Times

ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms

2-Approximation algorithms for the multi-vehicle scheduling problem on a path with release and handling times

Discrete Applied Mathematics

An approximability result of the multi-vehicle scheduling problem on a path with release and handling times

Theoretical Computer Science

A faster 2-approximation algorithm for the minmax p-traveling salesmen problem on a tree

Discrete Applied Mathematics

Minmax subtree cover problem on cacti

Discrete Applied Mathematics

Optimal constrained graph exploration

ACM Transactions on Algorithms (TALG)

A subexponential algorithm for the coloured tree partition problem

Discrete Applied Mathematics

On the uniform edge-partition of a tree

Discrete Applied Mathematics

Minmax Tree Cover in the Euclidean Space

WALCOM '09 Proceedings of the 3rd International Workshop on Algorithms and Computation

Minmax subtree cover problem on cacti

Discrete Applied Mathematics

Remembering without memory: Tree exploration by asynchronous oblivious robots

Theoretical Computer Science

Locating and repairing faults in a network with mobile agents

Theoretical Computer Science

Computing without communicating: ring exploration by asynchronous oblivious robots

OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems

How many oblivious robots can explore a line

Information Processing Letters

Approximation results for a min-max location-routing problem

Discrete Applied Mathematics

Power-Aware collective tree exploration

ARCS'06 Proceedings of the 19th international conference on Architecture of Computing Systems

Smart robot teams exploring sparse trees

MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science

Approximating the minmax subtree cover problem in a cactus

ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation

Approximation hardness of min-max tree covers

Operations Research Letters

Collaborative search on the plane without communication

PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing

Collecting information by power-aware mobile agents

DISC'12 Proceedings of the 26th international conference on Distributed Computing

Exploring an unknown dangerous graph using tokens

Theoretical Computer Science