default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVladimir Yanovski
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2011
[j9]Yaniv Altshuler, Vladimir Yanovski, Israel A. Wagner, Alfred M. Bruckstein
:
Multi-agent Cooperative Cleaning of Expanding Domains. Int. J. Robotics Res. 30(8): 1037-1071 (2011)
2000 – 2009
- 2009
- [c6]Yaniv Altshuler, Vladimir Yanovski, Israel A. Wagner, Alfred M. Bruckstein:
Swarm ant robotics for a dynamic cleaning problem - analytic lower bounds and impossibility results. ICARA 2009: 216-221 - [c5]Yaniv Altshuler, Vladimir Yanovski, Israel A. Wagner, Alfred M. Bruckstein:
Swarm ant robotics for a dynamic cleaning problem - upper bounds. ICARA 2009: 227-232 - 2008
- [j8]Israel A. Wagner, Yaniv Altshuler, Vladimir Yanovski, Alfred M. Bruckstein:
Cooperative Cleaners: A Study in Ant Robotics. Int. J. Robotics Res. 27(1): 127-151 (2008) - [j7]Eliyahu Osherovich, Vladimir Yanovski, Israel A. Wagner, Alfred M. Bruckstein:
Robust and Efficient Covering of Unknown Continuous Domains with Simple, Ant-Like A(ge)nts. Int. J. Robotics Res. 27(7): 815-831 (2008) - [j6]Vladimir Yanovski:
Approximation algorithm for coloring of dotted interval graphs. Inf. Process. Lett. 108(1): 41-44 (2008) - [j5]Yaniv Altshuler, Vladimir Yanovski, Israel A. Wagner, Alfred M. Bruckstein:
Efficient cooperative search of smart targets using UAV Swarms. Robotica 26(4): 551-557 (2008) - [c4]Vladimir Yanovski, Stephen M. Rumble, Michael Brudno:
Read Mapping Algorithms for Single Molecule Sequencing Data. WABI 2008: 38-49 - 2007
- [j4]Vladimir Yanovski, Israel A. Wagner, Alfred M. Bruckstein:
A Linear-Time Constant-Space Algorithm for the Boundary Fill Problem. Comput. J. 50(4): 473-477 (2007) - [j3]Maria Artishchev-Zapolotsky, Yefim Dinitz, Shimon Even, Vladimir Yanovski:
Layout of an Arbitrary Permutation in a Minimal Right Triangle Area. J. Interconnect. Networks 8(2): 101-118 (2007) - 2006
- [c3]Eliyahu Osherovich, Alfred M. Bruckstein, Vladimir Yanovski:
Covering a Continuous Domain by Distributed, Limited Robots. ANTS Workshop 2006: 144-155 - [c2]Yaniv Altshuler, Vladimir Yanovski, Daniel Vainsencher, Israel A. Wagner, Alfred M. Bruckstein:
On Minimal Perimeter Polyminoes. DGCI 2006: 17-28 - [p1]Yaniv Altshuler, Vladimir Yanovski, Israel A. Wagner, Alfred M. Bruckstein:
Swarm Intelligence - Searchers, Cleaners and Hunters. Swarm Intelligent Systems 2006: 93-132 - 2005
- [c1]Maria Artishchev-Zapolotsky, Shimon Even, Vladimir Yanovski:
Layout of an Arbitrary Permutation in a Minimal Right Triangle Area. PDPTA 2005: 124-130 - 2003
- [j2]Vladimir Yanovski, Israel A. Wagner, Alfred M. Bruckstein:
A Distributed Ant Algorithm for Efficiently Patrolling a Network. Algorithmica 37(3): 165-186 (2003) - 2001
- [j1]Vladimir Yanovski, Israel A. Wagner, Alfred M. Bruckstein:
Vertex-Ant-Walk - A robust method for efficient exploration of faulty graphs. Ann. Math. Artif. Intell. 31(1-4): 99-112 (2001)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:12 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
