Pages that link to "Item:Q2392247"

The following pages link to Partition into triangles on bounded degree graphs (Q2392247):

Displaying 16 items.

• Scheduling with interjob communication on parallel processors (Q1631686) (← links)
• Geometric versions of the three-dimensional assignment problem under general norms (Q1751127) (← links)
• Two-machine open shop problem with agreement graph (Q2333794) (← links)
• A complexity and approximation framework for the maximization scaffolding problem (Q2354768) (← links)
• The complexity of degree anonymization by graph contractions (Q2407102) (← links)
• An improved kernel for planar vertex-disjoint triangle packing (Q2672577) (← links)
• On the parameterized complexity of clustering problems for incomplete data (Q2689366) (← links)
• Subexponential Time Algorithms for Finding Small Tree and Path Decompositions (Q3452781) (← links)
• Star Partitions of Perfect Graphs (Q5167740) (← links)
• Packing Cycles Faster Than Erdos--Posa (Q5232148) (← links)
• A randomized approximation algorithm for metric triangle packing (Q5918266) (← links)
• Matching cut in graphs with large minimum degree (Q5925521) (← links)
• Packing \(K_r\)s in bounded degree graphs (Q6497939) (← links)
• A deterministic approximation algorithm for metric triangle packing (Q6589849) (← links)
• An improved approximation algorithm for metric triangle packing (Q6636067) (← links)
• Egalitarian roommate allocations: complexity and stability (Q6658303) (← links)