Vladimir Yanovski

According to our database1, Vladimir Yanovski authored at least 16 papers between 2001 and 2011.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2011
Multi-agent Cooperative Cleaning of Expanding Domains.
Int. J. Robotics Res., 2011

2009
Swarm ant robotics for a dynamic cleaning problem - upper bounds.
Proceedings of the 4th International Conference on Autonomous Robots and Agents, 2009

Swarm ant robotics for a dynamic cleaning problem - analytic lower bounds and impossibility results.
Proceedings of the 4th International Conference on Autonomous Robots and Agents, 2009

2008
Efficient cooperative search of smart targets using UAV Swarms.
Robotica, 2008

Approximation algorithm for coloring of dotted interval graphs.
Inf. Process. Lett., 2008

Cooperative Cleaners: A Study in Ant Robotics.
Int. J. Robotics Res., 2008

Robust and Efficient Covering of Unknown Continuous Domains with Simple, Ant-Like A(ge)nts.
Int. J. Robotics Res., 2008

Read Mapping Algorithms for Single Molecule Sequencing Data.
Proceedings of the Algorithms in Bioinformatics, 8th International Workshop, 2008

2007
Layout of an Arbitrary Permutation in a Minimal Right Triangle Area.
J. Interconnect. Networks, 2007

A Linear-Time Constant-Space Algorithm for the Boundary Fill Problem.
Comput. J., 2007

2006
Swarm Intelligence - Searchers, Cleaners and Hunters.
Proceedings of the Swarm Intelligent Systems, 2006

On Minimal Perimeter Polyminoes.
Proceedings of the Discrete Geometry for Computer Imagery, 13th International Conference, 2006

Covering a Continuous Domain by Distributed, Limited Robots.
Proceedings of the Ant Colony Optimization and Swarm Intelligence, 2006

2005
Layout of an Arbitrary Permutation in a Minimal Right Triangle Area.
Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 2005

2003
A Distributed Ant Algorithm for Efficiently Patrolling a Network.
Algorithmica, 2003

2001
Vertex-Ant-Walk - A robust method for efficient exploration of faulty graphs.
Ann. Math. Artif. Intell., 2001


  Loading...