Subgraph isomorphism in planar graphs and related problems
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Scalable Algorithms for Association Mining
IEEE Transactions on Knowledge and Data Engineering
On the Complexity of Generating Maximal Frequent and Minimal Infrequent Sets
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
On Maximal Frequent and Minimal Infrequent Sets in Binary Matrices
Annals of Mathematics and Artificial Intelligence
Consensus algorithms for the generation of all maximal bicliques
Discrete Applied Mathematics - The fourth international colloquium on graphs and optimisation (GO-IV)
On the generation of bicliques of a graph
Discrete Applied Mathematics
IEEE Transactions on Knowledge and Data Engineering
An approximation ratio for biclustering
Information Processing Letters
A Linear Delay Algorithm for Building Concept Lattices
CPM '08 Proceedings of the 19th annual symposium on Combinatorial Pattern Matching
Area-universal rectangular layouts
Proceedings of the twenty-fifth annual symposium on Computational geometry
The h-Index of a Graph and Its Application to Dynamic Subgraph Statistics
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
Biclique edge cover graphs and confluent drawings
GD'06 Proceedings of the 14th international conference on Graph drawing
Deterministic distributed vertex coloring in polylogarithmic time
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
A case study on financial ratios via cross-graph quasi-bicliques
Information Sciences: an International Journal
Compact labelings for efficient first-order model-checking
Journal of Combinatorial Optimization
Deterministic Distributed Vertex Coloring in Polylogarithmic Time
Journal of the ACM (JACM)
Combinatorics and Geometry of Finite and Infinite Squaregraphs
SIAM Journal on Discrete Mathematics
A correspondence between maximal complete bipartite subgraphs and closed patterns
PKDD'05 Proceedings of the 9th European conference on Principles and Practice of Knowledge Discovery in Databases
Local connectivity tests to identify wormholes in wireless networks
MobiHoc '11 Proceedings of the Twelfth ACM International Symposium on Mobile Ad Hoc Networking and Computing
Discovering context-topic rules in search engine logs
SPIRE'06 Proceedings of the 13th international conference on String Processing and Information Retrieval
Efficient mining of large maximal bicliques
DaWaK'06 Proceedings of the 8th international conference on Data Warehousing and Knowledge Discovery
Approximation scheme for lowest outdegree orientation and graph density measures
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Packing and squeezing subgraphs into planar graphs
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Mining direct antagonistic communities in signed social networks
Information Processing and Management: an International Journal
Planar packing of binary trees
WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures
A convexity upper bound for the number of maximal bicliques of a bipartite graph
Discrete Applied Mathematics
Hi-index | 0.89 |