Pages that link to "Item:Q383833"
From MaRDI portal
The following pages link to Fundamentals of parameterized complexity (Q383833):
Displaying 50 items.
- Sum-of-Products with Default Values: Algorithms and Complexity Results (Q5076308) (← links)
- Parameterized Algorithms for Power-Efficiently Connecting Wireless Sensor Networks: Theory and Experiments (Q5084628) (← links)
- On 2-Clubs in Graph-Based Data Clustering: Theory and Algorithm Engineering (Q5084692) (← links)
- Connecting the dots (with minimum crossings) (Q5088932) (← links)
- (Q5088974) (← links)
- (Q5089162) (← links)
- (Q5089163) (← links)
- (Q5089197) (← links)
- (Q5089217) (← links)
- (Q5089236) (← links)
- A Relaxation of the Directed Disjoint Paths Problem: A Global Congestion Metric Helps. (Q5089241) (← links)
- (Q5089244) (← links)
- Hitting Forbidden Induced Subgraphs on Bounded Treewidth Graphs (Q5089257) (← links)
- On Closest Pair in Euclidean Metric: Monochromatic is as Hard as Bichromatic (Q5090390) (← links)
- A deterministic polynomial kernel for odd cycle transversal and vertex multiway cut in planar graphs (Q5090489) (← links)
- (Q5091010) (← links)
- (Q5091216) (← links)
- (Q5091271) (← links)
- Counting Answers to Existential Questions (Q5091275) (← links)
- Packing Arc-Disjoint Cycles in Tournaments (Q5092386) (← links)
- (Q5092394) (← links)
- A complexity dichotomy for critical values of the b-chromatic number of graphs (Q5092395) (← links)
- (Q5092396) (← links)
- Measuring what Matters: A Hybrid Approach to Dynamic Programming with Treewidth. (Q5092404) (← links)
- Adapting the Directed Grid Theorem into an FPT Algorithm (Q5099098) (← links)
- An Exact Method for the Minimum Feedback Arc Set Problem (Q5102057) (← links)
- Parameterized (Approximate) Defective Coloring (Q5107096) (← links)
- Structured Connectivity Augmentation (Q5111243) (← links)
- (Q5111250) (← links)
- Lossy Kernels for Hitting Subgraphs (Q5111284) (← links)
- Parameterized Algorithms and Kernels for Rainbow Matching (Q5111288) (← links)
- On the Complexity of Bounded Context Switching. (Q5111714) (← links)
- On the Parameterized Complexity of Contraction to Generalization of Trees. (Q5111860) (← links)
- (Q5111868) (← links)
- (Q5111872) (← links)
- (Q5111877) (← links)
- (Q5111878) (← links)
- Optimal Data Reduction for Graph Coloring Using Low-Degree Polynomials (Q5111881) (← links)
- From Gap-Exponential Time Hypothesis to Fixed Parameter Tractable Inapproximability: Clique, Dominating Set, and More (Q5115701) (← links)
- (Q5115814) (← links)
- The Parameterized Hardness of the k-Center Problem in Transportation Networks (Q5116483) (← links)
- Graph Motif Problems Parameterized by Dual (Q5119384) (← links)
- The Parameterized Complexity of Motion Planning for Snake-Like Robots (Q5130004) (← links)
- Hitting Minors on Bounded Treewidth Graphs. I. General Upper Bounds (Q5130572) (← links)
- An Efficient Fixed-Parameter Algorithm for the 2-Plex Bipartition Problem (Q5136236) (← links)
- (Q5136255) (← links)
- (Q5136270) (← links)
- The Maximum Colorful Arborescence problem parameterized by the structure of its color hierarchy graph (Q5140781) (← links)
- Parameterized Algorithms for Book Embedding Problems (Q5141644) (← links)
- Bribery and Control in Stable Marriage (Q5154751) (← links)