Pages that link to "Item:Q2037110"
From MaRDI portal
The following pages link to Subexponential parameterized algorithms and kernelization on almost chordal graphs (Q2037110):
Displaying 7 items.
- Approximating the \textsc{Sparsest} \(k\)-\textsc{Subgraph} in chordal graphs (Q260267) (← links)
- Sublinear-time algorithms for approximating graph parameters (Q2075766) (← links)
- Structural parameterizations with modulator oblivion (Q2161010) (← links)
- Parameterized Complexity of the Sparsest k-Subgraph Problem in Chordal Graphs (Q2938098) (← links)
- Subexponential parameterized algorithms for graphs of polynomial growth (Q5111748) (← links)
- Fair allocation algorithms for indivisible items under structured conflict constraints (Q6056608) (← links)
- Treewidth versus clique number. II: Tree-independence number (Q6144406) (← links)