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

Robert Ganian
Sebastian Ordyniak

Algorithmica

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

Pageof 1
Sort By:
Algorithmica|March 12, 2021
The Power of Cut-Based Parameters for Computing Edge-Disjoint PathsRobert Ganian, Sebastian Ordyniak
Algorithmica|November 19, 2025
From Data Completion to Problems on Hypercubes: A Parameterized Analysis of the Independent Set ProblemEduard Eiben, Robert Ganian, Iyad Kanj, et al.
Algorithmica|July 29, 2024
Slim Tree-Cut WidthRobert Ganian, Viktoriia Korchemna
Algorithmica|January 31, 2020
Solving Problems on Graphs of High Rank-WidthEduard Eiben, Robert Ganian, Stefan Szeider
Algorithmica|March 5, 2019
Backdoors for Linear Temporal LogicArne Meier, Sebastian Ordyniak, M S Ramanujan, et al.
Pageof 1

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

Sort By:
Pageof 1
Algorithmica|March 12, 2021
The Power of Cut-Based Parameters for Computing Edge-Disjoint PathsRobert Ganian, Sebastian Ordyniak
Algorithmica|November 19, 2025
From Data Completion to Problems on Hypercubes: A Parameterized Analysis of the Independent Set ProblemEduard Eiben, Robert Ganian, Iyad Kanj, et al.
Algorithmica|July 29, 2024
Slim Tree-Cut WidthRobert Ganian, Viktoriia Korchemna
Algorithmica|January 31, 2020
Solving Problems on Graphs of High Rank-WidthEduard Eiben, Robert Ganian, Stefan Szeider
Algorithmica|March 5, 2019
Backdoors for Linear Temporal LogicArne Meier, Sebastian Ordyniak, M S Ramanujan, et al.
Pageof 1