|
|
Peer-reviewed publications
- On the fractionality of the path packing problem,
by N. Vanetik, to appear in Journal of Combinatorial Optimization.
DOI 10/1007/s10878-011-9405-3 [pdf]
This one is #51 in A. Schrijver's list of 75 open problems in
combinatorics and graph theory.
- The classification problem for graphs and lattices is wild,
by R. Lipyanski and N. Vanetik, in Proceeding of the International
Conference on Modern Algebra and its Applications,
pp. 107-111, Batumi, September 20th-26th, 2010.
[pdf]
- Mining graphs with constraints on symmetry and diameter,
by N. Vanetik, in Proceedings, IWGD 2010,
Jiuzhaigou, China. [pdf]
- Path packing and a related optimization problem,
by N. Vanetik, Journal of Combinatorial Optimization, vol 17(2)
pp. 192-205, February 2009.
[pdf]
- Subsea: an efficient heuristic algorithm for subgraph isomorphism,
by V. Lipets, N. Vanetik and E. Gudes,
Vol. 19(3) pp.351-375, DAMI Journal, December 2009.
[pdf]
- Discovering frequent graph patterns using disjoint paths,
by N. Vanetik, E. Gudes, E. Shimony,
IEEE transactions on Knowledge and Data Engineering,
vol. 18, pp. 1441-1457, November 2006.
[pdf]
- Support measures for graph data,
by N. Vanetik, E. Gudes, E. Shimony,
DAMI journal vol. 13(2) pp. 243-260, Springer, September 2006.
[pdf]
- Mining frequent labeled and partially labeled patterns,
by N. Vanetik, E. Gudes, E. Shimony,
in Proceedings of ICDE 2004, pp. 91-102, Boston, USA.
- Computing frequent graph patterns from semi-structured data,
by N. Vanetik, E. Gudes, E. Shimony,
in Proceedings of ICDM 2002, pp. 458-465, Maebashi, Japan.
- Remote conferencing with multimedia objects,
by E. Gudes, C. Domshlak and N. Orlov (Vanetik),
in Proceedings, Second International Workshop on
Multimedia Data Document Engineering (MDDE-02), Prague, 2002.
|