A branch-and-cut approach to physical mapping with end-probes
RECOMB '97 Proceedings of the first annual international conference on Computational molecular biology
An O(n2 algorithm for circular-arc graph recognition
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
A Linear Time Algorithm for Deciding Interval Graph Isomorphism
Journal of the ACM (JACM)
A note on the consecutive ones submatrix problem
Information Processing Letters
Polyhedral Aspects of the Consecutive Ones Problem
COCOON '00 Proceedings of the 6th Annual International Conference on Computing and Combinatorics
An efficient algorithm for determining whether a cubic graph is toroidal
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Counting and Reporting Intersections of d-Ranges
IEEE Transactions on Computers
Banded structure in binary matrices
Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining
Consecutive block minimization is 1.5-approximable
Information Processing Letters
The simultaneous consecutive ones problem
Theoretical Computer Science
Counting the orderings for multisets in consecutive ones property and PQ-trees
DLT'11 Proceedings of the 15th international conference on Developments in language theory
A fast bipartite network flow algorithm for selective assembly
Operations Research Letters
The weighted consecutive ones problem for a fixed number of rows or columns
Operations Research Letters
Consecutive ones property and PQ-trees for multisets: Hardness of counting their orderings
Information and Computation
Hi-index | 0.00 |