„parameterized algorithm“
Suchergebnisse
565 Treffer
-
Subexponential Parameterized Algorithms for Graphs of Polynomial Growth
-
New Frontiers of Parameterized Complexity in Graph Drawing (Dagstuhl Seminar 23162)
-
Bidimensional Structures: Algorithms, Combinatorics and Logic (Dagstuhl Seminar 13121)
-
Component Order Connectivity in Directed Graphs
-
On Adaptive Algorithms for Maximum Matching
-
Parameterized Approximation Algorithms for Bidirected Steiner Network Problems
-
Parameterized Algorithms on Perfect Graphs for Deletion to (r,l)-Graphs
-
Subexponential Algorithms for Partial Cover Problems
-
Sub-exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number
-
Cluster Editing in Multi-Layer and Temporal Graphs
-
Parameterized Inapproximability of Independent Set in H-Free Graphs
-
On the Parameterized Complexity of Contraction to Generalization of Trees
-
The PACE 2024 Parameterized Algorithms and Computational Experiments Challenge: One-Sided Crossing Minimization
-
Matching (Multi)Cut: Algorithms, Complexity, and Enumeration
-
Dynamic Parameterized Feedback Problems in Tournaments
-
Subset Feedback Vertex Set in Tournaments as Fast as Without the Subset
-
Solving Co-Path/Cycle Packing and Co-Path Packing Faster Than 3^k
-
On Controlling Knockout Tournaments Without Perfect Information
-
From Chinese Postman to Salesman and Beyond: Shortest Tour δ-Covering All Points on All Edges
-
Knapsack with Vertex Cover, Set Cover, and Hitting Set