Pages that link to "Item:Q2642313"
From MaRDI portal
The following pages link to The consecutive ones submatrix problem for sparse matrices (Q2642313):
Displaying 12 items.
- A faster algorithm for finding minimum Tucker submatrices (Q693064) (← links)
- Finding nonoverlapping substructures of a sparse matrix (Q871156) (← links)
- Approximation and fixed-parameter algorithms for consecutive ones submatrix problems (Q972381) (← links)
- Red-blue covering problems and the consecutive ones property (Q1018089) (← links)
- Hardness results on the gapped consecutive-ones property problem (Q1759853) (← links)
- A note on the consecutive ones submatrix problem. (Q1853060) (← links)
- Obtaining matrices with the consecutive ones property by row deletions (Q2343088) (← links)
- Minimising the number of gap-zeros in binary matrices (Q2355802) (← links)
- A bad submatrix is easy to find (Q4305120) (← links)
- Algorithms and Computation (Q5712170) (← links)
- Consecutive ones matrices for multi-dimensional orthogonal packing problems (Q5891542) (← links)
- Quantum graph drawing (best student paper) (Q6575378) (← links)