Pages that link to "Item:Q3448849"

The following pages link to Deterministic Truncation of Linear Matroids (Q3448849):

Displaying 23 items.

• Deterministic parameterized algorithms for the graph motif problem (Q313814) (← links)
• Finding even subgraphs even faster (Q1671994) (← 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)
• Generalized matroid matching (Q2309561) (← links)
• Parameterized counting of trees, forests and matroid bases (Q2399367) (← links)
• Simultaneous feedback edge set: a parameterized perspective (Q2659779) (← links)
• \(p\)-edge/vertex-connected vertex cover: parameterized and approximation algorithms (Q2677827) (← links)
• (Q4554341) (redirect page) (← links)
• (Q4993296) (← links)
• Algorithms for NP-Hard Problems via Rank-Related Parameters of Matrices (Q5042455) (← links)
• (Q5092396) (← links)
• Editing to Connected F-Degree Graph (Q5232130) (← links)
• On the Complexity of Recovering Incidence Matrices (Q5874520) (← links)
• Linear representation of transversal matroids and gammoids parameterized by rank (Q5918110) (← links)
• Parameterized complexity of conflict-free set cover (Q5918356) (← 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)
• Parameterized Counting and Cayley Graph Expanders (Q6158357) (← links)
• Computing paths of large rank in planar frameworks deterministically (Q6668350) (← links)