Entity usage

This page lists pages that use the given entity (e.g. Q42). The list is sorted by descending page ID, so that newer pages are listed first.

Showing below up to 50 results in range #51 to #100.

Exact Algorithms for Edge Domination: Label: en
A Tighter Bound for Counting Max-Weight Solutions to 2SAT Instances: Label: en
The Time Complexity of Constraint Satisfaction: Label: en
Parameterized Chess: Label: en
A Linear Kernel for Planar Feedback Vertex Set: Label: en
Parameterized Derandomization: Label: en
Wheel-Free Deletion Is W[2]-Hard: Label: en
FPT Algorithms for Path-Transversals and Cycle-Transversals Problems in Graphs: Label: en
Parameterized Complexity and Approximability of the SLCS Problem: Label: en
A Purely Democratic Characterization of W[1]: Label: en
Some Fixed-Parameter Tractable Classes of Hypergraph Duality and Related Problems: Label: en
Capacitated Domination and Covering: A Parameterized Perspective: Label: en
New Fixed-Parameter Algorithms for the Minimum Quartet Inconsistency Problem: Label: en
An O *(1.0977 n ) Exact Algorithm for max independent set in Sparse Graphs: Label: en
An Improved Fixed-Parameter Algorithm for Minimum-Flip Consensus Trees: Label: en
Fixed Structure Complexity: Label: en
Parameterized Complexity of the Smallest Degree-Constrained Subgraph Problem: Label: en
Algorithmic Meta-theorems: Label: en
Algorithmic Graph Minors and Bidimensionality: Label: en
Randomized Disposal of Unknowns and Implicitly Enforced Bounds on Parameters: Label: en
The Lost Continent of Polynomial Time: Preprocessing and Kernelization: Label: en
Kernels: Annotated, Proper and Induced: Label: en
Towards a Taxonomy of Techniques for Designing Parameterized Algorithms: Label: en
Random Separation: A New Method for Solving Fixed-Cardinality Optimization Problems: Label: en
The Parameterized Complexity of Enumerating Frequent Itemsets: Label: en
On the Effective Enumerability of NP Problems: Label: en
Fixed-Parameter Tractability Results for Full-Degree Spanning Tree and Its Dual: Label: en
The Undirected Feedback Vertex Set Problem Has a Poly(k) Kernel: Label: en
Finding a Minimum Feedback Vertex Set in Time $\mathcal{O} (1.7548^n)$: Label: en
On the Parameterized Complexity of d-Dimensional Point Set Pattern Matching: Label: en
Fixed Parameter Tractability of Independent Set in Segment Intersection Graphs: Label: en
Parameterized Complexity of Independence and Domination on Geometric Graphs: Label: en
edge dominating set: Efficient Enumeration-Based Exact Algorithms: Label: en
An Exact Algorithm for the Minimum Dominating Clique Problem: Label: en
Parameterized Approximation Problems: Label: en
On Parameterized Approximability: Label: en
Fixed-Parameter Approximation: Conceptual Framework and Approximability Results: Label: en
Greedy Localization and Color-Coding: Improved Matching and Packing Algorithms: Label: en
On the OBDD Size for Graphs of Bounded Tree- and Clique-Width: Label: en
Fixed-Parameter Complexity of Minimum Profile Problems: Label: en
Randomized Approximations of Parameterized Counting Problems: Label: en
Parameterizing MAX SNP Problems Above Guaranteed Values: Label: en
The Parameterized Complexity of Maximality and Minimality Problems: Label: en
The Cluster Editing Problem: Implementations and Experiments: Label: en
Applying Modular Decomposition to Parameterized Bicluster Editing: Label: en
Proper Interval Vertex Deletion: Label: en
Inclusion/Exclusion Branching for Partial Dominating Set and Set Splitting: Label: en
The Exponential Time Complexity of Computing the Probability That a Graph Is Connected: Label: en
Exponential Time Complexity of Weighted Counting of Independent Sets: Label: en
On the Grundy Number of a Graph: Label: en