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 #1 to #50.

An Improved Kernel for the Undirected Planar Feedback Vertex Set Problem: Label: en
Enumerating Neighbour and Closest Strings: Label: en
Finding Dense Subgraphs of Sparse Graphs: Label: en
Parameterized Algorithmics and Computational Experiments for Finding 2-Clubs: Label: en
On Tractable Parameterizations of Graph Isomorphism: Label: en
On the Space Complexity of Parameterized Problems: Label: en
MSOL Restricted Contractibility to Planar Graphs: Label: en
Computing Directed Pathwidth in O(1.89 n ) Time: Label: en
Weighted Counting of k-Matchings Is #W[1]-Hard: Label: en
Fast Monotone Summation over Disjoint Sets: Label: en
Homomorphic Hashing for Sparse Coefficient Extraction: Label: en
Polynomial Time and Parameterized Approximation Algorithms for Boxicity: Label: en
Instance Compression for the Polynomial Hierarchy and beyond: Label: en
A Polynomial-Time Algorithm for Planar Multicuts with Few Source-Sink Pairs: Label: en
Preprocessing Subgraph and Minor Problems: When Does a Small Vertex Cover Help?: Label: en
An Exact Algorithm for Subset Feedback Vertex Set on Chordal Graphs: Label: en
Some Definitorial Suggestions for Parameterized Proof Complexity: Label: en
Nonblocker in H-Minor Free Graphs: Kernelization Meets Discharging: Label: en
Restricted and Swap Common Superstring: A Parameterized View: Label: en
A New Algorithm for Parameterized MAX-SAT: Label: en
New Results on Polynomial Inapproximability and Fixed Parameter Approximability of edge dominating set: Label: en
The Exponential Time Hypothesis and the Parameterized Clique Problem: Label: en
Finding a Maximum Induced Degenerate Subgraph Faster Than 2 n: Label: en
Computing Pathwidth Faster Than 2 n: Label: en
Improved Parameterized Algorithms for the Kemeny Aggregation Problem: Label: en
Stable Assignment with Couples: Parameterized Complexity and Local Search: Label: en
Even Faster Algorithm for Set Splitting!: Label: en
On the Directed Degree-Preserving Spanning Tree Problem: Label: en
Two Edge Modification Problems without Polynomial Kernels: Label: en
Partitioning into Sets of Bounded Cardinality: Label: en
Polynomial Kernels and Faster Algorithms for the Dominating Set Problem on Graphs with an Excluded Minor: Label: en
A Probabilistic Approach to Problems Parameterized above or below Tight Bounds: Label: en
Fixed-Parameter Algorithms in Analysis of Heuristics for Extracting Networks in Linear Programs: Label: en
Paths of Bounded Length and Their Cuts: Parameterized Complexity and Algorithms: Label: en
The Parameterized Complexity of Some Geometric Problems in Unbounded Dimension: Label: en
On Digraph Width Measures in Parameterized Algorithmics: Label: en
An Exponential Time 2-Approximation Algorithm for Bandwidth: Label: en
An Exact Algorithm for the Maximum Leaf Spanning Tree Problem: Label: en
Well-Quasi-Orders in Subclasses of Bounded Treewidth Graphs: Label: en
Improved Induced Matchings in Sparse Graphs: Label: en
What Makes Equitable Connected Partition Easy: Label: en
Pareto Complexity of Two-Parameter FPT Problems: A Case Study for Partial Vertex Cover: Label: en
Bounded-Degree Techniques Accelerate Some Parameterized Graph Algorithms: Label: en
On Finding Directed Trees with Many Leaves: Label: en
The Complexity of Satisfiability of Small Depth Circuits: Label: en
Boolean-Width of Graphs: Label: en
Planar Capacitated Dominating Set Is W[1]-Hard: Label: en
A Faster Fixed-Parameter Approach to Drawing Binary Tanglegrams: Label: en
Kernelization: New Upper and Lower Bound Techniques: Label: en
Balanced Hashing, Color Coding and Approximate Counting: Label: en