Pages that link to "Item:Q932323"
From MaRDI portal
The following pages link to Approximating the 2-interval pattern problem (Q932323):
Displaying 10 items.
- On the parameterized complexity of some optimization problems related to multiple-interval graphs (Q606990) (← links)
- Complexity issues in color-preserving graph embeddings (Q846361) (← links)
- A 2-approximation for the preceding-and-crossing structured 2-interval pattern problem (Q996823) (← links)
- Improved algorithms for largest cardinality 2-interval pattern problem (Q996829) (← links)
- On recovering syntenic blocks from comparative maps (Q1041433) (← links)
- On the computational complexity of 2-interval pattern matching problems (Q1884946) (← links)
- Parameterized complexity of two-interval pattern problem (Q2067621) (← links)
- Recognizing \(d\)-interval graphs and \(d\)-track interval graphs (Q2375953) (← links)
- Extracting constrained 2-interval subsets in 2-interval sets (Q2456375) (← links)
- Algorithms – ESA 2005 (Q5475853) (← links)