Showing 1–20 of 50 results
/ Date/ Name
May 31, 2018A Parameterized Complexity View on Collapsing k-CoresMar 26, 2024Parameterized Analysis of Bribery in Challenge the Champ TournamentsApr 22, 2024Minimizing the Number of Tardy Jobs with Uniform Processing Times on Parallel MachinesJun 26, 2022Hardness of Interval Scheduling on Unrelated MachinesJan 25, 2023In Which Graph Structures Can We Efficiently Find Temporally Disjoint Paths and Walks?Dec 27, 2021Fairness in Repetitive SchedulingMar 30, 2020Feedback Edge Sets in Temporal GraphsMay 12, 2016Adapting the Bron-Kerbosch Algorithm for Enumerating Maximal Cliques in Temporal GraphsDec 16, 2024Adaptive Manipulation for Coalitions in Knockout TournamentsOct 9, 2020Equitable Scheduling on a Single MachineMay 25, 2021On Finding Separators in Temporal Split and Permutation GraphsSep 13, 2019Enumerating Isolated Cliques in Temporal NetworksFeb 24, 2022Counting Temporal PathsJun 26, 2018Listing All Maximal $k$-Plexes in Temporal GraphsSep 26, 2017Cluster Editing for Multi-Layer and Temporal GraphsNov 11, 2016Diminishable Parameterized Problems and Strict Polynomial KernelizationApr 25, 2025Treewidth Parameterized by Feedback Vertex NumberFeb 14, 2022Minimizing the Weighted Number of Tardy Jobs via (max,+)-ConvolutionsNov 2, 2017The Complexity of Finding Small Separators in Temporal GraphsApr 19, 2025Temporal Graph Realization With Bounded Stretch