ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Discrete Applied Mathematics
Theoretical Computer Science
A faster 2-approximation algorithm for the minmax p-traveling salesmen problem on a tree
Discrete Applied Mathematics
Approximations for minimum and min-max vehicle routing problems
Journal of Algorithms
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
Map construction of unknown graphs by multiple agents
Theoretical Computer Science
Minmax Tree Cover in the Euclidean Space
WALCOM '09 Proceedings of the 3rd International Workshop on Algorithms and Computation
Note: A note on the minimum bounded edge-partition of a tree
Discrete Applied Mathematics
Approximation Algorithms for Min-Max Path Cover Problems with Service Handling Time
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Minmax subtree cover problem on cacti
Discrete Applied Mathematics
Approximations for minimum and min-max vehicle routing problems
Journal of Algorithms
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
Approximation algorithms for min-max capacitated path covers
CATS '10 Proceedings of the Sixteenth Symposium on Computing: the Australasian Theory - Volume 109
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
Memory lower bounds for randomized collaborative search and implications for biology
DISC'12 Proceedings of the 26th international conference on Distributed Computing
| Hi-index | 0.05 |