Author of the publication

Computational complexity of queries based on itemsets.

. Inf. Process. Lett., 98 (5): 183-187 (2006)

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

Are your Items in Order.. SDM, page 414-425. SIAM / Omnipress, (2011)Computational complexity of queries based on itemsets.. Inf. Process. Lett., 98 (5): 183-187 (2006)Beyond rankings: comparing directed acyclic graphs., , and . Data Min. Knowl. Discov., 29 (5): 1233-1257 (2015)Mining closed strict episodes., and . Data Min. Knowl. Discov., 25 (1): 34-66 (2012)Using background knowledge to rank itemsets., and . Data Min. Knowl. Discov., 21 (2): 293-309 (2010)Column-coherent matrix decomposition.. Data Min. Knowl. Discov., 37 (6): 2564-2588 (November 2023)Finding events in temporal networks: segmentation meets densest subgraph discovery., , , , and . Knowl. Inf. Syst., 62 (4): 1611-1639 (2020)Discovering Nested Communities., and . ECML/PKDD (2), volume 8189 of Lecture Notes in Computer Science, page 32-47. Springer, (2013)Density-friendly Graph Decomposition., and . WWW, page 1089-1099. ACM, (2015)Finding Robust Itemsets Under Subsampling, , and . ACM Trans. Database Syst., 39 (3): 20:1--20:27 (October 2014)