Pages that link to "Item:Q5369520"
From MaRDI portal
The following pages link to Extension Complexity, MSO Logic, and Treewidth (Q5369520):
Displaying 10 items.
- Smaller extended formulations for the spanning tree polytope of bounded-genus graphs (Q527446) (← links)
- Simplified algorithmic metatheorems beyond MSO: treewidth and neighborhood diversity (Q1687933) (← links)
- Extended formulations for vertex cover (Q1790198) (← links)
- Strong reductions for extended formulations (Q1801022) (← links)
- New limits of treewidth-based tractability in optimization (Q2118087) (← links)
- Smaller extended formulations for spanning tree polytopes in minor-closed classes and beyond (Q2121739) (← links)
- Extension complexity of the correlation polytope (Q2294265) (← links)
- Parameterized extension complexity of independent set and related problems (Q2413967) (← links)
- Macro Tree Translations of Linear Size Increase are MSO Definable (Q4429669) (← links)
- Default logic and bounded treewidth (Q5915667) (← links)