Recommendations
Cited in
(only showing first 100 items - show all)- An exponential time 2-approximation algorithm for bandwidth
- On exact algorithms for the permutation CSP
- On independent sets and bicliques in graphs
- Dominator coloring and CD coloring in almost cluster graphs
- A space efficient algorithm for multiset multicover with multiplicity constraints problem via algebraic method
- scientific article; zbMATH DE number 7559154 (Why is no real title available?)
- Chromatic kernel and its applications
- The parameterized complexity of the rainbow subgraph problem
- Sharp separation and applications to exact and parameterized algorithms
- The parameterized complexity of the rainbow subgraph problem
- Tight lower bounds for the complexity of multicoloring
- Fine-grained parameterized complexity analysis of graph coloring problems
- Dominator coloring and CD coloring in almost cluster graphs
- Algorithms and bounds for very strong rainbow coloring
- Kernels for storage capacity and dual index coding
- Fixed-parameter tractability of (n-k) list coloring
- Parameterized complexity of the workflow satisfiability problem
- Exact exponential algorithms for clustering problems
- Faster algorithm for unique (k,2)-CSP
- Partition into triangles on bounded degree graphs
- Set multi-covering via inclusion-exclusion
- Approximate min-sum subset convolution
- Efficient approximation of Min Set Cover by moderately exponential algorithms
- Determining the \(L(2,1)\)-span in polynomial space
- New exact algorithms for the 2-constraint satisfaction problem
- Simplifying Inclusion–Exclusion Formulas
- Solving the list coloring problem through a branch-and-price algorithm
- On the parameterized complexity of compact set packing
- Finding disjoint paths in networks with star shared risk link groups
- scientific article; zbMATH DE number 7758308 (Why is no real title available?)
- Counting problems in parameterized complexity
- Fine-Grained Reductions and Quantum Speedups for Dynamic Programming.
- Assigning channels via the meet-in-the-middle approach
- New Plain-Exponential Time Classes for Graph Homomorphism
- A branch and price algorithm for list coloring problem
- An exact exponential time algorithm for counting bipartite cliques
- Computing hypergraph width measures exactly
- Counting independent sets in claw-free graphs
- Parameterized pre-coloring extension and list coloring problems
- Computing the chromatic number using graph decompositions via matrix rank
- scientific article; zbMATH DE number 7250146 (Why is no real title available?)
- Algorithms for dominating clique problems
- Fine-grained complexity of the graph homomorphism problem for bounded-treewidth graphs
- Harmonious coloring: parameterized algorithms and upper bounds
- Exponential-time quantum algorithms for graph coloring problems
- Complexity and approximability of optimal resource allocation and Nash equilibrium over networks
- Complexity of fall coloring for restricted graph classes
- Fine-grained parameterized complexity analysis of graph coloring problems
- Parameterized exact and approximation algorithms for maximum k-set cover and related satisfiability problems
- Improved algorithm to determine 3-colorability of graphs with minimum degree at least 7
- First-order logic with metric betweenness – the case of non-definability of some graph classes
- Moderate exponential-time algorithms for scheduling problems
- Dynamic programming based algorithms for set multicover and multiset multicover problems
- scientific article; zbMATH DE number 5812481 (Why is no real title available?)
- Fast polynomial-space algorithms using inclusion-exclusion. Improving on Steiner tree and related problems
- Enumerating the edge-colourings and total colourings of a regular graph
- A complexity dichotomy for critical values of the b-chromatic number of graphs
- scientific article; zbMATH DE number 7471677 (Why is no real title available?)
- Tensor network complexity of multilinear maps
- Rural postman parameterized by the number of components of required edges
- A Faster Exponential Time Algorithm for Bin Packing With a Constant Number of Bins via Additive Combinatorics
- Dual parameterization of weighted coloring
- Invitation to Algorithmic Uses of Inclusion–Exclusion
- Counting perfect matchings as fast as Ryser
- Faster exponential-time algorithms in graphs of bounded average degree
- Breaking the \(2^{n}\)-barrier for irredundance: two lines of attack
- A hybrid exact algorithm for complete set partitioning
- On the parameterized complexity of compact set packing
- Testing the Complexity of a Valued CSP Language
- Dual parameterization of weighted coloring
- Partition into triangles on bounded degree graphs
- Regular inference as vertex coloring
- Exploiting dense structures in parameterized complexity
- Fine-grained complexity of the list homomorphism problem: feedback vertex set and cutwidth
- Computing generalized convolutions faster than brute force
- Families with infants: speeding up algorithms for NP-hard problems using FFT
- Lower bounds for the graph homomorphism problem
- Parameterized and exact algorithms for class domination coloring
- Parameterized and exact algorithms for class domination coloring
- Fast zeta transforms for lattices with few irreducibles
- Breaking the 2ⁿ barrier for 5-coloring and 6-coloring
- Feedback vertex sets in tournaments
- Computation of Hadwiger number and related contraction problems: tight lower bounds
- Narrow sieves for parameterized paths and packings
- A new genetic algorithm encoding for coalition structure generation problems
- Nonuniform ACC circuit lower bounds
- Induced star partition of graphs
- Finding large set covers faster via the representation method
- Strong valid inequalities for Boolean logical pattern generation
- An algorithm for partitioning a set into simple parts
- Approximating MAX SAT by moderately exponential and parameterized algorithms
- Coalition structure generation: a survey
- Some Cardinal Estimations via the Inclusion-Exclusion Principle in Finite $$T_0$$ Topological Spaces
- On the parameterized complexity of b-\textsc{chromatic number}
- On connections between k-coloring and Euclidean k-means
- Efficient Approximation of Combinatorial Problems by Moderately Exponential Algorithms
- Harmonious coloring: parameterized algorithms and upper bounds
- Polynomial formulations as a barrier for reduction-based hardness proofs
- scientific article; zbMATH DE number 7651213 (Why is no real title available?)
- Channel assignment via fast zeta transform
This page was built for publication: Set partitioning via inclusion-exclusion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3558013)
