A formal framework for evaluating heuristic programs
Annals of Mathematics and Artificial Intelligence
On frequent sets of Boolean matrices
Annals of Mathematics and Artificial Intelligence
Machine Learning on the Basis of Formal Concept Analysis
Automation and Remote Control
Efficient generation of plane trees
Information Processing Letters
Algorithms for the Construction of Concept Lattices and Their Diagram Graphs
PKDD '01 Proceedings of the 5th European Conference on Principles of Data Mining and Knowledge Discovery
Separators Are as Simple as Cutsets
ASIAN '99 Proceedings of the 5th Asian Computing Science Conference on Advances in Computing Science
Efficient Generation of Plane Triangulations without Repetitions
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Enumerating Floorplans with n Rooms
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Generalized Model-Checking Problems for First-Order Logic
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Efficient Generation of Triconnected Plane Triangulations
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
A Linear Time Algorithm for Enumerating All the Minimum and Minimal Separators of a Chordal Graph
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
Efficient generation of triconnected plane triangulations
Computational Geometry: Theory and Applications
Efficient Enumeration of Ordered Trees with k Leaves (Extended Abstract)
WALCOM '09 Proceedings of the 3rd International Workshop on Algorithms and Computation
Constant Time Generation of Integer Partitions
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
On the Complexity of Constraint-Based Theory Extraction
DS '09 Proceedings of the 12th International Conference on Discovery Science
Construction of candidate topologies for large-scale networks
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Efficiently constructing candidate set for network topology design
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Space-optimal, backtracking algorithms to list the minimal vertex separators of a graph
Discrete Applied Mathematics
Constant time generation of biconnected rooted plane graphs
FAW'10 Proceedings of the 4th international conference on Frontiers in algorithmics
Direct local pattern sampling by efficient two-step random procedures
Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining
Information Sciences: an International Journal
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
Constant time generation of linear extensions
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Constant time generation of trees with specified diameter
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
Efficient enumeration of ordered trees with k leaves
Theoretical Computer Science
Ranking and unranking of non-regular trees with a prescribed branching sequence
Mathematical and Computer Modelling: An International Journal
Computing Formal Concepts by Attribute Sorting
Fundamenta Informaticae - Concept Lattices and Their Applications
| Hi-index | 0.00 |