Instant recognition of polynominal time solvability, half integrality and 2-approximations
APPROX '00 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization
Randomized Approximation Algorithms for Query Optimization Problems on Two Processors
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Playing hide-and-seek with correlations
Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
The maximum edge biclique problem is NP-complete
Discrete Applied Mathematics
A notion of cross-perfect bipartite graphs
Information Processing Letters
A new approach for approximating node deletion problems
Information Processing Letters
A New Conceptual Clustering Framework
Machine Learning
Finding the most interesting correlations in a database: how hard can it be?
Information Systems
Local ratio: A unified framework for approximation algorithms. In Memoriam: Shimon Even 1935-2004
ACM Computing Surveys (CSUR)
Consensus algorithms for the generation of all maximal bicliques
Discrete Applied Mathematics - The fourth international colloquium on graphs and optimisation (GO-IV)
Discovery and regeneration of hidden emails
Proceedings of the 2005 ACM symposium on Applied computing
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Generating bicliques of a graph in lexicographic order
Theoretical Computer Science
Finding biclusters by random projections
Theoretical Computer Science
The role mining problem: finding a minimal descriptive set of roles
Proceedings of the 12th ACM symposium on Access control models and technologies
On the generation of bicliques of a graph
Discrete Applied Mathematics
Dense subgraph problems with output-density conditions
ACM Transactions on Algorithms (TALG)
An approximation ratio for biclustering
Information Processing Letters
Generating all maximal induced subgraphs for hereditary and connected-hereditary graph properties
Journal of Computer and System Sciences
On Independent Sets and Bicliques in Graphs
Graph-Theoretic Concepts in Computer Science
Compact Representation of Sets of Binary Constraints
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
The role mining problem: A formal perspective
ACM Transactions on Information and System Security (TISSEC)
Exact exponential-time algorithms for finding bicliques
Information Processing Letters
A compression-boosting transform for two-dimensional data
AAIM'06 Proceedings of the Second international conference on Algorithmic Aspects in Information and Management
A new combinatorial approach to supervised learning: application to gait recognition
AMFG'05 Proceedings of the Second international conference on Analysis and Modelling of Faces and Gestures
Dense subgraph problems with output-density conditions
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
An improved rectangular decomposition algorithm for imprecise and uncertain knowledge discovery
FSKD'05 Proceedings of the Second international conference on Fuzzy Systems and Knowledge Discovery - Volume Part I
An exact exponential time algorithm for counting bipartite cliques
Information Processing Letters
Fast fusion moves for multi-model estimation
ECCV'12 Proceedings of the 12th European conference on Computer Vision - Volume Part I
ACM Transactions on Algorithms (TALG)
Extract and rank web communities
Proceedings of the 3rd International Conference on Web Intelligence, Mining and Semantics
Hi-index | 0.01 |