Betweenness parameterized above tight lower bound
From MaRDI portal
Recommendations
- A probabilistic approach to problems parameterized above or below tight bounds
- Every ternary permutation constraint satisfaction problem parameterized above average has a kernel with a quadratic number of variables
- A geometric approach to betweenness
- A Geometric Approach to Betweenness
- On subbetweennesses of trees: hardness, algorithms, and characterizations
Cites work
- scientific article; zbMATH DE number 1507224 (Why is no real title available?)
- scientific article; zbMATH DE number 6297727 (Why is no real title available?)
- scientific article; zbMATH DE number 2234775 (Why is no real title available?)
- A Geometric Approach to Betweenness
- A probabilistic approach to problems parameterized above or below tight bounds
- All ternary permutation constraint satisfaction problems parameterized above average have kernels with quadratic numbers of variables
- Constraint Satisfaction Problems on Intervals and Lengths
- Fixed-parameter complexity of minimum profile problems
- Interval Completion Is Fixed Parameter Tractable
- Logarithmic Sobolev Inequalities
- Monotone maps, sphericity and bounded second eigenvalue
- Note on Max Lin-2 above average
- On Problems without Polynomial Kernels (Extended Abstract)
- Ordinal Embedding: Approximation Algorithms and Dimensionality Reduction
- Ordinal embeddings of minimum relaxation: general properties, trees, and ultrametrics
- Parameterizing above Guaranteed Values: MaxSat and MaxCut
- Parameterizing above or below guaranteed values
- Parametrized complexity theory.
- Simple linear time approximation algorithm for betweenness
- Systems of linear equations over \(\mathbb{F}_2\) and problems parameterized above average
- The linear arrangement problem parameterized above guaranteed value
- Total Ordering Problem
- `` Strong NP-Completeness Results
- Étude des coefficients de Fourier des fonctions de \(L^ p(G)\)
Cited in
(18)- Every ternary permutation constraint satisfaction problem parameterized above average has a kernel with a quadratic number of variables
- Parameterizations of test cover with bounded test sizes
- A probabilistic approach to problems parameterized above or below tight bounds
- Constraint Satisfaction Problems Parameterized above or below Tight Bounds: A Survey
- A geometric approach to betweenness
- Solving MAX-\(r\)-SAT above a tight lower bound
- Strict betweennesses induced by posets as well as by graphs
- A probabilistic approach to problems parameterized above or below tight bounds
- Note on maximal bisection above tight lower bound
- Approximation schemes for the betweenness problem in tournaments and related ranking problems
- Improved parameterized algorithms for above average constraint satisfaction
- Large independent sets in subquartic planar graphs
- Lower bounds on kernelization
- Domination above \(r\)-independence: does sparseness help?
- Characterization and representation problems for intersection betweennesses
- Kernels for below-upper-bound parameterizations of the hitting set and directed dominating set problems
- Large independent sets in triangle-free planar graphs
- Parameterized constraint satisfaction problems: a survey
This page was built for publication: Betweenness parameterized above tight lower bound
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1959433)
