Pages that link to "Item:Q2174563"

The following pages link to Mim-width. I. Induced path problems (Q2174563):

Displaying 15 items.

• Induced disjoint paths in AT-free graphs (Q2051862) (← links)
• Few induced disjoint paths for \(H\)-free graphs (Q2098179) (← links)
• List \(k\)-colouring \(P_t\)-free graphs: a mim-width perspective (Q2234796) (← links)
• Mim-width. II. The feedback vertex set problem (Q2285053) (← links)
• New formulations and branch-and-cut procedures for the longest induced path problem (Q2669795) (← links)
• On algorithmic applications of sim-width and mim-width of \((H_1,H_2)\)-free graphs (Q2697441) (← links)
• Distance Domination in Graphs (Q3384610) (← links)
• More Applications of the $d$-Neighbor Equivalence: Acyclicity and Connectivity Constraints (Q5009336) (← links)
• Induced disjoint paths and connected subgraphs for \(H\)-free graphs (Q6053467) (← links)
• Fair allocation algorithms for indivisible items under structured conflict constraints (Q6056608) (← links)
• Bounding the mim‐width of hereditary graph classes (Q6056798) (← links)
• MIP formulations for induced graph optimization problems: a tutorial (Q6056886) (← links)
• Contracting to a longest path in H-free graphs (Q6065420) (← links)
• Bounding the Mim-Width of Hereditary Graph Classes. (Q6089650) (← links)
• Blazing a trail via matrix multiplications: a faster algorithm for non-shortest induced paths (Q6647761) (← links)