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

Petr A Golovach

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

Pageof 1
Sort By:
Algorithmica|October 3, 2022
Special Issue Dedicated to the 16th International Symposium on Parameterized and Exact ComputationPetr A Golovach, Meirav Zehavi
Theory of Computing Systems|February 9, 2026
Tight Approximation and Kernelization Bounds for Vertex-Disjoint Shortest PathsMatthias Bentert, Fedor V Fomin, Petr A Golovach
Theory of Computing Systems|April 19, 2019
Finding Cactus Roots in Polynomial TimePetr A Golovach, Dieter Kratsch, Daniël Paulusma, et al.
Discrete & Computational Geometry|November 19, 2024
(Re)packing Equal Disks into RectangleFedor V Fomin, Petr A Golovach, Tanmay Inamdar, et al.
Mathematical Programming|February 19, 2024
Diverse collections in matroids and graphsFedor V Fomin, Petr A Golovach, Fahad Panolan, et al.
Algorithmica|July 26, 2022
Parameterized Complexity of Directed Spanner ProblemsFedor V Fomin, Petr A Golovach, William Lochet, et al.
Pageof 1

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

Sort By:
Pageof 1
Algorithmica|October 3, 2022
Special Issue Dedicated to the 16th International Symposium on Parameterized and Exact ComputationPetr A Golovach, Meirav Zehavi
Theory of Computing Systems|February 9, 2026
Tight Approximation and Kernelization Bounds for Vertex-Disjoint Shortest PathsMatthias Bentert, Fedor V Fomin, Petr A Golovach
Theory of Computing Systems|April 19, 2019
Finding Cactus Roots in Polynomial TimePetr A Golovach, Dieter Kratsch, Daniël Paulusma, et al.
Discrete & Computational Geometry|November 19, 2024
(Re)packing Equal Disks into RectangleFedor V Fomin, Petr A Golovach, Tanmay Inamdar, et al.
Mathematical Programming|February 19, 2024
Diverse collections in matroids and graphsFedor V Fomin, Petr A Golovach, Fahad Panolan, et al.
Algorithmica|July 26, 2022
Parameterized Complexity of Directed Spanner ProblemsFedor V Fomin, Petr A Golovach, William Lochet, et al.
Pageof 1