Pages that link to "Item:Q328713"
From MaRDI portal
The following pages link to A complexity dichotomy and a new boundary class for the dominating set problem (Q328713):
Displayed 8 items.
- On lattice point counting in \(\varDelta\)-modular polyhedra (Q2162684) (← links)
- FPT-algorithm for computing the width of a simplex given by a convex hull (Q2314204) (← links)
- Boundary classes for graph problems involving non-local properties (Q2401761) (← links)
- Polynomially bounding the number of minimal separators in graphs: reductions, sufficient conditions, and a dichotomy theorem (Q2656894) (← links)
- Treewidth versus Clique Number. I. Graph Classes with a Forbidden Structure (Q5013568) (← links)
- (Q6054225) (← links)
- Critical properties of bipartite permutation graphs (Q6142657) (← links)
- On \(\Delta\)-modular integer linear problems in the canonical form and equivalent problems (Q6200377) (← links)