The following pages link to (Q3397627):
Displaying 14 items.
- Circular convex bipartite graphs: feedback vertex sets (Q300230) (← links)
- Circular-arc hypergraphs: rigidity via connectedness (Q516817) (← links)
- A faster algorithm for finding minimum Tucker submatrices (Q693064) (← links)
- Approximation and fixed-parameter algorithms for consecutive ones submatrix problems (Q972381) (← links)
- A Lex-BFS-based recognition algorithm for Robinsonian matrices (Q1786881) (← links)
- A type of algebraic structure related to sets of intervals (Q2088070) (← links)
- Cyclic arrangements with minimum modulo \(m\) winding numbers (Q2117515) (← links)
- A five-element transformation monoid on labelled trees (Q2311382) (← links)
- Approximability and parameterized complexity of multicover by \(c\)-intervals (Q2348702) (← links)
- Minimising the number of gap-zeros in binary matrices (Q2355802) (← links)
- Min (a)cyclic feedback vertex sets and MIN ones monotone 3-SAT (Q2632009) (← links)
- Circular Convex Bipartite Graphs: Feedback Vertex Set (Q2867126) (← links)
- A Polynomial-Time Algorithm for Finding a Minimal Conflicting Set Containing a Given Row (Q3007640) (← links)
- The bus rapid transit investment problem (Q6568452) (← links)
