Author of the publication

Mining Frequent Closed Unordered Trees Through Natural Representations

, , and . Proceedings of the 15th International Conference on Conceptual Structures (ICCS 2007), volume 4604 of Lecture Notes in Artificial Intelligence, page 347-359. Berlin, Heidelberg, Springer-Verlag, (July 2007)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Seeded Tree Alignment and Planar Tanglegram Layout., , , , and . WABI, volume 4645 of Lecture Notes in Computer Science, page 98-110. Springer, (2007)The Complexity of Modular Graph Automorphism., , and . STACS, volume 1373 of Lecture Notes in Computer Science, page 172-182. Springer, (1998)Antimagic labelings of caterpillars., , and . Appl. Math. Comput., (2019)On Sparse Hard Sets for Counting Classes., and . Theor. Comput. Sci., 112 (2): 255-275 (1993)Mining Frequent Closed Unordered Trees Through Natural Representations., , and . ICCS, volume 4604 of Lecture Notes in Computer Science, page 347-359. Springer, (2007)Tile-Packing Tomography Is \mathbbNPNP-hard., , , , and . COCOON, volume 6196 of Lecture Notes in Computer Science, page 254-263. Springer, (2010)The oriented chromatic number of the hexagonal grid is 6.. Discret. Appl. Math., (2024)Subtree Testing and Closed Tree Mining Through Natural Representations., , and . DEXA Workshops, page 499-503. IEEE Computer Society, (2007)Mining Frequent Closed Unordered Trees Through Natural Representations, , and . Proceedings of the 15th International Conference on Conceptual Structures (ICCS 2007), volume 4604 of Lecture Notes in Artificial Intelligence, page 347-359. Berlin, Heidelberg, Springer-Verlag, (July 2007)The Complexity of Graph Problems fore Succinctly Represented Graphs., and . WG, volume 411 of Lecture Notes in Computer Science, page 277-286. Springer, (1989)