bounded search treescuts and separatorsdynamic programming on treewidthExponential-Time Hypothesisiterative compressionkernelizationlower boundsmatroidsrandomized methods in parameterized algorithmstreewidth
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to mathematics in general (00-01) Mathematics in general (00A05) Mathematics for nonmathematicians (engineering, social sciences, etc.) (00A06) General applied mathematics (00A69) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics (05-01) Numerical mathematical programming methods (65K05) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Analysis of algorithms and problem complexity (68Q25) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01) Dynamic programming (90C39) Abstract computational complexity for mathematical programming problems (90C60)
Recommendations
Cited in
(only showing first 100 items - show all)- A (3+)k-vertex kernel for edge-disjoint triangle packing
- On exploring always-connected temporal graphs of small pathwidth
- Safe sets in graphs: graph classes and structural parameters
- Triangle-free planar graphs with small independence number
- Treewidth distance on phylogenetic trees
- Notes on complexity of packing coloring
- Reconfiguration on nowhere dense graph classes
- Problems on finite automata and the exponential time hypothesis
- Homothetic polygons and beyond: maximal cliques in intersection graphs
- A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletion
- The \(k\)-leaf spanning tree problem admits a klam value of 39
- Kernels for deletion to classes of acyclic digraphs
- Parameterized algorithms for recognizing monopolar and 2-subcolorable graphs
- On polynomial kernelization of \(\mathcal H\)-\textsc{free edge deletion}
- Change-making problems revisited: a parameterized point of view
- Improved FPT algorithms for weighted independent set in bull-free graphs
- Bivariate complexity analysis of \textsc{Almost Forest Deletion}
- Structured proportional representation
- Parameterized complexity of team formation in social networks
- Corrigendum to: ``Advice classes of parameterized tractability
- Parameterized algorithms for stable matching with ties and incomplete lists
- Solving problems on graphs of high rank-width
- Inapproximability of rank, clique, Boolean, and maximum induced matching-widths under small set expansion hypothesis
- Exact algorithms for finding well-connected 2-clubs in sparse real-world graphs: theory and experiments
- Subexponential-time algorithms for maximum independent set in \(P_t\)-free and broom-free graphs
- Multi-attribute proportional representation
- On directed covering and domination problems
- Co-clustering under the maximum norm
- Multivariate algorithmics for finding cohesive subnetworks
- The complexity of dominating set in geometric intersection graphs
- A parameterized algorithmics framework for degree sequence completion problems in directed graphs
- Explicit linear kernels for packing problems
- Counting linear extensions: parameterizations by treewidth
- Parameterized algorithms and kernels for rainbow matching
- The complexity of routing with collision avoidance
- Deciding the existence of a cherry-picking sequence is hard on two trees
- k-distinct in- and out-branchings in digraphs
- The complexity landscape of decompositional parameters for ILP
- Swapping colored tokens on graphs
- Polynomial kernels for deletion to classes of acyclic digraphs
- On two extensions of equimatchable graphs
- An improved FPT algorithm for almost forest deletion problem
- Algorithms, kernels and lower bounds for the flood-it game parameterized by the vertex cover number
- FPT-algorithms for some problems related to integer programming
- The parameterized complexity of finding secluded solutions to some classical optimization problems on graphs
- Parameterized complexity of machine scheduling: 15 open problems
- On the (parameterized) complexity of recognizing well-covered (\(r\),\(\ell\))-graph
- Parameterized algorithms for conflict-free colorings of graphs
- Parameterized complexity of length-bounded cuts and multicuts
- \((k,n-k)\)-\textsc{Max-Cut}: an \(\mathcal{O}^*(2^p)\)-time algorithm and a polynomial kernel
- Independent-set reconfiguration thresholds of hereditary graph classes
- Parameterized top-\(K\) algorithms
- On the complexity of broadcast domination and multipacking in digraphs
- Finding temporal paths under waiting time constraints
- On girth and the parameterized complexity of token sliding and token jumping
- Fixed cardinality stable sets
- Near-optimal lower bounds on regular resolution refutations of Tseitin formulas for all constant-degree graphs
- An improved kernel for max-bisection above tight lower bound
- On the parameterized tractability of single machine scheduling with rejection
- Paths to trees and cacti
- A tight lower bound for planar Steiner orientation
- On the parameterized complexity of contraction to generalization of trees
- Practical access to dynamic programming on tree decompositions
- On the approximate compressibility of connected vertex cover
- The inverse Voronoi problem in graphs. I: Hardness
- The complexity of finding small separators in temporal graphs
- Star partitions on graphs
- Parameterized complexity of \textsc{maximum edge colorable subgraph}
- Fixed parameter tractability of graph deletion problems over data streams
- Representative families for matroid intersections, with applications to location, packing, and covering problems
- Provision-after-wait with preferences ordered by difference: tighter complexity and better approximation
- Alliances in graphs of bounded clique-width
- Hardness and tractability of the \(\gamma\)-complete subgraph problem
- A fully polynomial parameterized algorithm for counting the number of reachable vertices in a digraph
- Analyzing clustering and partitioning problems in selected VLSI models
- On structural parameterizations of the edge disjoint paths problem
- Finding cuts of bounded degree: complexity, FPT and exact algorithms, and kernelization
- Parameterized counting of partially injective homomorphisms
- A sub-exponential FPT algorithm and a polynomial kernel for minimum directed bisection on semicomplete digraphs
- A parameterized perspective on protecting elections
- Faster parameterized algorithm for cluster vertex deletion
- On the complexity of the smallest grammar problem over fixed alphabets
- Subexponential parameterized algorithms and kernelization on almost chordal graphs
- Approximation in (poly-) logarithmic space
- Reducing graph transversals via edge contractions
- Sliding window temporal graph coloring
- The maximum binary tree problem
- Metric dimension parameterized by treewidth
- Subexponential-time algorithms for finding large induced sparse subgraphs
- On some efficiently solvable classes of the network facility location problem with constraints on the capacities of communication lines
- A unifying model for locally constrained spanning tree problems
- Token sliding on split graphs
- On the parametrized complexity of read-once refutations in UTVPI+ constraint systems
- An improved FPT algorithm for the flip distance problem
- Hitting forbidden induced subgraphs on bounded treewidth graphs
- (In)approximability of maximum minimal FVS
- Fine-grained complexity of rainbow coloring and its variants
- Efficiently enumerating hitting sets of hypergraphs arising in data profiling
- On the complexity of algorithms for detecting \(k\)-length negative cost cycles
- Analyzing unit read-once refutations in difference constraint systems
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)
