Pages that link to "Item:Q4210668"

The following pages link to On the computational complexity of (O,P)-partition problems (Q4210668):

Displaying 17 items.

• The unbiased black-box complexity of partition is polynomial (Q460634) (← links)
• A comment on \('''NP=P?'\) and restricted partitions'' (Q1083850) (← links)
• Momentopes, the complexity of vector partitioning, and Davenport-Schinzel sequences (Q1597685) (← links)
• Parameterized algorithms for recognizing monopolar and 2-subcolorable graphs (Q1678166) (← links)
• The \((k, \ell)\) partitioned probe problem: NP-complete versus polynomial dichotomy (Q1686050) (← links)
• Computational aspects of greedy partitioning of graphs (Q1702844) (← links)
• Vertex-partitioning into fixed additive induced-hereditary properties is NP-hard (Q1883661) (← links)
• Computability of width of submodular partition functions (Q1933647) (← links)
• Stable-\(\Pi\) partitions of graphs (Q2255049) (← links)
• The computational complexity of disconnected cut and \(2 K_2\)-partition (Q2259853) (← links)
• (Q5009615) (← links)
• Inductive graph invariants and approximation algorithms (Q5101914) (← links)
• Recognizing Graphs Close to Bipartite Graphs (Q5111287) (← links)
• Solving Partition Problems Almost Always Requires Pushing Many Vertices Around (Q5220192) (← links)
• Between 2- and 3-colorability (Q5902303) (← links)
• Recognizing graphs close to bipartite graphs with an application to colouring reconfiguration (Q6056774) (← links)
• Intersection of chordal graphs and some related partition problems (Q6657232) (← links)