Biblio
"Locating Motifs in Time-Series Data", PAKDD, pp. 343-353, 2005.
, "Fast Computation of Reachability Labeling for Large Graphs", EDBT, pp. 961-979, 2006.
, "Finding Top-k Min-Cost Connected Trees in Databases", ICDE, pp. 836-845, 2007.
, "Fast computing reachability labelings for large graphs with high compression rate", EDBT, pp. 193-204, 2008.
, "Spotting Significant Changing Subgraphs in Evolving Graphs", ICDM, pp. 917-922, 2008.
, "High efficiency and quality: large graphs matching", CIKM, pp. 1755-1764, 2011.
, "Efficiently computing k-edge connected components via graph decomposition", SIGMOD Conference: ACM, pp. 205-216, 2013.
, "High efficiency and quality: large graphs matching", VLDB J., vol. 22, no. 3, pp. 345-368, 2013.
, "I/O efficient: computing SCCs in massive graphs", SIGMOD Conference: ACM, pp. 181-192, 2013.
, "I/O efficient: computing SCCs in massive graphs", {VLDB} J., vol. 24, pp. 245–270, 2015.
, "Speedup Graph Processing by Graph Ordering", Proceedings of the 2016 International Conference on Management of Data, {SIGMOD} Conference 2016, San Francisco, CA, USA, June 26 - July 01, 2016, pp. 1813–1828, 2016.
,