Pages that link to "Item:Q680149"
From MaRDI portal
The following pages link to An algorithm for the maximum weight independent set problem on outerstring graphs (Q680149):
Displaying 17 items.
- Generalized disk graphs (Q832849) (← links)
- Algorithm to find a maximum 2-packing set in a cactus (Q1748991) (← links)
- On dominating set of some subclasses of string graphs (Q2144448) (← links)
- Faster multi-sided one-bend boundary labelling (Q2232239) (← links)
- Polygon simplification by minimizing convex corners (Q2272403) (← links)
- Packing boundary-anchored rectangles and squares (Q2306362) (← links)
- Approximating dominating set on intersection graphs of rectangles and \(\mathsf{L}\)-frames (Q2331213) (← links)
- The Maximum Disjoint Routing Problem (Q2817875) (← links)
- Order-Preserving 1-String Representations of Planar Graphs (Q2971141) (← links)
- Intersection Graphs of Rays and Grounded Segments (Q4585058) (← links)
- A Faster Algorithm for Maximum Induced Matchings on Circle Graphs (Q4585063) (← links)
- Approximating Dominating Set on Intersection Graphs of Rectangles and L-frames (Q5005138) (← links)
- On approximating MIS over B1-VPG graphs* (Q5057743) (← links)
- (Q5116474) (← links)
- Boundary Labeling for Rectangular Diagrams (Q5116476) (← links)
- Finding a Maximum Clique in a Grounded 1-Bend String Graph (Q5886042) (← links)
- Computing maximum independent set on outerstring graphs and their relatives (Q5918655) (← links)
