On problems without polynomial kernels
From MaRDI portal
Publication:1034099
DOI10.1016/J.JCSS.2009.04.001zbMATH Open1192.68288OpenAlexW2107284348WikidataQ57359819 ScholiaQ57359819MaRDI QIDQ1034099FDOQ1034099
Authors: Hans L. Bodlaender, Rodney G. Downey, Michael R. Fellows, Danny Hermelin 
Publication date: 10 November 2009
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcss.2009.04.001
Recommendations
lower boundsparameterized complexitypolynomial hierarchykernelizationpolynomial kernelscomposition algorithmdistillation algorithm
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Cites Work
- Title not available (Why is that?)
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
- A partial k-arboretum of graphs with bounded treewidth
- Parametrized complexity theory.
- On the Structure of Polynomial Time Reducibility
- Color-coding
- The complexity of theorem-proving procedures
- Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey
- Vertex packings: Structural properties and algorithms
- Title not available (Why is that?)
- Title not available (Why is that?)
- The polynomial-time hierarchy
- Computation Models for Parameterized Complexity
- Cutting up is hard to do: the parameterised complexity of \(k\)-cut and related problems
- Fixed-parameter tractability and data reduction for multicut in trees
- On Well-Partial-Order Theory and Its Application to Combinatorial Problems of VLSI Design
- Advice classes of parametrized tractability
- On self-reducibility and weak P-selectivity
- The Undirected Feedback Vertex Set Problem Has a Poly(k) Kernel
- Polynomial-time data reduction for dominating set
- Linear Problem Kernels for NP-Hard Problems on Planar Graphs
- Greedy Localization and Color-Coding: Improved Matching and Packing Algorithms
- The complexity of first-order and monadic second-order logic revisited
- Tight lower bounds for certain parameterized NP-hard problems
- Linear FPT reductions and computational lower bounds
- Title not available (Why is that?)
- Title not available (Why is that?)
- Efficient bounds for the stable set, vertex cover and set packing problems
- Divide-and-Color
- An efficient fixed-parameter algorithm for 3-hitting set
- Nonconstructive advances in polynomial-time complexity
- The importance of being biased
- Mathematical Foundations of Computer Science 2003
- Graph-modeled data clustering: Exact algorithms for clique generation
- \(\text{Kernel}(s)\) for problems with no kernel: on out-trees with many leaves
- Title not available (Why is that?)
- A Cubic Kernel for Feedback Vertex Set
- Automata, Languages and Programming
- STACS 2005
- Title not available (Why is that?)
- A quadratic kernel for feedback vertex set
- Algorithms and Data Structures
- Automata, Languages and Programming
- Title not available (Why is that?)
Cited In (only showing first 100 items - show all)
- A multistage view on 2-satisfiability
- On the maximum colorful arborescence problem and color hierarchy graph structure
- Parameterized domination in circle graphs
- Two edge-disjoint paths with length constraints
- Finding, hitting and packing cycles in subexponential time on unit disk graphs
- Hitting minors on bounded treewidth graphs. III. Lower bounds
- On the approximate compressibility of connected vertex cover
- On the kernelization of ranking \(r\)-CSPs: linear vertex-kernels for generalizations of feedback arc set and betweenness in tournaments
- Modifying a graph using vertex elimination
- Towards non-black-box separations of public key encryption and one way function
- Refined notions of parameterized enumeration kernels with applications to matching cut enumeration
- Parameterized algorithms for Max Colorable Induced Subgraph problem on perfect graphs
- How much does a treedepth modulator help to obtain polynomial kernels beyond sparse graphs?
- Basic Terminology, Notation and Results
- On kernelization for edge dominating set under structural parameters
- Tractability, hardness, and kernelization lower bound for and/or graph solution
- On the parameterized complexity of graph modification to first-order logic properties
- From the \(W\)-hierarchy to XNLP. Classes of fixed parameter intractability
- Parameterized aspects of strong subgraph closure
- What Is Known About Vertex Cover Kernelization?
- Safe approximation and its relation to kernelization
- Parameterized complexity of secluded connectivity problems
- Two edge modification problems without polynomial kernels
- Title not available (Why is that?)
- On the parametrized complexity of read-once refutations in UTVPI+ constraint systems
- Finding disjoint dense clubs in a social network
- Finding Disjoint Dense Clubs in an Undirected Graph
- Parameterized complexity of sparse linear complementarity problems
- FPT is characterized by useful obstruction sets
- Diminishable parameterized problems and strict polynomial kernelization
- Kernelization lower bounds for finding constant-size subgraphs
- How much does a treedepth modulator help to obtain polynomial kernels beyond sparse graphs?
- The parameterized complexity of \(s\)-club with triangle and seed constraints
- Meta-kernelization using well-structured modulators
- Parameterized complexity of \textsc{bandwidth} of \textsc{caterpillars} and \textsc{weighted path emulation}
- Fractals for kernelization lower bounds, with an application to length-bounded cut problems
- Parameterized analysis and crossing minimization problems
- Parameterized complexity of safe set
- Multivariate complexity analysis of geometric \textsc{Red Blue Set Cover}
- Polynomial Kernel for Interval Vertex Deletion
- FPT is characterized by useful obstruction sets: connecting algorithms, kernels, and quasi-orders
- Parameterized aspects of strong subgraph closure
- Finding connected secluded subgraphs
- On the (parameterized) complexity of recognizing well-covered \((r,\ell)\)-graphs
- On some FPT problems without polynomial Turing compressions
- Polynomial kernels for proper interval completion and related problems
- Parameterized algorithms and data reduction for the short secluded s‐t‐path problem
- On the complexity of approximately matching a string to a directed graph
- A hierarchy of polynomial kernels
- Finding cuts of bounded degree: complexity, FPT and exact algorithms, and kernelization
- A polynomial kernel for bipartite permutation vertex deletion
- Twin-width and polynomial kernels
- Polynomial kernels for hitting forbidden minors under structural parameterizations
- Kernel and fast algorithm for dense triplet inconsistency
- Kernel bounds for path and cycle problems
- Parameterized complexity of vertex deletion into perfect graph classes
- Polynomial kernels for proper interval completion and related problems
- Facility location problems: a parameterized view
- Every ternary permutation constraint satisfaction problem parameterized above average has a kernel with a quadratic number of variables
- Studies in Computational Aspects of Voting
- On the Kernelization Complexity of Colorful Motifs
- Parameterized complexity of even/odd subgraph problems
- Parameterizations of test cover with bounded test sizes
- Linear kernel for \textsc{Rooted Triplet Inconsistency} and other problems based on conflict packing technique
- On polynomial kernels for structural parameterizations of odd cycle transversal
- On the hardness of losing width
- On polynomial kernels for sparse integer linear programs
- A randomized polynomial kernelization for vertex cover with a smaller parameter
- Quadratic kernelization for convex recoloring of trees
- Parameterized Complexity of Firefighting Revisited
- Solving MAX-\(r\)-SAT above a tight lower bound
- Smaller parameters for vertex cover kernelization
- Incremental list coloring of graphs, parameterized by conservation
- Spanners in sparse graphs
- A basic parameterized complexity primer
- Infeasibility of instance compression and succinct PCPs for NP
- Algorithms, kernels and lower bounds for the flood-it game parameterized by the vertex cover number
- Parameterized computational complexity of finding small-diameter subgraphs
- Note on maximal bisection above tight lower bound
- Compression via matroids: a randomized polynomial kernel for odd cycle transversal
- On the hardness of losing width
- Parameterized Eulerian strong component arc deletion problem on tournaments
- Kernelizations for the hybridization number problem on multiple nonbinary trees
- Parameterized complexity dichotomy for \textsc{Steiner Multicut}
- Kernelization using structural parameters on sparse graph classes
- On the parameterized complexity of the repetition free longest common subsequence problem
- Title not available (Why is that?)
- Incompressible functions, relative-error extractors, and the power of nondeterministic reductions
- Solving linear equations parameterized by Hamming weight
- Kernelization -- preprocessing with a guarantee
- Backdoors to satisfaction
- Kernel bounds for disjoint cycles and disjoint paths
- Kernelization of cycle packing with relaxed disjointness constraints
- Preprocessing for Treewidth: A Combinatorial Analysis through Kernelization
- Restricted and swap common superstring: a multivariate algorithmic perspective
- Kernelization lower bounds through colors and IDs
- Algorithms and kernels for \textsc{Feedback Set} problems in generalizations of tournaments
- Data reduction for graph coloring problems
- A polynomial kernel for \textsc{Feedback Arc Set} on bipartite tournaments
- Data reduction for graph coloring problems
This page was built for publication: On problems without polynomial kernels
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1034099)
