Pages that link to "Item:Q1165163"

The following pages link to Dynamic programming meets the principle of inclusion and exclusion (Q1165163):

Displaying 38 items.

• On cutwidth parameterized by vertex cover (Q476444) (← links)
• Solving the train marshalling problem by inclusion-exclusion (Q516904) (← links)
• Circumference of 3-connected claw-free graphs and large Eulerian subgraphs of 3-edge-connected graphs (Q536646) (← links)
• On partitioning a graph into two connected subgraphs (Q650911) (← links)
• Complexity of counting cycles using zeons (Q660812) (← links)
• A finite-difference sieve to count paths and cycles by length (Q673337) (← links)
• A faster tree-decomposition based algorithm for counting linear extensions (Q786030) (← links)
• Set multi-covering via inclusion-exclusion (Q837180) (← links)
• Exact algorithms for exact satisfiability and number of perfect matchings (Q958212) (← links)
• Finding paths of length \(k\) in \(O^{*}(2^k)\) time (Q976105) (← links)
• An exact algorithm for subgraph homeomorphism (Q1044032) (← links)
• Algorithms to count paths and cycles (Q1339379) (← links)
• Parameterized complexity of superstring problems (Q1679230) (← links)
• A Hopf algebra for counting cycles (Q1709547) (← links)
• Enumerating simple paths from connected induced subgraphs (Q1756087) (← links)
• Exact and parameterized algorithms for \textsc{Max Internal Spanning Tree} (Q1939668) (← links)
• Exact algorithms for finding longest cycles in claw-free graphs (Q1939671) (← 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)
• Moderate exponential-time algorithms for scheduling problems (Q2095519) (← links)
• Inclusion/exclusion meets measure and conquer (Q2249747) (← links)
• Computing optimal Steiner trees in polynomial space (Q2392926) (← links)
• A general purpose algorithm for counting simple cycles and simple paths of any length (Q2415361) (← links)
• Sharp separation and applications to exact and parameterized algorithms (Q2429363) (← links)
• Solving SCS for bounded length strings in fewer than \(2^n\) steps (Q2448115) (← links)
• Open problems around exact algorithms (Q2473037) (← links)
• Exact algorithms for the Hamiltonian cycle problem in planar graphs (Q2494820) (← links)
• On Cutwidth Parameterized by Vertex Cover (Q2891354) (← links)
• Invitation to Algorithmic Uses of Inclusion–Exclusion (Q3012908) (← links)
• Faster Steiner Tree Computation in Polynomial-Space (Q3541105) (← links)
• A Faster Tree-Decomposition Based Algorithm for Counting Linear Extensions (Q5009467) (← links)
• Improving TSP Tours Using Dynamic Programming over Tree Decompositions. (Q5111717) (← links)
• (Q5743447) (← links)
• (Q5743515) (← links)
• Collapsing Superstring Conjecture (Q5875478) (← links)
• The Asymmetric Travelling Salesman Problem In Sparse Digraphs. (Q6089670) (← links)
• Moderate worst-case complexity bounds for the permutation flowshop scheduling problem using inclusion-exclusion (Q6103746) (← links)
• Removing popular faces in curve arrangements (Q6636990) (← links)