A note on the consecutive ones submatrix problem
Information Processing Letters
Consecutive block minimization is 1.5-approximable
Information Processing Letters
Ptolemaic graphs and interval graphs are leaf powers
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Approximation algorithms for the consecutive ones submatrix problem on sparse matrices
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Minimizing index size by reordering rows and columns
SSDBM'12 Proceedings of the 24th international conference on Scientific and Statistical Database Management
Normal Helly circular-arc graphs and its subclasses
Discrete Applied Mathematics
| Hi-index | 0.89 |