Pages that link to "Item:Q3177805"
From MaRDI portal
The following pages link to Efficient Computation of Representative Families with Applications in Parameterized and Exact Algorithms (Q3177805):
Displaying 50 items.
- Parameterized algorithms for list \(K\)-cycle (Q666679) (← links)
- Structural parameterizations of undirected feedback vertex set: FPT algorithms and kernelization (Q722549) (← links)
- Bivariate complexity analysis of \textsc{Almost Forest Deletion} (Q1686068) (← links)
- Path-contractions, edge deletions and connectivity preservation (Q1713475) (← links)
- Designing deterministic polynomial-space algorithms by color-coding multivariate polynomials (Q1747489) (← links)
- Parameterized algorithms for Max Colorable Induced Subgraph problem on perfect graphs (Q1755775) (← links)
- Long directed \((s,t)\)-path: FPT algorithm (Q1799598) (← links)
- Finding temporal paths under waiting time constraints (Q1979453) (← links)
- A \(2^{O(k)}n\) algorithm for \(k\)-cycle in minor-closed graph families (Q2006778) (← links)
- Representative families for matroid intersections, with applications to location, packing, and covering problems (Q2028091) (← links)
- Subexponential parameterized algorithms and kernelization on almost chordal graphs (Q2037110) (← links)
- Hitting forbidden induced subgraphs on bounded treewidth graphs (Q2051840) (← links)
- A faster parameterized algorithm for temporal matching (Q2059876) (← links)
- Parameterized complexity of multi-node hubs (Q2084737) (← links)
- Partial vertex cover on graphs of bounded degeneracy (Q2097233) (← links)
- A note on algebraic techniques for subgraph detection (Q2122786) (← links)
- Parameterized complexity of conflict-free matchings and paths (Q2182094) (← links)
- Revisiting the parameterized complexity of maximum-duo preservation string mapping (Q2210511) (← links)
- Faster deterministic parameterized algorithm for \(k\)-path (Q2272387) (← links)
- Generalized feedback vertex set problems on bounded-treewidth graphs: chordality is the key to single-exponential parameterized algorithms (Q2272595) (← links)
- Hitting minors on bounded treewidth graphs. III. Lower bounds (Q2301360) (← links)
- Hitting minors on bounded treewidth graphs. II. Single-exponential algorithms (Q2304558) (← links)
- Two edge-disjoint paths with length constraints (Q2330117) (← links)
- Computing the chromatic number using graph decompositions via matrix rank (Q2330132) (← links)
- Finding, hitting and packing cycles in subexponential time on unit disk graphs (Q2334507) (← links)
- Speeding up dynamic programming with representative sets: an experimental evaluation of algorithms for Steiner Tree on tree decompositions (Q2343089) (← links)
- Narrow sieves for parameterized paths and packings (Q2396725) (← links)
- A multivariate framework for weighted FPT algorithms (Q2402359) (← links)
- Fast exact algorithms for some connectivity problems parameterized by clique-width (Q2420640) (← links)
- Gerrymandering on graphs: computational complexity and parameterized algorithms (Q2670918) (← links)
- Discriminantal subset convolution: refining exterior-algebraic methods for parameterized algorithms (Q2672945) (← links)
- \(p\)-edge/vertex-connected vertex cover: parameterized and approximation algorithms (Q2677827) (← links)
- On computing the Hamiltonian index of graphs (Q2699968) (← links)
- Deterministic Algorithms for Matching and Packing Problems Based on Representative Sets (Q3195130) (← links)
- Evaluation and Enumeration Problems for Regular Path Queries (Q3305367) (← links)
- Finding Detours is Fixed-Parameter Tractable (Q4972756) (← links)
- More Applications of the $d$-Neighbor Equivalence: Acyclicity and Connectivity Constraints (Q5009336) (← links)
- (Q5009465) (← links)
- Computing the Chromatic Number Using Graph Decompositions via Matrix Rank (Q5009610) (← links)
- On Computing the Hamiltonian Index of Graphs (Q5042256) (← links)
- Four Shorts Stories on Surprising Algorithmic Uses of Treewidth (Q5042454) (← links)
- Algorithms for NP-Hard Problems via Rank-Related Parameters of Matrices (Q5042455) (← links)
- (Q5075762) (← links)
- (Q5075790) (← links)
- Hitting Forbidden Induced Subgraphs on Bounded Treewidth Graphs (Q5089257) (← links)
- Approximate Counting of k-Paths: Deterministic and in Polynomial Space (Q5091173) (← links)
- Decomposition of Map Graphs with Applications. (Q5091217) (← links)
- (Q5092396) (← links)
- Hitting Minors on Bounded Treewidth Graphs. I. General Upper Bounds (Q5130572) (← links)
- Going Far from Degeneracy (Q5130907) (← links)
