Pages that link to "Item:Q294733"

The following pages link to Maximum weight independent sets and cliques in intersection graphs of filaments (Q294733):

Displaying 41 items.

• Graphs of edge-intersecting non-splitting paths in a tree: representations of holes. I (Q323036) (← links)
• An algorithm for the maximum weight independent set problem on outerstring graphs (Q680149) (← links)
• On-line approach to off-line coloring problems on graphs with geometric representations (Q722314) (← links)
• The induced separation dimension of a graph (Q722529) (← links)
• On the structure of certain intersection graphs (Q845675) (← links)
• Fixed interval scheduling: models, applications, computational complexity and algorithms (Q859906) (← links)
• Algorithms for \(\mathcal{GA}\mathrm{-}\mathcal H\) reduced graphs (Q891818) (← links)
• Minimum weight feedback vertex sets in circle graphs (Q963384) (← links)
• Maximum independent set and maximum clique algorithms for overlap graphs (Q1408815) (← links)
• Induced matchings in intersection graphs. (Q1427466) (← links)
• Algorithms for maximum weight induced paths (Q1603504) (← links)
• Cops and robbers on intersection graphs (Q1645059) (← links)
• The critical node detection problem in networks: a survey (Q1750314) (← links)
• Towards a comprehensive theory of conflict-tolerance graphs (Q1759850) (← links)
• Finding a maximum induced matching in weakly chordal graphs (Q1810638) (← links)
• Algorithms for induced biclique optimization problems (Q1944925) (← links)
• Distributed interactive proofs for the recognition of some geometric intersection graph classes (Q2097349) (← links)
• On strict (outer-)confluent graphs (Q2206846) (← links)
• The complexity of dissociation set problems in graphs (Q2275943) (← links)
• The maximum clique problem in multiple interval graphs (Q2350898) (← links)
• The \(k\)-separator problem: polyhedra, complexity and approximation results (Q2354313) (← links)
• Subtree filament graphs are subtree overlap graphs (Q2380028) (← links)
• New insights on \(\mathbf{GA}\)-\(\mathbf H\) reduced graphs (Q2404619) (← links)
• Robust maximum weighted independent-set problems on interval graphs (Q2439511) (← links)
• 3D-interval-filament graphs (Q2462403) (← links)
• Approximating the minimum clique cover and other hard problems in subtree filament graphs (Q2506362) (← links)
• The graphs with maximum induced matching and maximum matching the same size (Q2568473) (← links)
• Independent packings in structured graphs (Q2583122) (← links)
• Maximum weight induced multicliques and complete multipartite subgraphs in directed path overlap graphs (Q2788740) (← links)
• MINIMUM WEIGHT FEEDBACK VERTEX SETS IN CIRCLE n-GON GRAPHS AND CIRCLE TRAPEZOID GRAPHS (Q2890989) (← links)
• Maximum Independent Set in 2-Direction Outersegment Graphs (Q3104773) (← links)
• Induced Separation Dimension (Q3181052) (← links)
• Recognition of Polygon-Circle Graphs and Graphs of Interval Filaments Is NP-Complete (Q3508571) (← links)
• Algorithms on Subtree Filament Graphs (Q3655136) (← links)
• A Faster Algorithm for Maximum Induced Matchings on Circle Graphs (Q4585063) (← links)
• Approximation algorithms for maximum weight <i>k</i>-coverings of graphs by packings (Q5063275) (← links)
• On Strict (Outer-)Confluent Graphs (Q5084690) (← links)
• A faster algorithm for maximum independent set on interval filament graphs (Q5084714) (← links)
• Convex Recoloring Revisited: Complexity and Exact Algorithms (Q5323087) (← links)
• Maximum max-k-clique subgraphs in cactus subtree graphs (Q6132893) (← links)
• Grounded \(\mathrm{L}\)-graphs are polynomially \(\chi \)-bounded (Q6142355) (← links)