Pages that link to "Item:Q2954371"
From MaRDI portal
The following pages link to Large Induced Subgraphs via Triangulations and CMSO (Q2954371):
Displaying 37 items.
- Enumerating minimal connected dominating sets in graphs of bounded chordality (Q278724) (← links)
- Largest chordal and interval subgraphs faster than \(2^n\) (Q329301) (← links)
- Beyond classes of graphs with ``few'' minimal separators: FPT results through potential maximal cliques (Q666659) (← links)
- Degree-constrained orientation of maximum satisfaction: graph classes and parameterized complexity (Q724225) (← links)
- iTri: index-based triangle listing in massive graphs (Q1671265) (← links)
- Algorithms parameterized by vertex cover and modular width, through potential maximal cliques (Q1751087) (← links)
- Vertex deletion problems on chordal graphs (Q1786595) (← links)
- Subexponential parameterized algorithms and kernelization on almost chordal graphs (Q2037110) (← links)
- Subexponential-time algorithms for finding large induced sparse subgraphs (Q2041989) (← links)
- Avoidable vertices and edges in graphs: existence, characterization, and applications (Q2065802) (← links)
- Finding optimal triangulations parameterized by edge clique cover (Q2161006) (← links)
- Structural parameterizations with modulator oblivion (Q2161010) (← links)
- Summarized bit batch-based triangle listing in massive graphs (Q2195476) (← links)
- On the tractability of optimization problems on \(H\)-graphs (Q2196605) (← links)
- Covering minimal separators and potential maximal cliques in \(P_t\)-free graphs (Q2227825) (← links)
- Polynomially bounding the number of minimal separators in graphs: reductions, sufficient conditions, and a dichotomy theorem (Q2656894) (← links)
- Finding a maximum minimal separator: graph classes and fixed-parameter tractability (Q2661784) (← links)
- On the Number of Minimal Separators in Graphs (Q2827806) (← links)
- Beyond Classes of Graphs with “Few” Minimal Separators: FPT Results Through Potential Maximal Cliques (Q2827832) (← links)
- On Distance-d Independent Set and Other Problems in Graphs with “few” Minimal Separators (Q3181057) (← links)
- Solving Graph Problems via Potential Maximal Cliques (Q4629543) (← links)
- (Q5009489) (← links)
- (Q5009589) (← links)
- An Improvement of Reed’s Treewidth Approximation (Q5049997) (← links)
- (Q5089231) (← links)
- (Q5115821) (← links)
- Vertex Deletion Problems on Chordal Graphs (Q5136314) (← links)
- Finding Large $H$-Colorable Subgraphs in Hereditary Graph Classes (Q5163508) (← links)
- (Q5874504) (← links)
- (Q5874519) (← links)
- On \(H\)-topological intersection graphs (Q5925535) (← links)
- (Q6089666) (← links)
- (Q6089669) (← links)
- Treewidth versus clique number. II: Tree-independence number (Q6144406) (← links)
- A meta-theorem for distributed certification (Q6182681) (← links)
- Induced subgraphs of bounded treewidth and the container method (Q6550989) (← links)
- Taming graphs with no large creatures and skinny ladders (Q6654126) (← links)
