Maximum independent set and maximum clique algorithms for overlap graphs
Discrete Applied Mathematics - Special issue: The second international colloquium, "journées de l'informatique messine"
Subtree filament graphs are subtree overlap graphs
Information Processing Letters
Efficient lineage tracking for scientific workflows
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Maximum independent set and maximum clique algorithms for overlap graphs
Discrete Applied Mathematics
SIAM Journal on Discrete Mathematics
Hi-index | 0.00 |