Pages that link to "Item:Q2842171"
From MaRDI portal
The following pages link to Approximation Algorithms for B 1-EPG Graphs (Q2842171):
Displaying 14 items.
- Edge intersection graphs of \(L\)-shaped paths in grids (Q299080) (← links)
- On the bend-number of planar and outerplanar graphs (Q477341) (← links)
- Clique coloring \(B_1\)-EPG graphs (Q512582) (← links)
- CPG graphs: some structural and hardness results (Q827595) (← links)
- On independent set in \(B_1\)-EPG graphs (Q2174555) (← links)
- Hardness and approximation for L-EPG and \(B_1\)-EPG graphs (Q2184686) (← links)
- On edge intersection graphs of paths with 2 bends (Q2357780) (← links)
- Edge-intersection graphs of grid paths: the bend-number (Q2440108) (← links)
- On \(k\)-bend and monotonic \(\ell\)-bend edge intersection graphs of paths on a grid (Q2691570) (← links)
- On approximating MIS over B1-VPG graphs* (Q5057743) (← links)
- (Q5133652) (← links)
- Monotonic Representations of Outerplanar Graphs as Edge Intersection Graphs of Paths on a Grid (Q5886040) (← links)
- On the bend number of circular-arc graphs as edge intersection graphs of paths on a grid (Q5890935) (← links)
- On the bend number of circular-arc graphs as edge intersection graphs of paths on a grid (Q5915780) (← links)
