The following pages link to (Q3386630):
Displaying 6 items.
- Simplified algorithmic metatheorems beyond MSO: treewidth and neighborhood diversity (Q1687933) (← links)
- Default logic and bounded treewidth (Q5915667) (← links)
- A tight approximation algorithm for the cluster vertex deletion problem (Q5925651) (← links)
- Principled deep neural network training through linear programming (Q6054389) (← links)
- The role of rationality in integer-programming relaxations (Q6126664) (← links)
- Slack matrices, \(k\)-products, and 2-level polytopes (Q6558684) (← links)
