Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Filters

Leszek Gąsieniec

Showing results (1-10 of 2) with videos related to

Pageof 1
Sort By:
Theory of Computing Systems|February 7, 2020
The Complexity of Optimal Design of Temporally Connected GraphsEleni C Akrida, Leszek Gąsieniec, George B Mertzios, et al.
Algorithmica|March 16, 2019
Linear Search by a Pair of Distinct-Speed RobotsEvangelos Bampas, Jurek Czyzowicz, Leszek Gąsieniec, et al.
Pageof 1

Showing results (1-10 of 2) with videos related to

Sort By:
Pageof 1
Theory of Computing Systems|February 7, 2020
The Complexity of Optimal Design of Temporally Connected GraphsEleni C Akrida, Leszek Gąsieniec, George B Mertzios, et al.
Algorithmica|March 16, 2019
Linear Search by a Pair of Distinct-Speed RobotsEvangelos Bampas, Jurek Czyzowicz, Leszek Gąsieniec, et al.
Pageof 1