Constant time generation of free trees
SIAM Journal on Computing
Mining tree queries in a graph
Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining
Generating rooted and free plane trees
ACM Transactions on Algorithms (TALG)
A loopless Gray code for rooted trees
ACM Transactions on Algorithms (TALG)
A study of graph spectra for comparing graphs and trees
Pattern Recognition
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
End System Multicast routing for multi-party videoconferencing applications
Computer Communications
Backdoor attacks on black-box ciphers exploiting low-entropy plaintexts
ACISP'03 Proceedings of the 8th Australasian conference on Information security and privacy
An efficient algorithm for generating colored outerplanar graphs
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
Constant time generation of biconnected rooted plane graphs
FAW'10 Proceedings of the 4th international conference on Frontiers in algorithmics
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
Enumerating rooted graphs with reflectional block structures
CIAC'10 Proceedings of the 7th international conference on Algorithms and Complexity
Efficient enumeration of ordered trees with k leaves
Theoretical Computer Science
Communication: House of Graphs: A database of interesting graphs
Discrete Applied Mathematics
| Hi-index | 0.00 |