| |
| * | 2009 | |
|---|---|---|
| 7 | EE | Natalia Vanetik: Computing the tree number of a cut-outerplanar graph CoRR abs/0906.0422: (2009) |
| 6 | EE | Natalia Vanetik: Path packing and a related optimization problem. J. Comb. Optim. 17(2): 192-205 (2009) |
| 2008 | ||
| 5 | EE | Natalia Vanetik: On fractionality of the path packing problem CoRR abs/0809.3565: (2008) |
| 2006 | ||
| 4 | EE | Natalia Vanetik, Solomon Eyal Shimony, Ehud Gudes: Support measures for graph data. Data Min. Knowl. Discov. 13(2): 243-260 (2006) |
| 3 | EE | Ehud Gudes, Solomon Eyal Shimony, Natalia Vanetik: Discovering Frequent Graph Patterns Using Disjoint Paths. IEEE Trans. Knowl. Data Eng. 18(11): 1441-1456 (2006) |
| 2004 | ||
| 2 | EE | Natalia Vanetik, Ehud Gudes: Mining Frequent Labeled and Partially Labeled Graph Patterns. ICDE 2004: 91-102 |
| 2002 | ||
| 1 | EE | Natalia Vanetik, Ehud Gudes, Solomon Eyal Shimony: Computing Frequent Graph Patterns from Semistructured Data. ICDM 2002: 458-465 |
| 1 | Ehud Gudes | [1] [2] [3] [4] |
| 2 | Solomon Eyal Shimony | [1] [3] [4] |