The following pages link to (Q5501338):
Displayed 18 items.
- A tight bound on the length of odd cycles in the incompatibility graph of a non-C1P matrix (Q456131) (← links)
- Certifying algorithms (Q465678) (← links)
- On counting interval lengths of interval graphs (Q531590) (← links)
- A faster algorithm for finding minimum Tucker submatrices (Q693064) (← links)
- Certifying algorithms for recognizing proper circular-arc graphs and unit circular-arc graphs (Q967378) (← links)
- Approximation and fixed-parameter algorithms for consecutive ones submatrix problems (Q972381) (← links)
- A note on computing set overlap classes (Q975443) (← links)
- Phylogenetic graph models beyond trees (Q1026198) (← 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)
- Iterated local search for consecutive block minimization (Q2668701) (← links)
- A general algorithmic scheme for combinatorial decompositions with application to modular decompositions of hypergraphs (Q2672614) (← links)
- A Polynomial-Time Algorithm for Finding a Minimal Conflicting Set Containing a Given Row (Q3007640) (← links)
- Consecutive Ones Property Testing: Cut or Swap (Q3091461) (← links)
- Linear-Time Algorithms for Finding Tucker Submatrices and Lekkerkerker--Boland Subgraphs (Q3462544) (← links)
- Proper Helly Circular-Arc Graphs (Q3508572) (← links)
- On a Verification Framework for Certifying Distributed Algorithms: Distributed Checking and Consistency (Q5881540) (← links)
- Linear-Time Recognition of Probe Interval Graphs (Q5899485) (← links)