Showing results (11-20 of 77) with videos related to

Sort By:
Pageof 8
Algorithmica|September 23, 2025
On the Parameterized Complexity of Eulerian Strong Component Arc DeletionVáclav Blažej, Satyabrata Jana, M S Ramanujan, et al.
Algorithmica|September 23, 2025
Smoothed Analysis of the 2-Opt Heuristic for the TSP under Gaussian NoiseMarvin Künnemann, Bodo Manthey, Rianne Veenstra
Algorithmica|May 12, 2025
Counting Temporal PathsJessica Enright, Kitty Meeks, Hendrik Molter
Algorithmica|October 9, 2025
A Clique-Based Separator for Intersection Graphs of Geodesic Disks in [Formula: see text]Boris Aronov, Mark de Berg, Leonidas Theocharous
Algorithmica|May 25, 2026
Fully Characterizing Lossy Catalytic ComputationMarten Folkertsma, Ian Mertz, Florian Speelman, et al.
Algorithmica|June 8, 2026
Tree-Packing Revisited: Faster Fully Dynamic Min-Cut and ArboricityTijn de Vos, Aleksander Christiansen
Algorithmica|March 12, 2021
The Power of Cut-Based Parameters for Computing Edge-Disjoint PathsRobert Ganian, Sebastian Ordyniak
Algorithmica|November 1, 2021
Improved Online Algorithms for Knapsack and GAP in the Random Order ModelSusanne Albers, Arindam Khan, Leon Ladewig
Algorithmica|November 1, 2021
Faster algorithms for counting subgraphs in sparse graphsMarco Bressan
Algorithmica|February 29, 2020
Asymptotic Analysis of Regular SequencesClemens Heuberger, Daniel Krenn
Pageof 8