Pages that link to "Item:Q4443106"

The following pages link to Bipartite Domination and Simultaneous Matroid Covers (Q4443106):

Displaying 30 items.

• Graphs with maximal induced matchings of the same size (Q344824) (← links)
• On distance-3 matchings and induced matchings (Q716178) (← links)
• Approximability results for the maximum and minimum maximal induced matching problems (Q937401) (← links)
• Approximation hardness of dominating set problems in bounded degree graphs (Q958303) (← links)
• Maximum induced matchings for chordal graphs in linear time (Q1018044) (← links)
• The parameterized complexity of the induced matching problem (Q1028465) (← links)
• Brambles and independent packings in chordal graphs (Q1045070) (← links)
• Induced matchings in intersection graphs. (Q1427466) (← links)
• On the approximability of the maximum induced matching problem (Q1775017) (← links)
• On the computational complexity of the Helly number in the \(P_3\) and related convexities (Q2132356) (← links)
• Parameterized algorithms and kernels for almost induced matching (Q2210504) (← links)
• The complexity of dissociation set problems in graphs (Q2275943) (← links)
• Moderately exponential time algorithms for the maximum induced matching problem (Q2355320) (← links)
• Exact algorithms for maximum induced matching (Q2407101) (← links)
• The graphs with maximum induced matching and maximum matching the same size (Q2568473) (← links)
• Independent packings in structured graphs (Q2583122) (← links)
• Perfectly matched sets in graphs: parameterized and exact computation (Q2697539) (← links)
• Almost Induced Matching: Linear Kernels and Parameterized Algorithms (Q3181060) (← links)
• On Distance-3 Matchings and Induced Matchings (Q3655145) (← links)
• (Q4691867) (← links)
• (Q4691905) (← links)
• (Q4691914) (← links)
• Well-indumatched Trees and Graphs of Bounded Girth (Q5060441) (← links)
• On the parameterized complexity of the acyclic matching problem (Q6038700) (← links)
• Computational complexity and linear formulations for optimizing the location of shared mobility stations (Q6495374) (← links)
• A bisection approach to subcubic maximum induced matching (Q6575400) (← links)
• An improved kernel and parameterized algorithm for almost induced matching (Q6636070) (← links)
• Edge open packing: complexity, algorithmic aspects, and bounds (Q6646442) (← links)
• Parameterized results on acyclic matchings with implications for related problems (Q6655671) (← links)
• Well-indumatched pseudoforests (Q6657223) (← links)