Pages that link to "Item:Q3549598"
From MaRDI portal
The following pages link to Fourier meets M\"{o}bius: fast subset convolution (Q3549598):
Displaying 50 items.
- Fast Möbius inversion in semimodular lattices and ER-labelable posets (Q311532) (← links)
- Treewidth and pathwidth parameterized by the vertex cover number (Q344839) (← links)
- Parameterized complexity of Min-power multicast problems in wireless ad hoc networks (Q388087) (← links)
- Subexponential parameterized algorithms (Q458457) (← links)
- Confronting intractability via parameters (Q465686) (← links)
- An FPT algorithm in polynomial space for the directed Steiner tree problem with limited number of diffusing nodes (Q477657) (← links)
- Solving the 2-disjoint connected subgraphs problem faster than \(2^n\) (Q486988) (← links)
- Definition and algorithms for reliable Steiner tree problem (Q498083) (← links)
- Exact algorithms for minimum weighted dominating induced matching (Q521800) (← links)
- Scheduling partially ordered jobs faster than \(2^n\) (Q528859) (← links)
- Complexity issues in vertex-colored graph pattern matching (Q533412) (← links)
- Breaking the \(2^{n}\)-barrier for irredundance: two lines of attack (Q635734) (← links)
- An exact algorithm for connected red-blue dominating set (Q635737) (← links)
- An exact algorithm for the Boolean connectivity problem for \(k\)-CNF (Q638525) (← links)
- Exact and approximate bandwidth (Q708223) (← links)
- On the terminal connection problem (Q831820) (← links)
- Structural parameterizations of clique coloring (Q832512) (← links)
- Set multi-covering via inclusion-exclusion (Q837180) (← links)
- An efficient tree decomposition method for permanents and mixed discriminants (Q905704) (← links)
- Dynamic programming based algorithms for set multicover and multiset multicover problems (Q974740) (← links)
- Computing rank-width exactly (Q989474) (← links)
- Vertex and edge covers with clustering properties: Complexity and algorithms (Q1026225) (← links)
- An exact algorithm for subgraph homeomorphism (Q1044032) (← links)
- Parameterized approximation via fidelity preserving transformations (Q1686226) (← links)
- A faster parameterized algorithm for pseudoforest deletion (Q1693129) (← links)
- Clifford algebras meet tree decompositions (Q1725639) (← links)
- The parameterized complexity of the rainbow subgraph problem (Q1736640) (← links)
- Complexity of Grundy coloring and its variants (Q1752449) (← links)
- Parameterized algorithms for Max Colorable Induced Subgraph problem on perfect graphs (Q1755775) (← links)
- Improved Steiner tree algorithms for bounded treewidth (Q1932355) (← links)
- Exact and parameterized algorithms for \textsc{Max Internal Spanning Tree} (Q1939668) (← links)
- Covering and packing in linear space (Q1944195) (← links)
- Faster algorithm for optimum Steiner trees (Q1944205) (← links)
- Capacitated domination faster than \(O(2^n)\) (Q1944213) (← links)
- Fast polynomial-space algorithms using inclusion-exclusion. Improving on Steiner tree and related problems (Q1949736) (← links)
- Finding and counting vertex-colored subtrees (Q1949738) (← links)
- Trimmed Moebius inversion and graphs of bounded degree (Q1959390) (← links)
- Algebraic methods in the congested clique (Q2010605) (← links)
- Structurally parameterized \(d\)-scattered set (Q2064293) (← links)
- Revising Johnson's table for the 21st century (Q2091799) (← links)
- A generic convolution algorithm for join operations on tree decompositions (Q2117110) (← links)
- Parameterized algorithms for Steiner tree and dominating set: bounding the leafage by the vertex leafage (Q2154102) (← links)
- Finding optimal triangulations parameterized by edge clique cover (Q2161006) (← links)
- On the fine-grained parameterized complexity of partial scheduling to minimize the makespan (Q2161009) (← links)
- Inclusion/exclusion meets measure and conquer (Q2249747) (← links)
- Parameterized complexity of spare capacity allocation and the multicost Steiner subgraph problem (Q2253903) (← links)
- Algorithmic aspects of Steiner convexity and enumeration of Steiner trees (Q2259027) (← links)
- Iterative compression and exact algorithms (Q2268862) (← links)
- Facility location problems: a parameterized view (Q2275913) (← links)
- Width, depth, and space: tradeoffs between branching and dynamic programming (Q2287480) (← links)
