Roman hitting functions
From MaRDI portal
Cites work
- A complexity theory for hard enumeration problems
- Algorithmic aspects of Roman domination in graphs
- An analysis of the W*-hierarchy
- Approximation algorithms and hardness results for packing element-disjoint Steiner trees in planar graphs
- Bounds on Backtrack Algorithms for Listing Cycles, Paths, and Spanning Trees
- Combinatorics for smaller kernels: the differential of a graph
- Data reductions and combinatorial bounds for improved approximation algorithms
- Domination in hypergraphs
- Efficient algorithms for Roman domination on some classes of graphs
- Efficient enumeration of solutions produced by closure operations
- Efficiently enumerating hitting sets of hypergraphs arising in data profiling
- Efficiently enumerating hitting sets of hypergraphs arising in data profiling
- Enumeration complexity
- Enumeration of minimal dominating sets and variants
- Fundamentals of parameterized complexity
- scientific article; zbMATH DE number 1149451 (Why is no real title available?)
- Identifying the Minimal Transversals of a Hypergraph and Related Problems
- Incremental delay enumeration: space and time
- Minimal Roman dominating functions: extensions and enumeration
- On product covering in 3-tier supply chain models: natural complete problems for W[3] and W[4]
- On the complexity of solution extension of optimization problems
- On the enumeration of minimal dominating sets and related notions
- Parameterized and Exact Computation
- Parametrized complexity theory.
- Perfect Roman domination: aspects of enumeration and parameterization
- R<scp>OMAN DOMINATION</scp>: a parameterized perspective†
- Roman census: enumerating and counting Roman dominating functions on graph classes
- Roman domination in graphs.
- The complexity of dependency detection and discovery in relational databases
- The differential and the roman domination number of a graph
- The minimal hitting set generation problem: algorithms and computation
- Threshold dominating sets and an improved characterization of \(W[2]\)
- Topics in Domination in Graphs
This page was built for publication: Roman hitting functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7255462)
