Pages that link to "Item:Q3558013"
From MaRDI portal
The following pages link to Set Partitioning via Inclusion-Exclusion (Q3558013):
Displaying 50 items.
- Assigning channels via the meet-in-the-middle approach (Q289931) (← links)
- Rural postman parameterized by the number of components of required edges (Q314816) (← links)
- On the parameterized complexity of b-\textsc{chromatic number} (Q340565) (← links)
- An exponential time 2-approximation algorithm for bandwidth (Q392018) (← links)
- On exact algorithms for the permutation CSP (Q392031) (← links)
- An exact exponential time algorithm for counting bipartite cliques (Q436594) (← links)
- Computing hypergraph width measures exactly (Q437685) (← links)
- Regular inference as vertex coloring (Q465248) (← links)
- Approximating MAX SAT by moderately exponential and parameterized algorithms (Q477187) (← links)
- Solving the 2-disjoint connected subgraphs problem faster than \(2^n\) (Q486988) (← links)
- Efficient algorithms for the \textsc{max~\(k\)-vertex cover problem} (Q489714) (← links)
- An initial study of time complexity in infinite-domain constraint satisfaction (Q514144) (← links)
- Solving the train marshalling problem by inclusion-exclusion (Q516904) (← links)
- Scheduling partially ordered jobs faster than \(2^n\) (Q528859) (← links)
- Breaking the \(2^{n}\)-barrier for irredundance: two lines of attack (Q635734) (← links)
- New plain-exponential time classes for graph homomorphism (Q639844) (← links)
- On partitioning a graph into two connected subgraphs (Q650911) (← links)
- Multivariate analysis of orthogonal range searching and graph distances (Q786041) (← links)
- Dual parameterization of weighted coloring (Q786042) (← links)
- Set multi-covering via inclusion-exclusion (Q837180) (← links)
- Coalition structure generation: a survey (Q900307) (← links)
- A hybrid exact algorithm for complete set partitioning (Q901033) (← links)
- Dynamic programming based algorithms for set multicover and multiset multicover problems (Q974740) (← links)
- Efficient approximation of Min Set Cover by moderately exponential algorithms (Q1019736) (← links)
- Strong valid inequalities for Boolean logical pattern generation (Q1675646) (← links)
- Exact and superpolynomial approximation algorithms for the \textsc{densest \textit{K}-subgraph} problem (Q1683124) (← links)
- Parameterized approximation via fidelity preserving transformations (Q1686226) (← links)
- Fixing improper colorings of graphs (Q1698729) (← links)
- The parameterized complexity of the rainbow subgraph problem (Q1736640) (← links)
- Algorithms for dominating clique problems (Q1758169) (← links)
- Channel assignment via fast zeta transform (Q1944122) (← links)
- Covering and packing in linear space (Q1944195) (← links)
- Fast polynomial-space algorithms using inclusion-exclusion. Improving on Steiner tree and related problems (Q1949736) (← links)
- Decomposition of realizable fuzzy relations (Q1955454) (← links)
- Enumerating the edge-colourings and total colourings of a regular graph (Q1956248) (← links)
- Trimmed Moebius inversion and graphs of bounded degree (Q1959390) (← links)
- Algebraic methods in the congested clique (Q2010605) (← links)
- Improved algorithm to determine 3-colorability of graphs with minimum degree at least 7 (Q2028085) (← links)
- Notes on tree- and path-chromatic number (Q2058953) (← links)
- Exact algorithms for counting 3-colorings of graphs (Q2081467) (← links)
- Moderate exponential-time algorithms for scheduling problems (Q2095519) (← links)
- Fine-grained parameterized complexity analysis of graph coloring problems (Q2112649) (← links)
- A branch and price algorithm for list coloring problem (Q2132397) (← links)
- Induced star partition of graphs (Q2161236) (← links)
- List-coloring -- parameterizing from triviality (Q2173305) (← links)
- Parameterized complexity of happy coloring problems (Q2192381) (← links)
- Inclusion/exclusion meets measure and conquer (Q2249747) (← links)
- New potential functions for greedy independence and coloring (Q2255044) (← links)
- New tools and connections for exponential-time approximation (Q2272598) (← links)
- A complexity dichotomy for critical values of the \(b\)-chromatic number of graphs (Q2310757) (← links)
