Showing 1–20 of 55 results
/ Date/ Name
May 3, 2013Minimum Common String Partition Parameterized by Partition Size is Fixed-Parameter TractableAug 11, 2019Graph Motif Problems Parameterized by DualDec 16, 2024Witty: An Efficient Solver for Computing Minimum-Size Decision TreesSep 8, 2025The Parameter Report: An Orientation Guide for Data-Driven ParameterizationMar 21, 2015Parameterized Complexity of Critical Node CutsJul 7, 2023A Multivariate Complexity Analysis of the Generalized Noah's Ark ProblemFeb 28, 2025Polynomial-Size Enumeration Kernelizations for Long Path EnumerationNov 17, 2015Tight Running Time Lower Bounds for Vertex Deletion ProblemsApr 29, 2021Parameterized String EquationsApr 7, 2021Destroying Multicolored Paths and Cycles in Edge-Colored GraphsApr 30, 2020Learning Bayesian Networks Under Sparsity Constraints: A Parameterized Complexity AnalysisJul 30, 2013A Fixed-Parameter Algorithm for Minimum Common String Partition with Few DuplicationsJun 18, 2015A parameterized approximation algorithm for the mixed and windy Capacitated Arc Routing Problem: theory and experimentsMay 27, 2024Maximizing Phylogenetic Diversity under Ecological Constraints: A Parameterized Complexity StudySep 20, 2024Parameterized Local Search for Max $c$-CutNov 3, 2022Efficient Branch-and-Bound Algorithms for Finding Triangle-Constrained 2-ClubsApr 26, 2016Assessing the Computational Complexity of Multi-Layer Subgraph DetectionApr 17, 2016h-Index Manipulation by Undoing MergesAug 2, 2023Enumeration Kernels of Polynomial Size for Cuts of Bounded DegreeNov 17, 2025A Complexity Analysis of the c-Closed Vertex Deletion Problem