Pages that link to "Item:Q1035682"

The following pages link to A parameterized view on matroid optimization problems (Q1035682):

Displaying 36 items.

• Stable assignment with couples: parameterized complexity and local search (Q456691) (← links)
• Representative families: a unified tradeoff-based approach (Q899582) (← links)
• Finding even subgraphs even faster (Q1671994) (← links)
• A randomized polynomial kernel for subset feedback vertex set (Q1702849) (← links)
• Full spark frames (Q1934656) (← links)
• Finding temporal paths under waiting time constraints (Q1979453) (← links)
• Representative families for matroid intersections, with applications to location, packing, and covering problems (Q2028091) (← links)
• Complexity of packing common bases in matroids (Q2039228) (← links)
• Parameterized complexity of conflict-free matchings and paths (Q2182094) (← links)
• Matrix approach to spanning matroids of rough sets and its application to attribute reduction (Q2238210) (← links)
• Speeding up dynamic programming with representative sets: an experimental evaluation of algorithms for Steiner Tree on tree decompositions (Q2343089) (← links)
• Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth (Q2347800) (← links)
• Parameterized counting of trees, forests and matroid bases (Q2399367) (← links)
• Similarity of binary relations based on rough set theory and topology: an application for topological structures of matroids (Q2403318) (← links)
• On kernelization and approximation for the vector connectivity problem (Q2408198) (← links)
• Simultaneous feedback edge set: a parameterized perspective (Q2659779) (← links)
• \(p\)-edge/vertex-connected vertex cover: parameterized and approximation algorithms (Q2677827) (← links)
• A Randomized Polynomial Kernelization for Vertex Cover with a Smaller Parameter (Q3177162) (← links)
• Deterministic Subgraph Detection in Broadcast CONGEST. (Q3300802) (← links)
• Deterministic Truncation of Linear Matroids (Q3448849) (← links)
• Mixing Color Coding-Related Techniques (Q3452864) (← links)
• (Q4993296) (← links)
• (Q5002776) (← links)
• (Q5092396) (← links)
• Editing to Connected F-Degree Graph (Q5232130) (← links)
• Parallel algorithms for matroid intersection and matroid parity (Q5261053) (← links)
• (Q5743380) (← links)
• Linear representation of transversal matroids and gammoids parameterized by rank (Q5918110) (← links)
• Parameterized complexity of conflict-free set cover (Q5918356) (← links)
• Fast exact algorithms for survivable network design with uniform requirements (Q5918784) (← links)
• Parameterized complexity of geometric covering problems having conflicts (Q5919304) (← links)
• Finding Temporal Paths Under Waiting Time Constraints. (Q6065432) (← links)
• FPT-Algorithms for the \(\ell\) -Matchoid Problem with a Coverage Objective (Q6100609) (← links)
• Multistage \(s-t\) path: confronting similarity with dissimilarity (Q6107891) (← links)
• Representing matroids over the reals is \(\exists \mathbb{R}\)-complete (Q6606993) (← links)
• Computing paths of large rank in planar frameworks deterministically (Q6668350) (← links)