The following pages link to Bart M. P. Jansen (Q372969):
Displaying 50 items.
- Vertex cover kernelization revisited. Upper and lower bounds for a refined parameter (Q372970) (← links)
- Preprocessing subgraph and minor problems: when does a small vertex cover help? (Q386050) (← links)
- Kernel bounds for path and cycle problems (Q392032) (← links)
- Parameterized complexity of vertex deletion into perfect graph classes (Q392038) (← links)
- Data reduction for graph coloring problems (Q393081) (← links)
- Turing kernelization for finding long paths and cycles in restricted graph classes (Q730497) (← links)
- Best-case and worst-case sparsifiability of Boolean CSPs (Q786033) (← links)
- Independent-set reconfiguration thresholds of hereditary graph classes (Q1801058) (← links)
- Towards fully multivariate algorithmics: parameter ecology and the deconstruction of computational complexity (Q1933639) (← links)
- Preprocessing for outerplanar vertex deletion: an elementary kernel of quartic size (Q2093579) (← links)
- Fine-grained parameterized complexity analysis of graph coloring problems (Q2112649) (← links)
- Preprocessing vertex-deletion problems: characterizing graph properties by low-rank adjacencies (Q2119402) (← links)
- Lower bounds for protrusion replacement by counting equivalence classes (Q2174552) (← links)
- The evolutionary language game: an orthogonal approach (Q2196826) (← links)
- Polynomial kernels for hitting forbidden minors under structural parameterizations (Q2202024) (← links)
- Optimal data reduction for graph coloring using low-degree polynomials (Q2272594) (← links)
- Turing kernelization for finding long paths in graph classes excluding a topological minor (Q2272596) (← links)
- Hamiltonicity below Dirac's condition (Q2301533) (← links)
- A Turing kernelization dichotomy for structural parameterizations of \(\mathcal{F}\)-minor-free deletion (Q2301538) (← links)
- Computing the chromatic number using graph decompositions via matrix rank (Q2330132) (← links)
- On sparsification for computing treewidth (Q2343087) (← links)
- Sparsification upper and lower bounds for graph problems and not-all-equal SAT (Q2408194) (← links)
- A Turing kernelization dichotomy for structural parameterizations of \(\mathcal{F} \)-minor-free deletion (Q2662677) (← links)
- Preprocessing to reduce the search space: antler structures for feedback vertex set (Q2672419) (← links)
- FPT algorithms to compute the elimination distance to bipartite graphs and more (Q2672425) (← links)
- \(p\)-edge/vertex-connected vertex cover: parameterized and approximation algorithms (Q2677827) (← links)
- FPT is characterized by useful obstruction sets: connecting algorithms, kernels, and quasi-orders (Q2828222) (← links)
- FPT Is Characterized by Useful Obstruction Sets (Q2864307) (← links)
- On Polynomial Kernels for Structural Parameterizations of Odd Cycle Transversal (Q2891343) (← links)
- Kernel Bounds for Path and Cycle Problems (Q2891344) (← links)
- Kernel Bounds for Structural Parameterizations of Pathwidth (Q2904570) (← links)
- Determining the winner of a Dodgson election is hard (Q2908877) (← links)
- Preprocessing for Treewidth: A Combinatorial Analysis through Kernelization (Q3012824) (← links)
- Data Reduction for Graph Coloring Problems (Q3088272) (← links)
- Parameterized Complexity of Vertex Deletion into Perfect Graph Classes (Q3088287) (← links)
- (Q3113681) (← links)
- (Q3113682) (← links)
- Uniform Kernelization Complexity of Hitting Forbidden Minors (Q3448821) (← links)
- A Structural Approach to Kernels for ILPs: Treewidth and Total Unimodularity (Q3452840) (← links)
- Polynomial Kernels for Hard Problems on Disk Graphs (Q3569901) (← links)
- Approximation and Kernelization for Chordal Vertex Deletion (Q4575834) (← links)
- Approximation and Kernelization for Chordal Vertex Deletion (Q4586151) (← links)
- A Locally Adaptive System for the Fusion of Objective Quality Measures (Q4592253) (← links)
- Fine-grained complexity analysis of two classic TSP variants (Q4598137) (← links)
- Constrained bipartite vertex cover : The easy kernel is essentially tight (Q4601897) (← links)
- Optimal Sparsification for Some Binary CSPs Using Low-Degree Polynomials (Q4608634) (← links)
- Lower Bounds for Protrusion Replacement by Counting Equivalence Classes (Q4634400) (← links)
- Independent-Set Reconfiguration Thresholds of Hereditary Graph Classes. (Q4636582) (← links)
- Preprocessing Subgraph and Minor Problems: When Does a Small Vertex Cover Help? (Q4899244) (← links)
- Kernelization Lower Bounds by Cross-Composition (Q4979840) (← links)
