Pages that link to "Item:Q3654388"

The following pages link to Randomized Divide-and-Conquer: Improved Path, Matching, and Packing Algorithms (Q3654388):

Displaying 37 items.

• Assigning channels via the meet-in-the-middle approach (Q289931) (← links)
• Parameterized and approximation algorithms for finding two disjoint matchings (Q300238) (← links)
• Parameterized approximation algorithms for packing problems (Q313963) (← links)
• Improved deterministic algorithms for weighted matching and packing problems (Q534565) (← links)
• Parameterized algorithms for list \(K\)-cycle (Q666679) (← links)
• Algorithm for finding \(k\)-vertex out-trees and its application to \(k\)-internal out-branching problem (Q988577) (← links)
• Designing deterministic polynomial-space algorithms by color-coding multivariate polynomials (Q1747489) (← links)
• Long directed \((s,t)\)-path: FPT algorithm (Q1799598) (← links)
• A \(2^{O(k)}n\) algorithm for \(k\)-cycle in minor-closed graph families (Q2006778) (← links)
• Partial information network queries (Q2018546) (← links)
• Parameterized complexity of \textsc{maximum edge colorable subgraph} (Q2019513) (← links)
• Parameterized complexity of maximum edge colorable subgraph (Q2088595) (← links)
• Faster deterministic parameterized algorithm for \(k\)-path (Q2272387) (← links)
• Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth (Q2347800) (← links)
• The parameterized complexity of unique coverage and its variants (Q2392923) (← links)
• Narrow sieves for parameterized paths and packings (Q2396725) (← links)
• Improved parameterized algorithms for network query problems (Q2414861) (← links)
• Contracting graphs to paths and trees (Q2441588) (← links)
• Digraph width measures in parameterized algorithmics (Q2442211) (← links)
• Edge-disjoint packing of stars and cycles (Q2629232) (← links)
• Parameterized algorithms for edge biclique and related problems (Q2636505) (← links)
• QUBO formulations of the longest path problem (Q2658047) (← links)
• Parameterized Complexity and Subexponential-Time Computability (Q2908538) (← links)
• Improved Parameterized Algorithms for Network Query Problems (Q2946028) (← links)
• Deterministic Algorithms for Matching and Packing Problems Based on Representative Sets (Q3195130) (← links)
• Spotting Trees with Few Leaves (Q3448789) (← links)
• Mixing Color Coding-Related Techniques (Q3452864) (← links)
• Edge-Disjoint Packing of Stars and Cycles (Q3467879) (← links)
• On Digraph Width Measures in Parameterized Algorithmics (Q3656861) (← links)
• Finding Detours is Fixed-Parameter Tractable (Q4972756) (← links)
• (Q5075790) (← links)
• Approximate Counting of k-Paths: Deterministic and in Polynomial Space (Q5091173) (← links)
• Going Far from Degeneracy (Q5130907) (← links)
• Spotting Trees with Few Leaves (Q5346548) (← links)
• The \(k\)-distinct language: parameterized automata constructions (Q5964071) (← links)
• Detours in directed graphs (Q6113279) (← links)
• Parameterized Counting and Cayley Graph Expanders (Q6158357) (← links)