Pages that link to "Item:Q972381"
From MaRDI portal
The following pages link to Approximation and fixed-parameter algorithms for consecutive ones submatrix problems (Q972381):
Displaying 17 items.
- Two-layer planarization parameterized by feedback edge set (Q391093) (← links)
- A tight bound on the length of odd cycles in the incompatibility graph of a non-C1P matrix (Q456131) (← links)
- A faster algorithm for finding minimum Tucker submatrices (Q693064) (← links)
- Classical complexity and fixed-parameter tractability of simultaneous consecutive ones submatrix \& editing problems (Q777287) (← links)
- The weighted consecutive ones problem for a fixed number of rows or columns. (Q1400344) (← links)
- Cyclic arrangements with minimum modulo \(m\) winding numbers (Q2117515) (← links)
- Simultaneous consecutive ones submatrix and editing problems: classical complexity and fixed-parameter tractable results (Q2297848) (← links)
- Obtaining matrices with the consecutive ones property by row deletions (Q2343088) (← links)
- Minimising the number of gap-zeros in binary matrices (Q2355802) (← links)
- The consecutive ones submatrix problem for sparse matrices (Q2642313) (← links)
- A Polynomial-Time Algorithm for Finding a Minimal Conflicting Set Containing a Given Row (Q3007640) (← links)
- Measuring Indifference: Unit Interval Vertex Deletion (Q3057628) (← links)
- Linear-Time Algorithms for Finding Tucker Submatrices and Lekkerkerker--Boland Subgraphs (Q3462544) (← links)
- A Spectral Algorithm for Seriation and the Consecutive Ones Problem (Q4210149) (← links)
- A bad submatrix is easy to find (Q4305120) (← links)
- Algorithms and Computation (Q5712170) (← links)
- Temporal interval cliques and independent sets (Q6039892) (← links)
