The following pages link to (Q4542518):
Displaying 10 items.
- Characterizing and computing minimal cograph completions (Q972335) (← links)
- Subexponential parameterized algorithms and kernelization on almost chordal graphs (Q2037110) (← links)
- Parameterized complexity: the main ideas and connections to practical computing (Q2841253) (← links)
- Recognizing Sparse Perfect Elimination Bipartite Graphs (Q3007647) (← links)
- Characterizing and Computing Minimal Cograph Completions (Q3507328) (← links)
- Fast Computation of Minimal Fill Inside A Given Elimination Ordering (Q3642841) (← links)
- Minimum Fill-In: Inapproximability and Almost Tight Lower Bounds (Q4575794) (← links)
- (Q5743514) (← links)
- (Q5874519) (← links)
- Minus domination in small-degree graphs (Q5928868) (← links)