The following pages link to Computing and Combinatorics (Q5717006):
Displaying 16 items.
- The unbiased black-box complexity of partition is polynomial (Q460634) (← links)
- The balanced satisfactory partition problem (Q831826) (← links)
- Satisfactory graph partition, variants, and generalizations (Q976309) (← links)
- On the complexity of assembly partitioning (Q1313730) (← links)
- Momentopes, the complexity of vector partitioning, and Davenport-Schinzel sequences (Q1597685) (← links)
- The \((k, \ell)\) partitioned probe problem: NP-complete versus polynomial dichotomy (Q1686050) (← links)
- Computability of width of submodular partition functions (Q1933647) (← links)
- Asymptotically almost every \(2r\)-regular graph has an internal partition (Q2303426) (← links)
- Degree-constrained decompositions of graphs: Bounded treewidth and planarity (Q2369007) (← links)
- (Q2766993) (← links)
- (Q4472257) (← links)
- On the complexity of some quorum colorings problems of graphs (Q5012382) (← links)
- Stabilization Time in Weighted Minority Processes (Q5090505) (← links)
- Relaxed complete partitions: an error-correcting Bachet's problem (Q5384252) (← links)
- Simplex partitioning via exponential clocks and the multiway cut problem (Q5495824) (← links)
- Parameterized complexity of satisfactory partition problem (Q5918491) (← links)
