Pages that link to "Item:Q666659"
From MaRDI portal
The following pages link to Beyond classes of graphs with ``few'' minimal separators: FPT results through potential maximal cliques (Q666659):
Displaying 10 items.
- Algorithms parameterized by vertex cover and modular width, through potential maximal cliques (Q1751087) (← links)
- Subexponential parameterized algorithms and kernelization on almost chordal graphs (Q2037110) (← links)
- A meta-theorem for distributed certification (Q2097341) (← links)
- Finding optimal triangulations parameterized by edge clique cover (Q2161006) (← links)
- Structural parameterizations with modulator oblivion (Q2161010) (← links)
- Beyond Classes of Graphs with “Few” Minimal Separators: FPT Results Through Potential Maximal Cliques (Q2827832) (← links)
- (Q5874519) (← links)
- (Q6089666) (← links)
- (Q6089669) (← links)
- A meta-theorem for distributed certification (Q6182681) (← links)