Fast parallel algorithms for chordal graphs
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
On Asymmetric Invalidation with Partial Tests
IEEE Transactions on Computers
ACM Computing Surveys (CSUR)
On the complexity of the maximum cut problem
Nordic Journal of Computing
DS '99 Proceedings of the Second International Conference on Discovery Science
On the complexity of finding balanced oneway cuts
Information Processing Letters
The maximum edge biclique problem is NP-complete
Discrete Applied Mathematics
Finding the most interesting correlations in a database: how hard can it be?
Information Systems
Consensus algorithms for the generation of all maximal bicliques
Discrete Applied Mathematics - The fourth international colloquium on graphs and optimisation (GO-IV)
Parallel scheduling of complex dags under uncertainty
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Recognizing and representing proper interval graphs in parallel using merging and sorting
Discrete Applied Mathematics
Retrieval for decision support resources by structured models
Decision Support Systems
Coclustering of Human Cancer Microarrays Using Minimum Sum-Squared Residue Coclustering
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
A theory of average-case compilability in knowledge representation
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
An evolutionary approach for biclustering of gene expression data
International Journal of Bio-Inspired Computation
ACISP'10 Proceedings of the 15th Australasian conference on Information security and privacy
The effect of homogeneity on the complexity of k-anonymity
FCT'11 Proceedings of the 18th international conference on Fundamentals of computation theory
Algorithmic graph minor theory: improved grid minor bounds and wagner's contraction
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
The black-and-white coloring problem on distance-hereditary graphs and strongly chordal graphs
FAW-AAIM'12 Proceedings of the 6th international Frontiers in Algorithmics, and Proceedings of the 8th international conference on Algorithmic Aspects in Information and Management
Who tags what?: an analysis framework
Proceedings of the VLDB Endowment
Linear time algorithm for computing a small biclique in graphs without long induced paths
SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
The effect of homogeneity on the computational complexity of combinatorial data anonymization
Data Mining and Knowledge Discovery
| Hi-index | 0.00 |