Exploiting dense structures in parameterized complexity
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 5764850 (Why is no real title available?)
- scientific article; zbMATH DE number 1496577 (Why is no real title available?)
- scientific article; zbMATH DE number 2234775 (Why is no real title available?)
- A new rounding procedure for the assignment problem with applications to dense graph arrangement problems
- A shorter proof of the graph minor algorithm: the unique linkage theorem
- A sub-exponential FPT algorithm and a polynomial kernel for minimum directed bisection on semicomplete digraphs
- A sufficient condition for graphs to be weakly \(k\)-linked
- Almost \(k\)-wise vs. \(k\)-wise independent permutations, and uniformity for general group actions
- An O^(1.84ᵏ) parameterized algorithm for the multiterminal cut problem
- An exponential time parameterized algorithm for planar disjoint paths
- An improved parameterized algorithm for the minimum node multiway cut problem
- Clique Cover and Graph Separation
- Compression via Matroids
- Correlation clustering with a fixed number of clusters
- Designing FPT algorithms for cut problems using randomized contractions
- Edge bipartization faster than \(2^k\)
- Expander graphs and their applications
- Fast FAST
- Faster algorithms for feedback arc set tournament, Kemeny rank aggregation and betweenness tournament
- Fixed-Parameter Tractability of Multicut Parameterized by the Size of the Cutset
- Fundamentals of parameterized complexity
- Graph minors. XIII: The disjoint paths problem
- Kernel bounds for disjoint cycles and disjoint paths
- Kernelization. Theory of parameterized preprocessing
- Linear time approximation schemes for the Gale-Berlekamp game and related minimization problems
- Minimum bisection is fixed-parameter tractable
- Multicut Is FPT
- On the parameterized complexity of computing graph bisections
- Parameterized algorithms
- Parameterized graph separation problems
- Parametrized complexity theory.
- Polynomial time approximation schemes for dense instances of \( \mathcal{NP}\)-hard problems
- Polynomial time approximation schemes for dense instances of minimum constraint satisfaction
- Polynomial time approximation schemes for some dense instances of NP-hard optimization problems
- Polynomial time randomized approximation schemes for Tutte–Gröthendieck invariants: The dense case
- Property testers for dense constraint satisfaction programs on finite domains
- Property testing and its connection to learning and approximation
- Random sampling and approximation of MAX-CSPs
- Representative sets and irrelevant vertices: new tools for kernelization
- Set partitioning via inclusion-exclusion
- Sub-Exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number
- Subexponential parameterized algorithm for computing the cutwidth of a semi-complete digraph
- The minimum \(k\)-way cut of bounded size is fixed-parameter tractable
- Tight bounds for parameterized complexity of cluster editing with a small number of clusters
- Zur allgemeinen Kurventheorie.
This page was built for publication: Exploiting dense structures in parameterized complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7231574)
