Parameterized algorithms
From MaRDI portal
Publication:5502162
treewidthlower boundskernelizationmatroidsiterative compressionbounded search treescuts and separatorsdynamic programming on treewidthExponential-Time Hypothesisrandomized methods in parameterized algorithms
Numerical mathematical programming methods (65K05) Analysis of algorithms and problem complexity (68Q25) Dynamic programming (90C39) General applied mathematics (00A69) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics (05-01) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Abstract computational complexity for mathematical programming problems (90C60) Mathematics in general (00A05) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to mathematics in general (00-01) Mathematics for nonmathematicians (engineering, social sciences, etc.) (00A06) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01)
Recommendations
Cited in
(only showing first 100 items - show all)- Metric Dimension of Bounded Tree-length Graphs
- Combinatorial \(n\)-fold integer programming and applications
- Lower bounds for the graph homomorphism problem
- Fine-grained complexity of safety verification
- Component order connectivity in directed graphs
- Combinatorial \(n\)-fold integer programming and applications
- Defensive alliances in graphs
- Algorithmic aspects of \textsc{Upper Domination}: a parameterised perspective
- Parameterized complexity of \((A,\ell)\)-path packing
- Structural parameterizations of clique coloring
- Data-compression for parametrized counting problems on sparse graphs
- Parameterized Complexity of $$(A,\ell )$$-Path Packing
- Parameterized and exact algorithms for class domination coloring
- scientific article; zbMATH DE number 7278055 (Why is no real title available?)
- On the computational complexity of the bipartizing matching problem
- An improved FPT algorithm for independent feedback vertex set
- The maximum binary tree problem
- Eternal vertex cover on bipartite graphs
- Fréchet distance between a line and avatar point set
- Lossy kernels for connected dominating set on sparse graphs
- An \(O^\ast ( 2 . 61 9^k )\) algorithm for 4-path vertex cover
- Subexponential-time algorithms for maximum independent set in \(P_t\)-free and broom-free graphs
- A parameterized complexity view on collapsing \(k\)-cores
- On the proper orientation number of chordal graphs
- Cluster Editing in Multi-Layer and Temporal Graphs.
- Parameterized complexity of machine scheduling: 15 open problems
- Approximation and kernelization for chordal vertex deletion
- Best-case and worst-case sparsifiability of Boolean CSPs
- Parameterized complexity of independent set in H-free graphs
- The parameterised complexity of computing the maximum modularity of a graph
- FPT algorithms for generalized feedback vertex set problems
- A parameterized complexity view on collapsing \(k\)-cores
- Compactors for parameterized counting problems
- Reconfiguration on nowhere dense graph classes
- A parameterized complexity view on non-preemptively scheduling interval-constrained jobs: few machines, small looseness, and small slack
- The Maximum Binary Tree Problem.
- Mim-width. II. The feedback vertex set problem
- FPT and kernelization algorithms for the induced tree problem
- A Retrospective on (Meta) Kernelization
- On the approximability of path and cycle problems in arc-dependent networks
- On the Complexity of Bounded Context Switching.
- Counting linear extensions: parameterizations by treewidth
- Practical access to dynamic programming on tree decompositions
- Parameterized and approximation algorithms for the load coloring problem
- Edge bipartization faster than \(2^k\)
- Fixed-parameter approximations for \(k\)-center problems in low highway dimension graphs
- Parameterized algorithms for list \(K\)-cycle
- More applications of the \(d\)-neighbor equivalence: acyclicity and connectivity constraints
- Twins in Subdivision Drawings of Hypergraphs
- Space-efficient vertex separators for treewidth
- A multivariate analysis of the strict terminal connection problem
- Parameterized counting of trees, forests and matroid bases
- On rectangle intersection graphs with stab number at most two
- Finding cactus roots in polynomial time
- Parameterized Algorithms for Partial Vertex Covers in Bipartite Graphs
- scientific article; zbMATH DE number 7559420 (Why is no real title available?)
- A linear kernel for finding square roots of almost planar graphs
- Structural parameterization for minimum conflict-free colouring
- Dynamic parameterized problems
- Rank reduction of oriented graphs by vertex and edge deletions
- Stable matching games: manipulation via subgraph isomorphism
- Approximability of clique transversal in perfect graphs
- On the (parameterized) complexity of recognizing well-covered (\(r\),\(\ell\))-graph
- Parameterized Complexity of Conflict-Free Graph Coloring
- Parameterized complexity of minimum membership dominating set
- A fixed-parameter perspective on \#BIS
- Degree-constrained orientation of maximum satisfaction: graph classes and parameterized complexity
- Counting problems in parameterized complexity
- Faster parameterized algorithm for pumpkin vertex deletion set
- Computing square roots of graphs with low maximum degree
- Dual parameterization of weighted coloring
- Present-biased optimization
- Synchronizing series-parallel deterministic finite automata with loops and related problems
- Parameterized algorithms for conflict-free colorings of graphs
- Dual parameterization of weighted coloring
- Group activity selection with few agent types
- On the parameterized complexity of the expected coverage problem
- Parameterized low-rank binary matrix approximation
- Optimal data reduction for graph coloring using low-degree polynomials
- Parameterized complexity of minimum membership dominating set
- A fixed-parameter perspective on \#BIS
- Consensus strings with small maximum distance and small distance sum
- Parameterized \(k\)-clustering: tractability island
- Parameterized dynamic cluster editing
- Stable matchings with covering constraints: a complete computational trichotomy
- On structural parameterizations of the bounded-degree vertex deletion problem
- Consensus strings with small maximum distance and small distance sum
- On the parameterized complexity of contraction to generalization of trees
- A parameterized algorithm for subset feedback vertex set in tournaments
- scientific article; zbMATH DE number 7561379 (Why is no real title available?)
- scientific article; zbMATH DE number 7407778 (Why is no real title available?)
- Parameter analysis for guarding terrains
- Completing partial schedules for open shop with unit processing times and routing
- Fine-grained parameterized complexity analysis of graph coloring problems
- Component order connectivity in directed graphs
- Paths to trees and cacti
- Structural parameterizations of undirected feedback vertex set: FPT algorithms and kernelization
- Corrigendum to: ``Advice classes of parameterized tractability
- scientific article; zbMATH DE number 7525485 (Why is no real title available?)
- The parameterized hardness of the \(k\)-center problem in transportation networks
This page was built for publication: Parameterized algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5502162)
