scientific article; zbMATH DE number 1507224
From MaRDI portal
Publication:4503944
Recommendations
Cited in
(only showing first 100 items - show all)- On the parameterized complexity of multiple-interval graph problems
- A more effective linear kernelization for cluster editing
- On the pseudo-achromatic number problem
- Learning large-alphabet and analog circuits with value injection queries
- Graph operations characterizing rank-width
- Fixed-parameter tractability of disjunction-free default reasoning
- Identification of function distinguishable languages.
- On the complexity of intersecting finite state automata and \(\mathcal{NL}\) versus \(\mathcal{NP}\)
- Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT.
- Algorithms for graphs with small octopus
- Fixed-parameter complexity in AI and nonmonotonic reasoning
- Threes!, Fives, 1024!, and 2048 are hard
- On the optimality of exact and approximation algorithms for scheduling problems
- Leaf realization problem, caterpillar graphs and prefix normal words
- Parameterized complexity of the list coloring reconfiguration problem with graph parameters
- A 2k-kernelization algorithm for vertex cover based on crown decomposition
- The \(S\)-\textsc{labeling} problem: an algorithmic tour
- Tractabilities and intractabilities on geometric intersection graphs
- Pattern-guided k-anonymity
- An improved FPT algorithm for almost forest deletion problem
- On compatibility and incompatibility of collections of unrooted phylogenetic trees
- Algorithms, kernels and lower bounds for the flood-it game parameterized by the vertex cover number
- Fly-automata for checking \(\mathrm{MSO}_2\) graph properties
- Parameterized algorithms for Max Colorable Induced Subgraph problem on perfect graphs
- An FPT algorithm for planar multicuts with sources and sinks on the outer face
- Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable
- Generalizations of matched CNF formulas
- Parameterized complexity of vertex colouring
- Parameterized complexity of finding subgraphs with hereditary properties.
- The Turing way to parameterized complexity
- A fixed-parameter algorithm for minimum quartet inconsistency
- On the existence of subexponential parameterized algorithms
- Graph separators: A parameterized view
- Improved exact algorithms for MAX-SAT
- Approximation algorithms for classes of graphs excluding single-crossing graphs as minors
- Computing the similarity of two sequences with nested arc annotations
- An existential locality theorem
- Computing crossing numbers in quadratic time
- Parameterized random complexity
- Betweenness parameterized above tight lower bound
- On parameterized algorithms for fixed-order book thickness with respect to the pathwidth of the vertex ordering
- The complexity of finding temporal separators under waiting time constraints
- Orthogonal planarity testing of bounded treewidth graphs
- EPTAS for load balancing problem on parallel machines with a non-renewable resource
- Streaming deletion problems parameterized by vertex cover
- From the \(W\)-hierarchy to XNLP. Classes of fixed parameter intractability
- Complexity of edge monitoring on some graph classes
- Constant thresholds can make target set selection tractable
- Minimum fill-in of sparse graphs: kernelization and approximation
- Colored hypergraph isomorphism is fixed parameter tractable
- Computational aspects of optimal strategic network diffusion
- FPT-algorithm for computing the width of a simplex given by a convex hull
- Parameterized dichotomy of choosing committees based on approval votes in the presence of outliers
- Backdoors to tractable answer set programming
- Structural tractability of enumerating CSP solutions
- On the average-case complexity of parameterized clique
- Modifying a graph using vertex elimination
- Parameterized analysis of paging and list update algorithms
- Using patterns to form homogeneous teams
- A characterisation of clique-width through nested partitions
- Faster parameterized algorithms for deletion to split graphs
- Unifying known lower bounds via geometric complexity theory
- Improved fixed parameter tractable algorithms for two ``edge problems: MAXCUT and MAXDAG
- Parameterized complexity classes beyond para-NP
- Tractability, hardness, and kernelization lower bound for and/or graph solution
- Parameterized complexity of distance labeling and uniform channel assignment problems
- A unified framework for designing EPTAS for load balancing on parallel machines
- Improved PTAS for the constrained \(k\)-means problem
- An \(O^{*}(3.53^{3k})\)-time parameterized algorithm for the 3-set packing problem
- Tractable cases of the extended global cardinality constraint
- Challenges to complexity shields that are supposed to protect elections against manipulation and control: a survey
- Parameterized domination in circle graphs
- A cubic-vertex kernel for flip consensus tree
- Rationalizations of Condorcet-consistent rules via distances of Hamming type
- Tight bounds for parameterized complexity of cluster editing with a small number of clusters
- An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints
- Bounded fixed-parameter tractability and \(\log^{2}n\) nondeterministic bits
- Some notes on bounded starwidth graphs
- Complexity results for rainbow matchings
- Genus characterizes the complexity of certain graph problems: Some tight results
- Fixed-parameter tractability of crossover: steady-state GAs on the closest string problem
- Improved kernels for tracking paths
- Focused jump-and-repair constraint handling for fixed-parameter tractable graph problems closed under induced subgraphs
- Hybridization number on three rooted binary trees is EPT
- Distance-based clique relaxations in networks: s-clique and s-club
- Parameterized complexity: the main ideas and connections to practical computing
- What's next? Future directions in parameterized complexity
- Scattered packings of cycles
- Schulze and ranked-pairs voting are fixed-parameter tractable to bribe, manipulate, and control
- Algorithmic aspect of minus domination on small-degree graphs
- A measure and conquer approach for the parameterized bounded degree-one vertex deletion
- Algorithms and complexity of power domination in graphs
- Bidimensionality and kernels
- Algorithms for Propositional Model Counting
- Improved Algorithms for Bicluster Editing
- Speeding up Dynamic Programming for Some NP-Hard Graph Recoloring Problems
- Fixed Structure Complexity
- New Fixed-Parameter Algorithms for the Minimum Quartet Inconsistency Problem
- Capacitated Domination and Covering: A Parameterized Perspective
- A Purely Democratic Characterization of W[1]
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4503944)
