„Parameterized Algorithm“
Suchergebnisse
565 Treffer
-
Computing Tree Decompositions with Small Independence Number
-
A Tight Monte-Carlo Algorithm for Steiner Tree Parameterized by Clique-Width
-
Parameterized Approximation For Robust Clustering in Discrete Geometric Spaces
-
Finding Diverse Strings and Longest Common Subsequences in a Graph
-
Solving a Family Of Multivariate Optimization and Decision Problems on Classes of Bounded Expansion
-
The Simultaneous Interval Number: A New Width Parameter that Measures the Similarity to Interval Graphs
-
ETH-Tight Algorithm for Cycle Packing on Unit Disk Graphs
-
Parameterized Algorithms for Multi-Label Periodic Temporal Graph Realization
-
Partial Temporal Vertex Cover with Bounded Activity Intervals
-
On the Complexity of Temporal Arborescence Reconfiguration
-
Exploration and Rendezvous in Temporal Graphs (Invited Talk)
-
FPT Approximation of Generalised Hypertree Width for Bounded Intersection Hypergraphs
-
Parameterized and Approximation Algorithms for Coverings Points with Segments in the Plane
-
A Faster Algorithm for Vertex Cover Parameterized by Solution Size
-
Faster Graph Algorithms Through DAG Compression
-
Bipartite Temporal Graphs and the Parameterized Complexity of Multistage 2-Coloring
-
The PACE 2021 Parameterized Algorithms and Computational Experiments Challenge: Cluster Editing
-
The PACE 2019 Parameterized Algorithms and Computational Experiments Challenge: The Fourth Iteration (Invited Paper)
-
A Faster Parameterized Algorithm for Pseudoforest Deletion
-
Parameterized Approximation: Algorithms and Hardness (Dagstuhl Seminar 23291)