The following pages link to Bart M. P. Jansen (Q372969):
Displaying 39 items.
- Lower bounds for dynamic programming on planar graphs of bounded cutwidth (Q5009465) (← links)
- (Q5009477) (← links)
- Computing the Chromatic Number Using Graph Decompositions via Matrix Rank (Q5009610) (← links)
- Polynomial Kernels for Hitting Forbidden Minors under Structural Parameterizations. (Q5009611) (← links)
- Fine-grained Complexity Analysis of Two Classic TSP Variants (Q5028342) (← links)
- Crossing Paths with Hans Bodlaender: A Personal View on Cross-Composition for Sparsification Lower Bounds (Q5042452) (← links)
- Bridge-Depth Characterizes which Minor-Closed Structural Parameterizations of Vertex Cover Admit a Polynomial Kernel (Q5048303) (← links)
- Fine-Grained Complexity of k-OPT in Bounded-Degree Graphs for Solving TSP (Q5075760) (← links)
- A deterministic polynomial kernel for odd cycle transversal and vertex multiway cut in planar graphs (Q5090489) (← links)
- Optimal Data Reduction for Graph Coloring Using Low-Degree Polynomials (Q5111881) (← links)
- Turing Kernelization for Finding Long Paths in Graph Classes Excluding a Topological Minor (Q5111882) (← links)
- Lower Bounds for Dynamic Programming on Planar Graphs of Bounded Cutwidth (Q5131225) (← links)
- A Deterministic Polynomial Kernel for Odd Cycle Transversal and Vertex Multiway Cut in Planar Graphs (Q5163509) (← links)
- Optimal Sparsification for Some Binary CSPs Using Low-Degree Polynomials (Q5205824) (← links)
- Fine-Grained Parameterized Complexity Analysis of Graph Coloring Problems (Q5283380) (← links)
- Characterizing the easy-to-find subgraphs from the viewpoint of polynomial-time algorithms, kernels, and Turing kernels (Q5363088) (← links)
- Sparsification Upper and Lower Bounds for Graphs Problems and Not-All-Equal SAT (Q5363770) (← links)
- A Near-Optimal Planarization Algorithm (Q5384092) (← links)
- Preprocessing for Treewidth: A Combinatorial Analysis through Kernelization (Q5408612) (← links)
- (Q5874535) (← links)
- On Structural Parameterizations of Hitting Set: Hitting Paths in Graphs Using 2-SAT (Q5890956) (← links)
- On Structural Parameterizations of Hitting Set: Hitting Paths in Graphs Using 2-SAT (Q5892359) (← links)
- Kernelization for Maximum Leaf Spanning Tree with Positive Vertex Weights (Q5894785) (← links)
- Kernelization for Maximum Leaf Spanning Tree with Positive Vertex Weights (Q5900911) (← links)
- Finding \(k\)-secluded trees faster (Q6039423) (← links)
- (Q6059193) (← links)
- (Q6065467) (← links)
- Finding \(k\)-secluded trees faster (Q6133646) (← links)
- Kernelization for feedback vertex set via elimination distance to a forest (Q6153475) (← links)
- On the Hardness of Compressing Weights (Q6168482) (← links)
- (Q6192482) (← links)
- Hamiltonicity below Dirac's condition (Q6313629) (← links)
- Kernelization Dichotomies for Hitting Subgraphs under Structural Parameterizations (Q6532067) (← links)
- Preprocessing to reduce the search space: antler structures for feedback vertex set (Q6564613) (← links)
- Search-space reduction via essential vertices (Q6606914) (← links)
- Upward and orthogonal planarity are W[1]-hard parameterized by treewidth (Q6618262) (← links)
- Single-exponential FPT algorithms for enumerating secluded \(\mathcal{F}\)-free subgraphs and deleting to scattered graph classes (Q6655669) (← links)
- 5-approximation for \(\mathcal{H}\)-treewidth essentially as fast as \(\mathcal{H}\)-deletion parameterized by solution size (Q6657028) (← links)
- Lossy planarization: a constant-factor approximate kernelization for planar vertex deletion (Q6670351) (← links)
